For the modern set theorist the empty set Ø, the singleton {a}, and the ordered pair 〈x, y〉 are at the beginning of the systematic, axiomatic development of set theory, both as a field of mathematics and as a unifying framework for ongoing mathematics. These notions are the simplest building locks in the abstract, generative conception of sets advanced by the initial axiomatization of Ernst Zermelo [1908a] and are quickly assimilated long before the complexities of Power Set, Replacement, and Choice (...) are broached in the formal elaboration of the ‘set of’f {} operation. So it is surprising that, while these notions are unproblematic today, they were once sources of considerable concern and confusion among leading pioneers of mathematical logic like Frege, Russell, Dedekind, and Peano. In the development of modern mathematical logic out of the turbulence of 19th century logic, the emergence of the empty set, the singleton, and the ordered pair as clear and elementary set-theoretic concepts serves as amotif that reflects and illuminates larger and more significant developments in mathematical logic: the shift from the intensional to the extensional viewpoint, the development of type distinctions, the logical vs. the iterative conception of set, and the emergence of various concepts and principles as distinctively set-theoretic rather than purely logical. Here there is a loose analogy with Tarski's recursive definition of truth for formal languages: The mathematical interest lies mainly in the procedure of recursion and the attendant formal semantics in model theory, whereas the philosophical interest lies mainly in the basis of the recursion, truth and meaning at the level of basic predication. Circling back to the beginning, we shall see how central the empty set, the singleton, and the ordered pair were, after all. (shrink)

Set theory is an autonomous and sophisticated field of mathematics, enormously successful not only at its continuing development of its historical heritage but also at analyzing mathematical propositions cast in set-theoretic terms and gauging their consistency strength. But set theory is also distinguished by having begun intertwined with pronounced metaphysical attitudes, and these have even been regarded as crucial by some of its great developers. This has encouraged the exaggeration of crises in foundations and of metaphysical doctrines in general. However, (...) set theory has proceeded in the opposite direction, from a web of intensions to a theory of extensionpar excellence, and like other fields of mathematics its vitality and progress have depended on a steadily growing core of mathematical structures and methods, problems and results. There is also the stronger contention that from the beginning set theory actually developed through a progression ofmathematicalmoves, whatever and sometimes in spite of what has been claimed on its behalf.What follows is an account of the development of set theory from its beginnings through the creation of forcing based on these contentions, with an avowedly Whiggish emphasis on the heritage that has been retained and developed by current set theory. The whole transfinite landscape can be viewed as the result of Cantor's attempt to articulate and solve the Continuum Problem. (shrink)

If we assume the axiom of choice, then every two cardinal numbers are comparable, In the absence of the axiom of choice, this is no longer so. For a few cardinalities related to an arbitrary infinite set, we will give all the possible relationships between them, where possible means that the relationship is consistent with the axioms of set theory. Further we investigate the relationships between some other cardinal numbers in specific permutation models and give some results provable without using (...) the axiom of choice. (shrink)

In the Zermelo–Fraenkel set theory (ZF), |$|\textrm {fin}(A)|<2^{|A|}\leq |\textrm {Part}(A)|$| for any infinite set |$A$|⁠, where |$\textrm {fin}(A)$| is the set of finite subsets of |$A$|⁠, |$2^{|A|}$| is the cardinality of the power set of |$A$| and |$\textrm {Part}(A)$| is the set of partitions of |$A$|⁠. In this paper, we show in ZF that |$|\textrm {fin}(A)|<|\textrm {Part}_{\textrm {fin}}(A)|$| for any set |$A$| with |$|A|\geq 5$|⁠, where |$\textrm {Part}_{\textrm {fin}}(A)$| is the set of partitions of |$A$| whose members are finite. We (...) also show that, without the Axiom of Choice, any relationship between |$|\textrm {Part}_{\textrm {fin}}(A)|$| and |$2^{|A|}$| for an arbitrary infinite set |$A$| cannot be concluded. (shrink)

We write and for the cardinalities of the set of finite sequences and the set of finite subsets, respectively, of a set which is of cardinality. With the axiom of choice (), for every infinite cardinal but, without, any relationship between and for an arbitrary infinite cardinal cannot be proved. In this paper, we give conditions that make and comparable for an infinite cardinal. Among our results, we show that, if we assume the axiom of choice for sets of finite (...) sets, then for every Dedekind‐infinite cardinal and the condition that is Dedekind‐infinite cannot be weakened to weakly Dedekind‐infinite. (shrink)

With the Axiom of Choice, for any infinite cardinal but, without, we cannot conclude any relationship between and for an arbitrary infinite cardinal. In this paper, we give some properties of in the absence of and compare them to those of for an infinite cardinal. Among our results, we show that “ for any infinite cardinal and any natural number n” is provable in although “ for any infinite cardinal ” is not.

We show that there is a model of ZF in which the Borel hierarchy on the reals has length ω2. This implies that ω1 has countable cofinality, so the axiom of choice fails very badly in our model. A similar argument produces models of ZF in which the Borel hierarchy has exactly λ + 1 levels for any given limit ordinal λ less than ω2. We also show that assuming a large cardinal hypothesis there are models of ZF in which (...) the Borel hierarchy is arbitrarily long. (shrink)

Set theory, it has been contended, developed from its beginnings through a progression ofmathematicalmoves, despite being intertwined with pronounced metaphysical attitudes and exaggerated foundational claims that have been held on its behalf. In this paper, the seminal results of set theory are woven together in terms of a unifying mathematical motif, one whose transmutations serve to illuminate the historical development of the subject. The motif is foreshadowed in Cantor's diagonal proof, and emerges in the interstices of the inclusion vs. membership (...) distinction, a distinction only clarified at the turn of this century, remarkable though this may seem. Russell runs with this distinction, but is quickly caught on the horns of his well-known paradox, an early expression of our motif. The motif becomes fully manifest through the study of functionsof the power set of a set into the set in the fundamental work of Zermelo on set theory. His first proof in 1904 of his Well-Ordering Theoremis a central articulation containing much of what would become familiar in the subsequent development of set theory. Afterwards, the motif is cast by Kuratowski as a fixed point theorem, one subsequently abstracted to partial orders by Bourbaki in connection with Zorn's Lemma. Migrating beyond set theory, that generalization becomes cited as the strongest of fixed point theorems useful in computer science.Section 1 describes the emergence of our guiding motif as a line of development from Cantor's diagonal proof to Russell's Paradox, fueled by the clarification of the inclusion vs. membership distinction. Section 2 engages the motif as fully participating in Zermelo's work on the Well-Ordering Theorem and as newly informing on Cantor's basic result that there is no bijection. Then Section 3 describes in connection with Zorn's Lemma the transformation of the motif into an abstract fixed point theorem, one accorded significance in computer science. (shrink)

In this paper, we consider certain cardinals in ZF (set theory without AC, the axiom of choice). In ZFC (set theory with AC), given any cardinals C and D, either C ≤ D or D ≤ C. However, in ZF this is no longer so. For a given infinite set A consider $\operatorname{seq}^{1 - 1}(A)$ , the set of all sequences of A without repetition. We compare $|\operatorname{seq}^{1 - 1}(A)|$ , the cardinality of this set, to |P(A)|, the cardinality of (...) the power set of A. What is provable about these two cardinals in ZF? The main result of this paper is that $ZF \vdash \forall A(|\operatorname{seq}^{1 - 1}(A)| \neq|\mathscr{P}(\mathscr{A})|)$ , and we show that this is the best possible result. Furthermore, it is provable in ZF that if B is an infinite set, then $|\operatorname{fin}(B)| <|\mathscr{P}(B)|$ even though the existence for some infinite set B* of a function f from $\operatorname{fin}(B^\ast)$ onto P(B*) is consistent with ZF. (shrink)

We discuss the work of Paul Bernays in set theory, mainly his axiomatization and his use of classes but also his higher-order reflection principles.

We write for the cardinality of the set of finite sequences of a set which is of cardinality. With the Axiom of Choice (), for every infinite cardinal where is the cardinality of the permutations on a set which is of cardinality. In this paper, we show that “ for every cardinal ” is provable in and this is the best possible result in the absence of. Similar results are also obtained for : the cardinality of the set of finite (...) sequences without repetition of a set which is of cardinality. (shrink)

Azriel Levy did fundamental work in set theory when it was transmuting into a modern, sophisticated field of mathematics, a formative period of over a decade straddling Cohen’s 1963 founding of forcing. The terms “Levy collapse”, “Levy hierarchy”, and “Levy absoluteness” will live on in set theory, and his technique of relative constructibility and connections established between forcing and definability will continue to be basic to the subject. What follows is a detailed account and analysis of Levy’s work and contributions (...) to set theory. (shrink)

We write $\mathcal {S}_n(A)$ for the set of permutations of a set A with n non-fixed points and $\mathrm {{seq}}^{1-1}_n(A)$ for the set of one-to-one sequences of elements of A with length n where n is a natural number greater than $1$. With the Axiom of Choice, $|\mathcal {S}_n(A)|$ and $|\mathrm {{seq}}^{1-1}_n(A)|$ are equal for all infinite sets A. Among our results, we show, in ZF, that $|\mathcal {S}_n(A)|\leq |\mathrm {{seq}}^{1-1}_n(A)|$ for any infinite set A if ${\mathrm {AC}}_{\leq n}$ is (...) assumed and this assumption cannot be removed. In the other direction, we show that $|\mathrm {{seq}}^{1-1}_n(A)|\leq |\mathcal {S}_{n+1}(A)|$ for any infinite set A and the subscript $n+1$ cannot be reduced to n. Moreover, we also show that “ $|\mathcal {S}_n(A)|\leq |\mathcal {S}_{n+1}(A)|$ for any infinite set A” is not provable in ZF. (shrink)

We investigate, within the framework of Zermelo-Fraenkel set theory ZF, the interrelations between weak forms of the Axiom of Choice AC restricted to sets of reals.