Journal of Symbolic Logic

Non-well-foundedness of well-orderable power sets

Abstract

Tarski [Tarski] showed that for any set X, its set w(X) of well-orderable subsets has cardinality strictly greater than that of X, even in the absence of the axiom of choice. We construct a Fraenkel-Mostowski model in which there is an infinite strictly descending sequence under the relation |w(X)| = |Y|. This contrasts with the corresponding situation for power sets, where use of Hartogs’ ℵ-function easily establishes that there can be no infinite descending sequence under the relation |𝒫(X)| = |Y|.

Article information

Source
J. Symbolic Logic, Volume 68, Issue 3 (2003), 879- 884.

Dates
First available in Project Euclid: 17 July 2003

Permanent link to this document
https://projecteuclid.org/euclid.jsl/1058448446

Digital Object Identifier
doi:10.2178/jsl/1058448446

Mathematical Reviews number (MathSciNet)
MR2004e:03083

Zentralblatt MATH identifier
1055.03029

Citation

Forster, T. E.; Truss, J. K. Non-well-foundedness of well-orderable power sets. J. Symbolic Logic 68 (2003), no. 3, 879-- 884. doi:10.2178/jsl/1058448446. https://projecteuclid.org/euclid.jsl/1058448446

References

• T. Forster and R. Kaye End-extensions preserving power set, Journal of Symbolic Logic, vol. 56 (1991), pp. 323--328.
• T. Jech and A. Sochor Applications of the $\theta$-model, Bulletin de l'Académie Polonaise des Sciences, vol. 14 (1966), pp. 297--303 and 351--355.
• G. Kirmayer A refinement of Cantor's theorem, Proceedings of the American Mathematical Society, vol. 83 (1981), p. 774.
• A. R. D. Mathias The strength of Mac Lane set theory, Annals of Pure and Applied Logic, vol. 110 (2001), pp. 107--234.
• A. Tarski On well-ordered subsets of any set, Fundamenta Mathematicae, vol. 32 (1939), pp. 176--183.
• J. K. Truss Permutations and the axiom of choice, Automorphisms of first-order structures (R. Kaye and D. Macpherson, editors), Oxford University Press,1994, pp. 131--152.