Zermelo once wrote that he had anticipated Russell's contradiction of the set of all sets that are not members of themselves. Is this sufficient for having anticipated Russell's Paradox — the paradox that revealed the untenability of the logical notion of a set as an extension? This paper argues that it is not sufficient and offers criteria that are necessary and sufficient for having discovered Russell's Paradox. It is shown that there is ample evidence that Russell satisfied the criteria (...) and that Zermelo did not. (shrink)

Ernst Friedrich Ferdinand Zermelo transformed the set theory of Cantor and Dedekind in the first decade of the 20th century by incorporating the Axiom of Choice and providing a simple and workable axiomatization setting out generative set-existence principles. Zermelo thereby tempered the ontological thrust of early set theory, initiated the delineation of what is to be regarded as set-theoretic, drawing out the combinatorial aspects from the logical, and established the basic conceptual framework for the development of modern set (...) theory. Two decades later Zermelo promoted a distinctive cumulative hierarchy view of models of set theory and championed the use of infinitary logic, anticipating broad modern developments. In this paper Zermelo's published mathematical work in set theory is described and analyzed in its historical context, with the hindsight afforded by the awareness of what has endured in the subsequent development of set theory. Elaborating formulations and results are provided, and special emphasis is placed on the to and fro surrounding the Schröder-Bernstein Theorem and the correspondence and comparative approaches of Zermelo and Gödel. Much can be and has been written about philosophical and biographical issues and about the reception of the Axiom of Choice, and we will refer and defer to others, staying the course through the decidedly mathematical themes and details. (shrink)

On Zermelo's view, any mathematical theory presupposes a non-empty domain, the elements of which enjoy equal status; furthermore, mathematical axioms must be chosen from among those propositions that reflect the equal status of domain elements. As for which propositions manage to do this, Zermelo's answer is, those that are ?symmetric?, meaning ?invariant under domain permutations?. We argue that symmetry constitutes Zermelo's conceptual analysis of ?general proposition?. Further, although others are commonly associated with the extension of Klein's Erlanger (...) Programme to logic, Zermelo's name has a place in that story. (shrink)

On October 4, 1937, Zermelo composed a small note entitled “Der Relativismus in der Mengenlehre und der sogenannte Skolemsche Satz” in which he gives a refutation of “Skolem's paradox”, i.e., the fact that Zermelo-Fraenkel set theory—guaranteeing the existence of uncountably many sets—has a countable model. Compared with what he wished to disprove, the argument fails. However, at a second glance, it strongly documents his view of mathematics as based on a world of objects that could only be grasped (...) adequately by infinitary means. So the refutation might serve as a final clue to his epistemological credo.Whereas the Skolem paradox was to raise a lot of concern in the twenties and the early thirties, it seemed to have been settled by the time Zermelo wrote his paper, namely in favour of Skolem's approach, thus also accepting the noncategoricity and incompleteness of the first-order axiom systems. So the paper might be considered a late-comer in a community of logicians and set theorists who mainly followed finitary conceptions, in particular emphasizing the role of first-order logic. However, Zermelo never shared this viewpoint: In his first letter to Gödel of September 21, 1931, he had written that the Skolem paradox rested on the erroneous assumption that every mathematically definable notion should be expressible by a finite combination of signs, whereas a reasonable metamathematics would only be possible after this “finitistic prejudice” would have been overcome, “a task I have made my particular duty”. (shrink)

In recent years the question of whether adding the limited principle of omniscience, LPO, to constructive Zermelo–Fraenkel set theory, CZF, increases its strength has arisen several times. As the addition of excluded middle for atomic formulae to CZF results in a rather strong theory, i.e. much stronger than classical Zermelo set theory, it is not obvious that its augmentation by LPO would be proof-theoretically benign. The purpose of this paper is to show that CZF+RDC+LPO has indeed the same (...) strength as CZF, where RDC stands for relativized dependent choice. In particular, these theories prove the same Π02 theorems of arithmetic. (shrink)

This paper presents the history of the first German lectureship for mathematical logic based on a ministerial commission, to which the Göttingen mathematician Ernst Zermelo was appointed in 1907. The lectureship is shown as imbedded in the intellectual history of mathematical logic which was at that time determined by the discussion of the set theoretical and logical paradoxes. Although Zermelo's early set theoretic papers can be regarded, and were in fact regarded in the Göttingen mathematicians' application for the (...) lectureship, as contributions to mathematical logic, the close connection between set theory and logic was at that time not evident. It is shown, however, that such “internal” motives were not the only reasons for proposing the lectureship, since the application was also highly influenced by personal and institutional factors and the attempt to find a paid position for Zermelo at the University of Göttingen. In addition, Zermelo's lectureship is presented in the context of the history of academic teaching in mathematical and symbolic logic with an overview of German lecture courses in this topic in the period between 1830 and 1915. The results are correlated with the reception of George Boole's algebra of logic and other symbolic logical systems in Germany at that time. Zermelo's lectureship is regarded as the first step towards an institutionalization of mathematical logic as a subdiscipline of mathematics. This step is interpreted by critically applying the results of Hubert Laitko's and Martin Guntau's considerations on the genesis of scientific disciplines. (shrink)

On October 4, 1937, Zermelo composed a small note entitled “Der Relativismus in der Mengenlehre und der sogenannte Skolemsche Satz”(“Relativism in Set Theory and the So-Called Theorem of Skolem”) in which he gives a refutation of “Skolem's paradox”, i.e., the fact that Zermelo-Fraenkel set theory—guaranteeing the existence of uncountably many sets—has a countable model. Compared with what he wished to disprove, the argument fails. However, at a second glance, it strongly documents his view of mathematics as based on (...) a world of objects that could only be grasped adequately by infinitary means. So the refutation might serve as a final clue to his epistemological credo.Whereas the Skolem paradox was to raise a lot of concern in the twenties and the early thirties, it seemed to have been settled by the time Zermelo wrote his paper, namely in favour of Skolem's approach, thus also accepting the noncategoricity and incompleteness of the first-order axiom systems. So the paper might be considered a late-comer in a community of logicians and set theorists who mainly followed finitary conceptions, in particular emphasizing the role of first-order logic (cf. [8]). However, Zermelo never shared this viewpoint: In his first letter to Gödel of September 21, 1931, (cf. [1]) he had written that the Skolem paradox rested on the erroneous assumption that every mathematically definable notion should be expressible by a finite combination of signs, whereas a reasonable metamathematics would only be possible after this “finitistic prejudice” would have been overcome, “a task I have made my particular duty”. (shrink)

Working in Z + KP, we give a new proof that the class of hereditarily finite sets cannot be proved to be a set in Zermelo set theory, extend the method to establish other failures of replacement, and exhibit a formula Φ(λ, a) such that for any sequence $\langle A_{\lambda} \mid \lambda \text{a limit ordinal} \rangle$ where for each $\lambda, A_{\lambda} \subseteq ^{\lambda}2$ , there is a supertransitive inner model of Zermelo containing all ordinals in which for every (...) λ A λ = {α ∣Φ(λ, a)}. (shrink)

Using hitherto unpublished manuscripts from the Zermelo Nachlass, I describe the development of the notion of definiteness and the discussion about it, giving a conclusive picture of Zermelo's thoughts up to the late thirties. As it turns out, Zermelo's considerations about definiteness are intimately related to his concept of a Cantorian universe of categorically definable sets that may be considered an inner model of set theory in an ideationally given universe of classes.

Ernst Friedrich Ferdinand Zermelo (1871–1953) transformed the set theory of Cantor and Dedekind in the first decade of the 20th century by incorporating the Axiom of Choice and providing a simple and workable axiomatization setting out generative set-existence principles. Zermelo thereby tempered the ontological thrust of early set theory, initiated the delineation of what is to be regarded as set-theoretic, drawing out the combinatorial aspects from the logical, and established the basic conceptual framework for the development of modern (...) set theory. Two decades later Zermelo promoted a distinctive cumulative hierarchy view of models of set theory and championed the use of infinitary logic, anticipating broad modern developments. In this paper Zermelo's published mathematical work in set theory is described and analyzed in its historical context, with the hindsight afforded by the awareness of what has endured in the subsequent development of set theory. Elaborating formulations and results are provided, and special emphasis is placed on the to and fro surrounding the Schröder-Bernstein Theorem and the correspondence and comparative approaches of Zermelo and Gödel. Much can be and has been written about philosophical and biographical issues and about the reception of the Axiom of Choice, and we will refer and defer to others, staying the course through the decidedly mathematical themes and details. (shrink)

In papers published between 1930 and 1935. Zermelo outlines a foundational program, with infinitary logic at its heart, that is intended to (1) secure axiomatic set theory as a foundation for arithmetic and analysis and (2) show that all mathematical propositions are decidable. Zermelo's theory of systems of infinitely long propositions may be termed "Cantorian" in that a logical distinction between open and closed domains plays a signal role. Well-foundedness and strong inaccessibility are used to systematically integrate highly (...) transfinite concepts of demonstrability and existence. Zermelo incompleteness is then the analogue of the Problem of Proper Classes, and the resolution of these two anomalies is similarly analogous. (shrink)

In [12], Ernst Zermelo described a succession of models for the axioms of set theory as initial segments of a cumulative hierarchy of levelsUαVα. The recursive definition of theVα's is:Thus, a little reflection on the axioms of Zermelo-Fraenkel set theory shows thatVω, the first transfinite level of the hierarchy, is a model of all the axioms ofZFwith the exception of the axiom of infinity. And, in general, one finds that ifκis a strongly inaccessible ordinal, thenVκis a model of (...) all of the axioms ofZF. Doubtless, when cast as a first-order theory,ZFdoes not characterize the structures 〈Vκ,∈∩〉 forκa strongly inaccessible ordinal, by the Löwenheim-Skolem theorem. Still, one of the main achievements of [12] consisted in establishing that a characterization of these models can be attained when one ventures into second-order logic. For let second-orderZFbe, as usual, the theory that results fromZFwhen the axiom schema of replacement is replaced by its second-order universal closure. Then, it is a remarkable result due to Zermelo that second-orderZFcan only be satisfied in models of the form 〈Vκ,∈∩〉 forκa strongly inaccessible ordinal. (shrink)

Towards the end of his 1930 paper on boundary numbers and domains of sets Zermelo briefly discusses the questions of consistency and of the existence of an unbounded sequence of strongly inaccessible cardinals, deferring a detailed discussion to a later paper which never appeared. In a report to the Emergency Community of German Science from December 1930 about investigations in progress he mentions that some of the intended extensions of these topics had been worked out and were nearly ready (...) for publication. Using manuscripts from his Nachlass, we exhibit essential features of these extensions. (shrink)

A variant of realizability for Heyting arithmetic which validates Church’s thesis with uniqueness condition, but not the general form of Church’s thesis, was introduced by Lifschitz (Proc Am Math Soc 73:101–106, 1979). A Lifschitz counterpart to Kleene’s realizability for functions (in Baire space) was developed by van Oosten (J Symb Log 55:805–821, 1990). In that paper he also extended Lifschitz’ realizability to second order arithmetic. The objective here is to extend it to full intuitionistic Zermelo–Fraenkel set theory, IZF. The (...) machinery would also work for extensions of IZF with large set axioms. In addition to separating Church’s thesis with uniqueness condition from its general form in intuitionistic set theory, we also obtain several interesting corollaries. The interpretation repudiates a weak form of countable choice, ACω,ω, asserting that a countable family of inhabited sets of natural numbers has a choice function. ACω,ω is validated by ordinary Kleene realizability and is of course provable in ZF. On the other hand, a pivotal consequence of ACω,ω, namely that the sets of Cauchy reals and Dedekind reals are isomorphic, remains valid in this interpretation. Another interesting aspect of this realizability is that it validates the lesser limited principle of omniscience. (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)

Working in Z + KP, we give a new proof that the class of hereditarily finite sets cannot be proved to be a set in Zermelo set theory, extend the method to establish other failures of replacement, and exhibit a formula $\Phi$ such that for any sequence $\langle A_{\lambda} \mid \lambda \text{a limit ordinal} \rangle$ where for each $\lambda, A_{\lambda} \subseteq ^{\lambda}2$, there is a supertransitive inner model of Zermelo containing all ordinals in which for every $\lambda A_{\lambda} (...) = \{\alpha \mid\Phi\}$. (shrink)

An interesting positive theory is the GPK theory. The models of this theory include all hyperuniverses (see [5] for a definition of these ones). Here we add a form of the axiom of infinity and a new scheme to obtain GPK∞+. We show that in these conditions, we can interprete the Kelley‐Morse theory (KM) in GPK∞+ (Theorem 3.7). This needs a preliminary property which give an interpretation of the Zermelo‐Fraenkel set theory (ZF) in GPK∞+. We also see what happens (...) in the original GPK theory. Before doing this, we first need to study the basic properties of the theory. This is done in the first two sections. (shrink)

What gave rise to Ernst Zermelo's axiomatization of set theory in 1908? According to the usual interpretation, Zermelo was motivated by the set-theoretic paradoxes. This paper argues that Zermelo was primarily motivated, not by the paradoxes, but by the controversy surrounding his 1904 proof that every set can be wellordered, and especially by a desire to preserve his Axiom of Choice from its numerous critics. Here Zermelo's concern for the foundations of mathematics diverged from Bertrand Russell's (...) on the one hand and from Felix Hausdorff's on the other. (shrink)

A strict operational (i.e., informational) analysis of the meaning of preparing a system to realize the paradoxes of Loschmidt or Zermelo is made. Where reversal or recurrence are operationally realizable, no contradiction with the irreversible nature of macroscopic operations occurs. Paradox results either from neglecting irreversible phenomena in the means for preparing a reversed state, or from confusing elements or ensembles, which are meaningful in microstate language but meaningless operationally, with preparable macrostates, whoserepresentation in microstate language is an ensemble (...) whose very definition is incompatible with that of any paradox-generating element or ensemble. (shrink)

1. Philosophical background: iteration, ineffability, reflection. There are at least two heuristic motivations for the axioms of standard set theory, by which we mean, as usual, first-order Zermelo–Fraenkel set theory with the axiom of choice (ZFC): the iterative conception and limitation of size (see Boolos, 1989). Each strand provides a rather hospitable environment for the hypothesis that the set-theoretic universe is ineffable, which is our target in this paper, although the motivation is different in each case.

Les recherches de Zermelo sur la théorie des ensembles et les fon­dements des mathématiques se divisent en deux périodes : de 1901 à 1910 et de 1927 à 1935. Elles s’effectuent en même temps que les deux projets de recherche sur les fondements des mathématiques de David Hilbert et de ses collaborateurs à Göttingen ; durant la première période, Hilbert élaborait son premier programme d’axiomatisation, auquel Zermelo souscrivait totalement. La seconde période correspond au développement du programme formaliste de (...) Hilbert que Zermelo rejette en raison de son caractère finitiste. son travail est à cette époque dirigé contre Hilbert. (shrink)

Les recherches de Zermelo sur la théorie des ensembles et les fon­dements des mathématiques se divisent en deux périodes : de 1901 à 1910 et de 1927 à 1935. Elles s’effectuent en même temps que les deux projets de recherche sur les fondements des mathématiques de David Hilbert et de ses collaborateurs à Göttingen ; durant la première période, Hilbert élaborait son premier programme d’axiomatisation, auquel Zermelo souscrivait totalement. La seconde période correspond au développement du programme formaliste de (...) Hilbert que Zermelo rejette en raison de son caractère finitiste. son travail est à cette époque dirigé contre Hilbert. (shrink)

We give a proof, valid in any elementary topos, of the theorem of Zermelo that any set possessing a choice function for its set of inhabited subsets can be well-ordered. Our proof is considerably simpler than existing proofs in the literature and moreover can be seen as a direct generalization of Zermelo's own 1908 proof of his theorem.

We give a proof, valid in any elementary topos, of the theorem of Zermelo that any set possessing a choice function for its set of inhabited subsets can be well-ordered. Our proof is considerably simpler than existing proofs in the literature and moreover can be seen as a direct generalization of Zermelo's own 1908 proof of his theorem.

We present a novel treatment of set theory in a four-valued paraconsistent and paracomplete logic, i.e., a logic in which propositions can be both true and false, and neither true nor false. Our approach is a significant departure from previous research in paraconsistent set theory, which has almost exclusively been motivated by a desire to avoid Russell’s paradox and fulfil naive comprehension. Instead, we prioritise setting up a system with a clear ontology of non-classical sets, which can be used to (...) reason informally about incomplete and inconsistent phenomena, and is sufficiently similar to ${\mathrm {ZFC}}$ to enable the development of interesting mathematics. We propose an axiomatic system ${\mathrm {BZFC}}$, obtained by analysing the ${\mathrm {ZFC}}$ -axioms and translating them to a four-valued setting in a careful manner, avoiding many of the obstacles encountered by other attempted formalizations. We introduce the anti-classicality axiom postulating the existence of non-classical sets, and prove a surprising results stating that the existence of a single non-classical set is sufficient to produce any other type of non-classical set. Our theory is naturally bi-interpretable with ${\mathrm {ZFC}}$, and provides a philosophically satisfying view in which non-classical sets can be seen as a natural extension of classical ones, in a similar way to the non-well-founded sets of Peter Aczel [1]. Finally, we provide an interesting application concerning Tarski semantics, showing that the classical definition of the satisfaction relation yields a logic precisely reflecting the non-classicality in the meta-theory. (shrink)

This paper proves that the disjunction property, the numerical existence property, Church’s rule, and several other metamathematical properties hold true for Constructive Zermelo-Fraenkel Set Theory, CZF, and also for the theory CZF augmented by the Regular Extension Axiom.As regards the proof technique, it features a self-validating semantics for CZF that combines realizability for extensional set theory and truth.