David Hilbert famously remarked, “No one will drive us from the paradise that Cantor has created.” This volume offers a guided tour of modern mathematics’ Garden of Eden, beginning with perspectives on the finite universe and classes and Aristotelian logic. Author Mary Tiles further examines permutations, combinations, and infinite cardinalities; numbering the continuum; Cantor’s transfinite paradise; axiomatic set theory; logical objects and logical types; independence results and the universe of sets; and the constructs and reality of mathematical structure. Philosophers (...) and mathematicians will find an abundance of intriguing topics in this text, which is appropriate for undergraduate- and graduate-level courses. 1989 ed. 32 figures. (shrink)
A succinct introduction to mathematical logic and set theory, which together form the foundations for the rigorous development of mathematics. Suitable for all introductory mathematics undergraduates, Notes on Logic and Set Theory covers the basic concepts of logic: first-order logic, consistency, and the completeness theorem, before introducing the reader to the fundamentals of axiomatic set theory. Successive chapters examine the recursive functions, the axiom of choice, ordinal and cardinal arithmetic, and the incompleteness theorems. Dr. Johnstone has included (...) numerous exercises designed to illustrate the key elements of the theory and to provide applications of basic logical concepts to other areas of mathematics. (shrink)
In this paper, I pursue such a logical foundation for arithmetic in a variant of Zermelo set theory that has axioms of subset separation only for quantifier-free formulae, and according to which all sets are Dedekind finite. In section 2, I describe this variant theory, which I call ZFin0. And in section 3, I sketch foundations for arithmetic in ZFin0 and prove that certain foundational propositions that are theorems of the standard Zermelian foundation for arithmetic are independent of (...) ZFin0.<br><br>An equivalent theory of sets and an equivalent foundation for arithmetic was introduced by John Mayberry and developed by the current author in his doctoral thesis. In that thesis, the independence results mentioned above are proved using proof-theoretic methods. In this paper, I offer model-theoretic proofs of the central independence results using the technique of cumulation models, which was introduced by Steve Popham, a doctoral student of Mayberry<br>from the early 1980s. (shrink)
In 'On interpretations of arithmetic and set theory', Kaye and Wong proved the following result, which they considered to belong to the folklore of mathematical logic.
THEOREM 1 The first-order theories of Peano arithmetic and Zermelo-Fraenkel set theory with the axiom of infinity negated are bi-interpretable.
In this note, I describe a theory of sets that is bi-interpretable with the theory of bounded arithmetic IDelta0 + exp. Because of the weakness of this theory of sets, I cannot (...) straightforwardly adapt Kaye and Wong's interpretation of the arithmetic in the set theory. Instead, I am forced to produce a different interpretation. (shrink)
In the paper we will employ set theory to study the formal aspects of quantum mechanics without explicitly making use of space-time. It is demonstrated that von Neuman and Zermelo numeral sets, previously efectively used in the explanation of Hardy’s paradox, follow a Heisenberg quantum form. Here monadic union plays the role of time derivative. The logical counterpart of monadic union plays the part of the Hamiltonian in the commutator. The use of numerals and monadic union in the classical (...) probability resolution of Hardy’s paradox [1] is supported with the present derivation of a commutator for sets. (shrink)
Michael Potter presents a comprehensive new philosophical introduction to set theory. Anyone wishing to work on the logical foundations of mathematics must understand set theory, which lies at its heart. Potter offers a thorough account of cardinal and ordinal arithmetic, and the various axiom candidates. He discusses in detail the project of set-theoretic reduction, which aims to interpret the rest of mathematics in terms of set theory. The key question here is how to deal with the paradoxes (...) that bedevil set theory. Potter offers a strikingly simple version of the most widely accepted response to the paradoxes, which classifies sets by means of a hierarchy of levels. What makes the book unique is that it interweaves a careful presentation of the technical material with a penetrating philosophical critique. Potter does not merely expound the theory dogmatically but at every stage discusses in detail the reasons that can be offered for believing it to be true. Set Theory and its Philosophy is a key text for philosophy, mathematical logic, and computer science. (shrink)
The aim of the present paper is to provide a robust classification of valid sentences in set theory by means of existence and related notions and, in this way, to capture similarities and dissimilarities among the axioms of set theory. In order to achieve this, precise definitions for the notions of productive and nonproductive assertions, constructive and nonconstructive productive assertions, and conditional and unconditional productive assertions, among others, will be presented. These definitions constitute the result of a semantical (...) analysis of the notions involved. The conceptual clarification developed here results in a classification of valid sentences of set theory that goes against the standard view that extensionality is not an existence assertion. (shrink)
This two-volume work bridges the gap between introductory expositions of logic or set theory on one hand, and the research literature on the other. It can be used as a text in an advanced undergraduate or beginning graduate course in mathematics, computer science, or philosophy. The volumes are written in a user-friendly conversational lecture style that makes them equally effective for self-study or class use. Volume II, on formal (ZFC) set theory, incorporates a self-contained 'chapter 0' on proof (...) techniques so that it is based on formal logic, in the style of Bourbaki. The emphasis on basic techniques will provide the reader with a solid foundation in set theory and provides a context for the presentation of advanced topics such as absoluteness, relative consistency results, two expositions of Godel's constructible universe, numerous ways of viewing recursion, and a chapter on Cohen forcing. (shrink)
The main aim is to extend the range of logics which solve the set-theoretic paradoxes, over and above what was achieved by earlier work in the area. In doing this, the paper also provides a link between metacomplete logics and those that solve the paradoxes, by finally establishing that all M1-metacomplete logics can be used as a basis for naive set theory. In doing so, we manage to reach logics that are very close in their axiomatization to that of (...) the logic R of relevant implication. A further aim is the use of metavaluations in a new context, expanding the range of application of this novel technique, already used in the context of negation and arithmetic, thus providing an alternative to traditional model theoretic approaches. (shrink)
In light of the close connection between the ontological hierarchy of set theory and the ideological hierarchy of type theory, Øystein Linnebo and Agustín Rayo have recently offered an argument in favour of the view that the set-theoretic universe is open-ended. In this paper, we argue that, since the connection between the two hierarchies is indeed tight, any philosophical conclusions cut both ways. One should either hold that both the ontological hierarchy and the ideological hierarchy are open-ended, or (...) that neither is. If there is reason to accept the view that the set-theoretic universe is open-ended, that will be because such a view is the most compelling one to adopt on the purely ontological front. (shrink)
Mathematics depends on proofs, and proofs must begin somewhere, from some fundamental assumptions. For nearly a century, the axioms of set theory have played this role, so the question of how these axioms are properly judged takes on a central importance. Approaching the question from a broadly naturalistic or second-philosophical point of view, Defending the Axioms isolates the appropriate methods for such evaluations and investigates the ontological and epistemological backdrop that makes them appropriate. In the end, a new account (...) of the objectivity of mathematics emerges, one refreshingly free of metaphysical commitments. (shrink)
LN , so f lies in the elementary submodel M'. Clearly co 9 M' . It follows that 6 = {f(n): n em} is included in M'. Hence the ordinals of M' form an initial ...
John Burgess in a 2004 paper combined plural logic and a new version of the idea of limitation of size to give an elegant motivation of the axioms of ZFC set theory. His proposal is meant to improve on earlier work by Paul Bernays in two ways. I argue that both attempted improvements fail. I am grateful to Philip Welch, two anonymous referees, and especially Ignacio Jané for written comments on earlier versions of this paper, which have led to (...) substantial improvements. Thanks also to the participants in a discussion group at the University of Bristol, where an earlier version was presented. (shrink)
The purpose of this article is show that second-order logic, as understood through standard semantics, is intimately bound up with set theory, or some other general theory of interpretations, structures, or whatever. Contra Quine, this does not disqualify second-order logic from its role in foundational studies. To wax Quinean, why should there be a sharp border separating mathematics from logic, especially the logic of mathematics?
The ten contributions in this volume range widely over topics in the philosophy of mathematics. The four papers in Part I (entitled "Set Theory, Inconsistency, and Measuring Theories") take up topics ranging from proposed resolutions to the paradoxes of naïve set theory, paraconsistent logics as applied to the early infinitesimal calculus, the notion of "purity of method" in the proof of mathematical results, and a reconstruction of Peano's axiom that no two distinct numbers have the same successor. Papers (...) in the second part ("The Challenge of Nominalism") concern the nominalistic thesis that there are no abstract objects. The two contributions in Part III ("Historical Background") consider the contributions of Mill, Frege, and Descartes to the philosophy of mathematics. (shrink)
C. S. Jenkins has recently proposed an account of arithmetical knowledge designed to be realist, empiricist, and apriorist: realist in that what’s the case in arithmetic doesn’t rely on us being any particular way; empiricist in that arithmetic knowledge crucially depends on the senses; and apriorist in that it accommodates the time-honored judgment that there is something special about arithmetical knowledge, something we have historically labeled with ‘a priori’. I’m here concerned with the prospects for extending Jenkins’s account beyond arithmetic—in (...) particular, to set theory. After setting out the central elements of Jenkins’s account and entertaining challenges to extending it to set theory, I conclude that a satisfactory such extension is unlikely. (shrink)
What counts as an intuitively plausible set theoretic content (notion, axiom or theorem) has been a matter of much debate in contemporary philosophy of mathematics. In this paper I develop a critical appraisal of the issue. I analyze first R. B. Jensen's positions on the epistemic status of the axiom of constructibility. I then formulate and discuss a view of intuitiveness in set theory that assumes it to hinge basically on mathematical success. At the same time, I present accounts (...) of set theoretic axioms and theorems formulated in non-strictly mathematical terms, e.g., by appealing to the iterative concept of set and/or to overall methodological principles, like unify and maximize, and investigate the relation of the latter to success in mathematics. (shrink)
A new axiomatization of set theory, to be called Bernays-Boolos set theory, is introduced. Its background logic is the plural logic of Boolos, and its only positive set-theoretic existence axiom is a reflection principle of Bernays. It is a very simple system of axioms sufficient to obtain the usual axioms of ZFC, plus some large cardinals, and to reduce every question of plural logic to a question of set theory.
Standard (classical) logic is not independent of set theory. Which formulas are valid in logic depends on which sets we assume to exist in our set-theoretical universe. Second-order logic is just set theory in disguise. The typically logical notions of validity and consequence are not well defined in second-order logic, at least as long as there are open issues in set theory. Such contentious issues in set theory as the axiom of choice, the continuum hypothesis or (...) the existence of inaccessible cardinals, can be equivalently transformed into question about the logical validity of pure sentences of second-order logic, where “pure” means that they only contain logical symbols and bound variables. Even standard first-order logic depends on the acceptance on infinite sets in our set-theoretical universe. Should we choose to admit only finite sets, the number of logically valid pure first-order formulas would increase dramatically and first-order logic would not be recursively enumerable any longer. (shrink)
HISTORICAL INTRODUCTION In Abstract Set Theory) the elements of the theory of sets were presented in a chiefly generic way: the fundamental concepts were ...
This brief article is intended to introduce the reader to the field of algebraic set theory, in which models of set theory of a new and fascinating kind are determined algebraically. The method is quite robust, applying to various classical, intuitionistic, and constructive set theories. Under this scheme some familiar set theoretic properties are related to algebraic ones, while others result from logical constraints. Conventional elementary set theories are complete with respect to algebraic models, which arise in a (...) variety of ways, including topologically, type-theoretically, and through variation. Many previous results from topos theory involving realizability, permutation, and sheaf models of set theory are subsumed, and the prospects for further such unification seem bright. (shrink)
The major point of contention among the philosophers and mathematicians who have written about the independence results for the continuum hypothesis (CH) and related questions in set theory has been the question of whether these results give reason to doubt that the independent statements have definite truth values. This paper concerns the views of G. Kreisel, who gives arguments based on second order logic that the CH does have a truth value. The view defended here is that although Kreisel's (...) conclusion is correct, his arguments are unsatisfactory. Later sections of the paper advance a different argument that the independence results do not show lack of truth values. (shrink)
The celebrated “creation” of transfinite set theory by Georg Cantor has been studied in detail by historians of mathematics. However, it has generally been overlooked that his research program cannot be adequately explained as an outgrowth of the mainstream mathematics of his day. We review the main extra-mathematical motivations behind Cantor's very novel research, giving particular attention to a key contribution, the Grundlagen (Foundations of a general theory of sets) of 1883, where those motives are articulated in some (...) detail. Evidence from other publications and correspondence is pulled out to provide clarification and a detailed interpretation of those ideas and their impact upon Cantor's research. Throughout the paper, a special effort is made to place Cantor's scientific undertakings within the context of developments in German science and philosophy at the time (philosophers such as Trendelenburg and Lotze, scientists like Weber, Riemann, Vogt, Haeckel), and to reflect on the German intellectual atmosphere during the nineteenth century. (shrink)
The naive set theory problem is to begin with a full comprehension axiom, and to find a logic strong enough to prove theorems, but weak enough not to prove everything. This paper considers the sub-problem of expressing extensional identity and the subset relation in paraconsistent, relevant solutions, in light of a recent proposal from Beall, Brady, Hazen, Priest and Restall [4]. The main result is that the proposal, in the context of an independently motivated formalization of naive set (...) class='Hi'>theory, leads to triviality. (shrink)
What has been the historical relationship between set theory and logic? On the óne hand, Zermelo and other mathematicians developed set theory as a Hilbert-style axiomatic system. On the other hand, set theory influenced logic by suggesting to Schröder, Löwenheim and others the use of infinitely long expressions. The question of which logic was appropriate for set theory ? first-order logic, second-order logic, or an infinitary logic ? culminated in a vigorous exchange between Zermelo and Gödel (...) around 1930. (shrink)
Several philosophers have argued that the logic of set theory should be intuitionistic on the grounds that the open-endedness of the set concept demands the adoption of a nonclassical semantics. This paper examines to what extent adopting such a semantics has revisionary consequences for the logic of our set-theoretic reasoning. It is shown that in the context of the axioms of standard set theory, an intuitionistic semantics sanctions a classical logic. A Kripke semantics in the context of a (...) weaker axiomatization is then considered. It is argued that this semantics vindicates an intuitionistic logic only insofar as certain constraints are put on its interpretation. Wider morals are drawn about the restrictions that this places on the shape of arguments for an intuitionistic revision of the logic of set theory. (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 well-ordered, 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)
The view that plural reference is reference to a set is examined in light of George Boolos's treatment of second-order quantification as plural quantification in English. I argue that monadic second-order logic does not, in Boolos's treatment, reflect the behavior of plural quantifiers under negation and claim that any sentence that properly translates a second-order formula, in accordance with his treatment, has a first-order formulation. Support for this turns on the use of certain partitive constructions to assign values to variables (...) in a way that makes Boolos's reading of second-order variables available for a first-order language and, with it, the possibility of interpreting quantification in an unrestricted domain.A first-order theory, T(D), is developed on the basis of Boolos's treatment of simple plural definite descriptions extended to Richard Sharvy's general theory of definite plural and mass descriptions. I introduce a primitive predicate, o, for the relation of the referent of a singular description to that of its plural. If o is simply added to T(D), is definable in T(D), and the result is inconsistent. If o is added to a theory with axioms for the fragment of T(D) I call D-mereology, the result is a natural basis for the development of a pluralized Zermelo set theory. This theory, however, is inconsistent in an unrestricted domain, unless it is recast as a second-order theory of sets interpreted in Boolos's way. (shrink)
The purpose of this paper is to assess the prospects for a neo-logicist development of set theory based on a restriction of Frege's Basic Law V, which we call (RV): PQ[Ext(P) = Ext(Q) [(BAD(P) & BAD(Q)) x(Px Qx)]] BAD is taken as a primitive property of properties. We explore the features it must have for (RV) to sanction the various strong axioms of Zermelo–Fraenkel set theory. The primary interpretation is where ‘BAD’ is Dummett's ‘indefinitely extensible’. 1 Background: what (...) and why? 2 Framework 3 GOOD candidates, indefinite extensibility 4 The framework of (RV) alone, or almost alone 5 The axioms 6 Brief closing. (shrink)
Foundations of a General Theory of Manifolds [Cantor, 1883], which I will refer to as the Grundlagen, is Cantor’s first work on the general theory of sets. It was a separate printing, with a preface and some footnotes added, of the fifth in a series of six papers under the title of “On infinite linear point manifolds”. I want to briefly describe some of the achievements of this great work. But at the same time, I want to discuss (...) its connection with the so-called paradoxes in set theory. There seems to be some agreement now that Cantor’s own understanding of the theory of transfinite numbers in that monograph did not contain an implicit contradiction; but there is less agreement about exactly why this is so and about the content of the theory itself. For various reasons, both historical and internal, the Grundlagen seems not to have been widely read compared to later works of Cantor, and to have been even less well understood. But even some of the more recent discussions of the work, while recognizing to some degree its unique character, misunderstand it on crucial points and fail to convey its true worth. (shrink)
Naive set theory, as found in Frege and Russell, is almost universally believed to have been shown to be false by the set-theoretic paradoxes. The standard response has been to rank sets into one or other hierarchy. However it is extremely difficult to characterise the nature of any such hierarchy without falling into antinomies as severe as the set-theoretic paradoxes themselves. Various attempts to surmount this problem are examined and criticised. It is argued that the rejection of naive set (...)theory inevitably leads one into a severe scepticism with regard to the feasibility of giving a systematic semantics for set theory. It is further argued that this is not just a problem for philosophers of mathematics. Semantic scepticism in set theory will almost inevitably spill over into total pessimism regarding the prospects for an explanatory theory of language and meaning in general. The conclusion is that those who wish to avoid such intellectual defeatism need to look seriously at the possibility that it is the logic used in the derivation of the paradoxes, and not the naive set theory itself, which is at fault. (shrink)
In her recent book, Realism in mathematics, Penelope Maddy attempts to reconcile a naturalistic epistemology with realism about set theory. The key to this reconciliation is an analogy between mathematics and the physical sciences based on the claim that we perceive the objects of set theory. In this paper I try to show that neither this claim nor the analogy can be sustained. But even if the claim that we perceive some sets is granted, I argue that Maddy's (...) account fails to explain the key issue faced by an epistemology for mathematics, namely the step from knowledge of the finite to knowledge of the infinite. (shrink)
Reasonning in naive set theory (with unlimited comprehension), we derive a paradox (a formal contradiction) which can be seen as a variant of the Burali-Forti paradox.
What one can say about the past, present and future of set theory depends on what one expects or at least hopes set theory will accomplish. In order to gauge the early expectations, I begin with a quote from the inaugural lecture in 1903 of my mathematical grandfather, the internationally known Finnish mathematician Ernst Lindelöf. The subject of his lecture was – guess what – Cantor’s set theory. In his conclusion, Lindelöf says of Cantor’s results: For mathematics (...) they have lent new tools and opened up new fields of research, they have thrown entirely new light on the foundations of analysis and brought clarity and order where there was only disorder and contradictions. Thus they have greatly contributed to the harmony that is the essence of mathematics, a harmony a grasp of which is the reward of mathematical research. (Quoted in Olli Lehto, Tieteen aatelia, Otava, Helsinki, 2008, p. 263) We can all agree with the compliments Lindelöf pays to set theory as an impressive specimen of mathematical research, including the theory of infinite cardinals and ordinals. But as far as the foundational role of set theory is concerned, in the perspective of the subsequent century his words read as an example of supreme historical irony. Far from bringing harmony into the foundations of mathematics, problems arising from set theory led to a schism between different schools of thought. Few mathematicians think of set theory as a tool for reaching new results outside set theory.. On the contrary, an interesting rich tradition called reverse mathematics takes significant mathematical results and asks what set-theoretical assumptions are needed to prove them. Set-theoretical paradoxes have greatly increased mathematicians’ concerns about contradictions instead of assuaging them. Many foundationalists would blandly deny that we have even now, more than a hundred years later, reached “clarity and order” about the foundations of analysis. What Lindelöf took to be the results of set theory thus were in reality so many hopes that set theory was expected to fulfill.. (shrink)
Many criticisms of prototype theory and/or fuzzy-set theory are based on the assumption that category representativeness (or typicality) is identical with fuzzy membership. These criticisms also assume that conceptual combination and logical rules (all in the Aristotelian sense) are the appropriate criteria for the adequacy of the above “fuzzy typicality”. The present paper discusses these assumptions following the line of their most explicit and most influential expression by Osheron and Smith (1981). Several arguments are made against the above (...) identification, the most important being that representativeness in prototype theory is exclusively based on element-to-element similarity while fuzzy membership is inherently an element-to-category relationship. Also the above criteria for adequacy are criticized from the viewpoint of both prototype theory and fuzzy-set theory as well as from that of both conceptual and logical combination, and also from that of integration. (shrink)
The study of logic goes back more than two thousand years and in that time many symbols and diagrams have been devised. Around 300 BC Aristotle introduced letters as term-variables, a "new and epoch-making device in logical technique." (W. & M. Kneale The Development of Logic (1962, p. 61). The modern era of mathematical notation in logic began with George Boole (1815- 1864), although none of his notation survives. Set theory came into being in the late 19th and early (...) 20th centuries, largely a creation of Georg Cantor (1845-1918). See MacTutor's A history of set theory or, for more detail, Set theory from the Stanford Encyclopedia of Philosophy. (shrink)
For many years, Charles Peirce maintained that all senses of the modal terms "possible" and "necessary" can be defined in terms of "states of information." But in 1896, he was motivated by his work in set theory to criticize that account of modality, and in 1905 he characterized that criticism as a return "to the Aristotelian doctrine of a real possibility ... the great step that was needed to render pragmaticism an intelligible doctrine." But since Peirce was a realist (...) about modality before 1896, and since he continued defining "possibility" in terms of "states of information" after that date, it is not clear exactly what he changed his mind about. In this essay I explain what it was that Peirce changed his mind about and why, in retrospect, he viewed that change as a decisive step in the development of pragmaticism. (shrink)
We try to answer the question which is the “right” foundation of mathematics, second order logic or set theory. Since the former is usually thought of as a formal language and the latter as a first order theory, we have to rephrase the question. We formulate what we call the second order view and a competing set theory view, and then discuss the merits of both views. On the surface these two views seem to be in manifest (...) conflict with each other. However, our conclusion is that it is very difficult to see any real difference between the two. We analyze a phenomenon we call internal categoricity which extends the familiar categoricity results of second order logic to Henkin models and show that set theory enjoys the same kind of internal categoricity. Thus the existence of non-standard models, which is usually taken as a property of first order set theory, and categoricity, which is usually taken as a property of second order axiomatizations, can coherently coexist when put into their proper context. We also take a fresh look at complete second order axiomatizations and give a hierarchy result for second order characterizable structures. Finally we consider the problem of existence in mathematics from both points of view and find that second order logic depends on what we call large domain assumptions, which come quite close to the meaning of the axioms of set theory. (shrink)
“Small” large cardinal notions in the language of ZFC are those large cardinal notions that are consistent with V = L. Besides their original formulation in classical set theory, we have a variety of analogue notions in systems of admissible set theory, admissible recursion theory, constructive set theory, constructive type theory, explicit mathematics and recursive ordinal notations (as used in proof theory). On the face of it, it is surprising that such distinctively set-theoretical notions (...) have analogues in such disaparate and relatively constructive contexts. There must be an underlying reason why that is possible (and, incidentally, why “large” large cardinal notions have not led to comparable analogues). My long term aim is to develop a common language in which such notions can be expressed and can be interpreted both in their original classical form and in their analogue form in each of these special constructive and semi-constructive cases. This is a program in progress. What is done here, to begin with, is to show how that can be done to a considerable extent in the settings of classical and admissible set theory (and thence, admissible recursion theory). The approach taken here is to expand the language of set theory to allow us to talk about (possibly partial) operations applicable both to sets and to operations and to formulate the large cardinal notions in question in terms of operational closure conditions; at the same time only minimal existence axioms are posited for sets. The resulting system, called Operational Set Theory, is a partial adaptation to the set-theoretical framework of the explicit mathematics framework Feferman (1975). The.. (shrink)
Russell’s way out of his paradox via the impre-dicative theory of types has roughly the same logical power as Zermelo set theory - which supplanted it as a far more flexible and workable axiomatic foundation for mathematics. We discuss some new formalisms that are conceptually close to Russell, yet simpler, and have the same logical power as higher set theory - as represented by the far more powerful Zermelo-Frankel set theory and beyond. END.
In this paper some of the history of the development of arithmetic in set theory is traced, particularly with reference to the problem of avoiding the assumption of an infinite set. Although the standard method of singling out a sequence of sets to be the natural numbers goes back to Zermelo, its development was more tortuous than is generally believed. We consider the development in the light of three desiderata for a solution and argue that they can probably not (...) all be satisfied simultaneously. (shrink)
Quasi-set theory is a theory for dealing with collections of indistinguishable objects. In this paper we discuss some logical and philosophical questions involved with such a theory. The analysis of these questions enable us to provide the first grounds of a possible new view of physical reality, founded on an ontology of non-individuals, to which quasi-set theory may constitute the logical basis.
Some philosophers have argued that the open-endedness of the set concept has revisionary consequences for the semantics and logic of set theory. I consider (several variants of) an argument for this claim, premissed on the view that quantification in mathematics cannot outrun our conceptual abilities. The argument urges a non-standard semantics for set theory that allegedly sanctions a non-classical logic. I show that the views about quantification the argument relies on turn out to sanction a classical semantics and (...) logic after all. More generally, this article constitutes a case study in whether the need to account for conceptual progress can ever motivate a revision of semantics or logic. I end by expressing skepticism about the prospects of a so-called non-proof-based justification for this kind of revisionism about set theory. (shrink)
The notion of a function from N to N defined by recursion on ordinal notations is fundamental in proof theory. Here this notion is generalized to functions on the universe of sets, using notations for well-orderings longer than the class of ordinals. The generalization is used to bound the rate of growth of any function on the universe of sets that is Σ1-definable in Kripke-Platek admissible set theory with an axiom of infinity. Formalizing the argument provides an ordinal (...) analysis. (shrink)
We present a solution to the problem of defining a counterpart in Algebraic Set Theory of the construction of internal sheaves in Topos Theory. Our approach is general in that we consider sheaves as determined by Lawvere-Tierney coverages, rather than by Grothendieck coverages, and assume only a weakening of the axioms for small maps originally introduced by Joyal and Moerdijk, thus subsuming the existing topos-theoretic results.
We discuss several axiomatizations of set theory in first order predicate calculus with epsilon and a constant symbol W, starting with the simple system K(W) which has a strong equivalence with ZF without Foundation. The other systems correspond to various extensions of ZF by certain large cardinal hypotheses. These axiomatizations are unusually simple and uncluttered, and are highly suggestive of underlying philosophical principles that generate higher set theory.
Machine generated contents note: 1. Introduction Juliette Kennedy and Roman Kossak; 2. Historical remarks on Suslin's problem Akihiro Kanamori; 3. The continuum hypothesis, the generic-multiverse of sets, and the [OMEGA] conjecture W. Hugh Woodin; 4. [omega]-Models of finite set theory Ali Enayat, James H. Schmerl and Albert Visser; 5. Tennenbaum's theorem for models of arithmetic Richard Kaye; 6. Hierarchies of subsystems of weak arithmetic Shahram Mohsenipour; 7. Diophantine correct open induction Sidney Raffer; 8. Tennenbaum's theorem and recursive reducts James (...) H. Schmerl; 9. History of constructivism in the 20th century A. S. Troelstra; 10. A very short history of ultrafinitism Rose M. Cherubin and Mirco A. Mannucci; 11. Sue Toledo's notes of her conversations with Gödel in 1972-1975 Sue Toledo; 12. Stanley Tennenbaum's Socrates Curtis Franks; 13. Tennenbaum's proof of the irrationality of [the square root of] 2́. (shrink)
Maddy's (1990) arguments against Aggregate Theory were undermined by the shift in her position in 1997. The present paper considers Aggregate Theory in the light of this, and the recent search for `New Axioms for Mathematics'. If Set Theory is the part-whole theory of singletons, then identifying singletons with their single members collapses Set Theory into Aggregate Theory. But if singletons are not identical to their single members, then they are not extensional objects and (...) so are not a basis for Science. Either way, the Continuum Hypothesis has no physical interest. (shrink)
We suggest a new framework for the Weyl-Feferman predicativist program by constructing a formal predicative set theory P ZF which resembles ZF , and is suitable for mechanization. The basic idea is that the predicatively acceptable instances of the comprehension schema are those which determine the collections they define in an absolute way, independent of the extension of the “surrounding universe”. The language of P ZF is type-free, and it reflects real mathematical practice in making an extensive use of (...) statically defined abstract set terms. Another important feature of P ZF is that its underlying logic is ancestral logic (i.e. the extension of first-order logic with a transitive closure operation). (shrink)
I analyze the relations of constituency or ``being in'' that connect different ontological items in the Tractatus logico-philosophicus by Wittgenstein. A state of affairs is constituted by atoms, atoms are in a state of affairs. Atoms are also in an atomic fact. Moreover, the world is the totality of facts, thus it is in some sense made of facts. Many other kinds of Tractarian notions -- such as molecular facts, logical space, reality -- seem to be involved in constituency relations. (...) How should these relations be conceived? And how is it possible to formalize them in a convincing way? I draw a comparison between two ways of conceiving and formalizing these relations: through sets and through mereological sums. The comparison shows that the conceptual machinery of set theory is apter to conceive and formalize Tractarian constituency notions than the mereological one. (shrink)
This paper investigates an alternative set theory (due to Peter Aczel) called Hyperset Theory. Aczel uses a graphical representation for sets and thereby allows the representation of non-well-founded sets. A program, called HYPERSOLVER, which can solve systems of equations defined in terms of sets in the universe of this new theory is presented. This may be a useful tool for commonsense reasoning.
This paper draws its title from the recent symposium of which it was part; it attempts to respond to the question raised by that title, taking current work in set theory into account. To this end the paper contrasts set theory with number theory, examines a severe brand of set-theoretic realism that is suggested by a passage from Godel, and sketches a first-order way of looking at the results about competing extensions of Zermelo-Fraenkel set theory. A (...) formalistic sentiment may be detectable in some portions of the paper. (shrink)
In this paper, we generalize the set-theoretic translation method for poly-modal logic introduced in [11] to extended modal logics. Instead of devising an ad-hoc translation for each logic, we develop a general framework within which a number of extended modal logics can be dealt with. We first extend the basic set-theoretic translation method to weak monadic second-order logic through a suitable change in the underlying set theory that connects up in interesting ways with constructibility; then, we show how to (...) tailor such a translation to work with specific cases of extended modal logics. (shrink)
We prove that Standardization fails in every nontrivial universe definable in the nonstandard set theory BST, and that a natural characterization of the standard universe is both consistent with and independent of BST. As a consequence we obtain a formulation of nonstandard class theory in the ∈-language.
This paper was referred to in the Introduction in our paper [Fr97a], “The Axiomatization of Set Theory by Separation, Reducibility, and Comprehension.” In [Fr97a], all systems considered used the axiom of Extensionality. This is appropriate in a set theoretic context.
It is well known that number theory can be interpreted in the usual set theories, e.g. ZF, NF and their extensions. The problem I posed for myself was to see if, conversely, a reasonably strong set theory could be interpreted in number theory. The reason I am interested in this problem is, simply, that number theory is more basic or more concrete than set theory, and hence a more concrete foundation for mathematics. A partial solution (...) to the problem was accomplished by WTN in [2], where it was shown that a predicative set theory could be interpreted in a natural extension of pure number theory, PN, (i.e. classical first-order Peano Arithmetic). In this paper, we go a step further by showing that a reasonably strong fragment of predicative set theory can be interpreted in PN itself. We then make an attempt to show how to develop predicative fragments of mathematics in PN.If one wishes to know what is meant by reasonably strong and fragment please read on. (shrink)
The success of set theory as a foundation for mathematics inspires its use in arti cial intelligence, particularly in commonsense reasoning. In this survey, we brie y review classical set theory from an AI perspective, and then consider alternative set theories. Desirable properties of a possible commonsense set theory are investigated, treating di erent aspects like cumulative hierarchy, self-reference, cardinality, etc. Assorted examples from the ground-breaking research on the subject are also given.
We present an axiomatic framework for nonstandard analysis-the Nonstandard Class Theory (NCT) which extends von Neumann-Gödel-Bernays Set Theory (NBG) by adding a unary predicate symbol St to the language of NBG (St(X) means that the class X is standard) and axioms-related to it- analogs of Nelson's idealization, standardization and transfer principles. Those principles are formulated as axioms, rather than axiom schemes, so that NCT is finitely axiomatizable. NCT can be considered as a theory of definable classes of (...) Bounded Set Theory by V. Kanovei and M. Reeken. In many aspects NCT resembles the Alternative Set Theory by P. Vopenka. For example there exist semisets (proper subclasses of sets) in NCT and it can be proved that a set has a standard finite cardinality iff it does not contain any proper subsemiset. Semisets can be considered as external classes in NCT. Thus the saturation principle can be formalized in NCT. (shrink)
For classical sets one has with the cumulative hierarchy of sets, with axiomatizations like the system ZF, and with the category SET of all sets and mappings standard approaches toward global universes of all sets.We discuss here the corresponding situation for fuzzy set theory. Our emphasis will be on various approaches toward (more or less naively formed) universes of fuzzy sets as well as on axiomatizations, and on categories of fuzzy sets.
This is a survey paper on the descriptive set theory of hereditary families of closed sets in Polish spaces. Most of the paper is devoted to ideals and σ-ideals of closed or compact sets.
Alain Badiou is a highly original, indeed decidedly iconoclastic thinker whose work has ranged widely over areas of equal concern to philosophers in the ‘continental’ and mainstream analytic traditions. These areas include ontology, epistemology, ethics, politics, and – above all – philosophy of mathematics. It is unfortunate, and symptomatic of prevailing attitudes, that his work has so far receivedminimal attention from commentators in the analytic line of descent. Here I try to help the process of reception along by describing Badiou’s (...) remarkably ambitious approach to issues of mathematical (more specifically: of set-theoretical) ontology, and by explaining just where his project stands in relation to some major issues within current analytic debate. Chief among them are: the issue between realists and anti-realists – along with various avowed middle-ground or compromise solutions – and those oddly tenacious problems-from-Wittgenstein (e.g., concerning what it means to follow a rule) that have so preoccupied philosophers over the past decade. In particular I stress the unusual, indeed unique combination in his thought of high formal rigour and conceptual clarity allied to a speculative scope and inventiveness which tend to make those other discussions appear somewhat self-absorbed and parochial. Most importantly, Badiou engages these issues at a level of creative as well as of technical or analytic grasp, which puts his thinking closely in touch with the way that set theory has itself evolved through a constant process of – in Badiou’s phrase – ‘turning paradoxes into concepts.’ I also discuss his strong and principled rejection of the ‘linguistic turn’ in its manifold (analytic and continental) variants, and his idea of the ‘event’ as that which inherently eludes or surpasses the conceptual resources of any received ontology, whether in mathematics and the natural sciences or in the history of genuinely epochal changes in politics and ethics. All in all, I put the case for Badiou as a thinker of the first importance not only for the impressive range, depth and originality of his work, but also because it points to an escape-route from some of the more cramped or windowless quarters of present-day philosophic thought. (shrink)
The success of set theory as a foundation for mathematics inspires its use in artificial intelligence, particularly in commonsense reasoning. In this survey, we briefly review classical set theory from an AI perspective, and then consider alternative set theories. Desirable properties of a possible commonsense set theory are investigated, treating different aspects like cumulative hierarchy, self-reference, cardinality, etc. Assorted examples from the ground-breaking research on the subject are also given.
One of the basic theorems in universal algebra is Birkhoff's variety theorem: the smallest equationally axiomatizable class containing a class K of algebras coincides with the class obtained by taking homomorphic images of subalgebras of direct products of elements of K. G. Gratzer asked whether the variety theorem is equivalent to the Axiom of Choice. In 1980, two of the present authors proved that Birkhoff's theorem can already be derived in ZF. Surprisingly, the Axiom of Foundation plays a crucial role (...) here: we show that Birkhoff's theorem cannot be derived in ZF + AC {Foundation}. even if we add Foundation for Finite Sets. We also prove that the variety theorem is equivalent to a purely set-theoretical statement, the Collection Principle. This principle is independent of $ZF \{\operatorname{Foundation}$ . The second part of the paper deals with further connections between axioms of ZF-set theory and theorems of universal algebra. (shrink)
Throughout the last two decades, Newton da Costa and his collaborators have developed some frameworks to help the interpretation of science. Two of them are particularly noteworthy: partial structures and quasi-truth (that provide a way of accommodating the openness and partiality of scientific activity), and quasi-set theory (that allows one to take seriously the idea, put forward by several physicists, that we can't meaningfully apply the notion of identity to quantum particles). In this paper I explore the interconnection between (...) these two frameworks. After reviewing the extant formulations of quasi-truth and quasi-set theory, I suggest a way of combining them, advancing a formulation of quasi-truth in quasi-set theory. In this way, a good sense can be made of the idea that quantum mechanics, if not true, is at least quasi-true. I then explore an application of this combined framework, arguing that it provides a conceptual setting appropriate to overcome two (philosophical) difficulties in van Fraassen's modal interpretation of quantum mechanics. (shrink)
A model is said to be Leibnizian if it has no pair of indiscernibles. Mycielski has shown that there is a first order axiom LM (the Leibniz-Mycielski axiom) such that for any completion T of Zermelo-Fraenkel set theory ZF, T has a Leibnizian model if and only if T proves LM. Here we prove: THEOREM A. Every complete theory T extending ZF + LM has $2^{\aleph_{0}}$ nonisomorphic countable Leibnizian models. THEOREM B. If $\kappa$ is aprescribed definable infinite cardinal (...) of a complete theory T extending ZF + V = OD. then there are $2^{\aleph_{1}}$ nonisomorphic Leibnizian models $\mathfrak{M}$ of T of power $\aleph_{1}$ such that $(\kappa^{+})^\mathfrak{M}$ is $\aleph_{1}-like$ . THEOREM C. Every complete theory T extending ZF + V = OD has $2^{\aleph_{1}}$ nonisomorphic \aleph_{1}-like$ Leibnizian models. (shrink)
For classical sets one has with the cumulative hierarchy of sets, with axiomatizations like the system ZF, and with the category SET of all sets and mappings standard approaches toward global universes of all sets. We discuss here the corresponding situation for fuzzy set theory.Our emphasis will be on various approaches toward (more or less naively formed)universes of fuzzy sets as well as on axiomatizations, and on categories of fuzzy sets.
Unrestricted use of the axiom schema of comprehension, ?to every mathematically (or set-theoretically) describable property there corresponds the set of all mathematical (or set-theoretical) objects having that property?, leads to contradiction. In set theories of the Zermelo?Fraenkel?Skolem (ZFS) style suitable instances of the comprehension schema are chosen ad hoc as axioms, e.g.axioms which guarantee the existence of unions, intersections, pairs, subsets, empty set, power sets and replacement sets. It is demonstrated that a uniform syntactic description may be given of acceptable (...) instances of the comprehension schema, which include all of the axioms mentioned, and which in their turn are theorems of the usual versions of ZFS set theory. Well then, shall we proceed as usual and begin by assuming the existence of a single essential nature or Form for every set of things which we call by the same name? Do you understand? (Plato, Republic X.596a6; cf. Cornford 1966, 317). (shrink)
This is an introduction to set theory and logic that starts completely from scratch. The text is accompanied by many methodological remarks and explanations.
We present a generalisation of the type-theoretic interpretation of constructive set theory into Martin-Löf type theory. The original interpretation treated logic in Martin-Löf type theory via the propositions-as-types interpretation. The generalisation involves replacing Martin-Löf type theory with a new type theory in which logic is treated as primitive. The primitive treatment of logic in type theories allows us to study reinterpretations of logic, such as the double-negation translation.
In this paper, we develop the system LZF of set theory with the unrestricted comprehension in full linear logic and show that LZF is a conservative extension of ZF– i.e., the Zermelo-Fraenkel set theory without the axiom of regularity. We formulate LZF as a sequent calculus with abstraction terms and prove the partial cut-elimination theorem for it. The cut-elimination result ensures the subterm property for those formulas which contain only terms corresponding to sets in ZF–. This implies that (...) LZF is a conservative extension of ZF– and therefore the former is consistent relative to the latter. (shrink)
Here, we analyse some recent applications of set theory to topology and argue that set theory is not only the closed domain where mathematics is usually founded, but also a flexible framework where imperfect intuitions can be precisely formalized and technically elaborated before they possibly migrate toward other branches. This apparently new role is mostly reminiscent of the one played by other external fields like theoretical physics, and we think that it could contribute to revitalize the interest in (...) set theory in the future. (shrink)
Nonstandard set theory is an attempt to generalise nonstandard analysis to cover the whole of classical mathematics. Existing versions (Nelson, Hrbáček, Kawai) are unsatisfactory in that the unlimited idealisation principle conflicts with the wish to have a full theory of external sets. I re-analyse the underlying requirements of nonstandard set theory and give a new formal system, stratified nonstandard set theory, which seems to meet them better than the other versions.
Standard presentations of axioms for set theory as truths simpliciter about actual-objects the sets-confront a number of puzzles associated with platonism and foundationalism. In his classic (1930), Zermelo suggested an alternative "many worlds" view. Independently, Putnam (1967) proposed something similar, explicitly incorporating modality. A modal-structural synthesis of these ideas is sketched in which obstacles to their formalization are overcome. Extendability principles are formulated and used to motivate many small largecardinals. The use of second-order logic as a (...) coherent and clear framework for set theory is supported. (shrink)
In [7], a naive set theory is introduced based on a polynomial time logical system, Light Linear Logic (LLL). Although it is reasonably claimed that the set theory inherits the intrinsically polytime character from the underlying logic LLL, the discussion there is largely informal, and a formal justification of the claim is not provided sufficiently. Moreover, the syntax is quite complicated in that it is based on a non-traditional hybrid sequent calculus which is required for formulating LLL.In this (...) paper, we consider a naive set theory based on Intuitionistic Light Affine Logic (ILAL), a simplification of LLL introduced by [1], and call it Light Affine Set Theory (LAST). The simplicity of LAST allows us to rigorously verify its polytime character. In particular, we prove that a function over {0, 1}* is computable in polynomial time if and only if it is provably total in LAST. (shrink)
A structural (as opposed to Zadeh's quantitative) approach to fuzziness is given, based on the operator "very", which is added to the language of set theory together with some elementary axioms about it. Due to the axiom of foundation and to a lifting axiom, the operator is proved trivial on the cumulative hierarchy of ZF. So we have to drop either foundation or lifting. Since fuzziness concerns complemented predicates rather than sets, a class theory is needed for the (...) very operator. And of them the Kelley-Morse (KM) theory is more appropriate for reasons of class existence. Several definable realizations of the very-operator are presented in KM⁻. In the last section we consider the operator "very" without the lifting axiom on classes of urelements. To each structurally fuzzy set X a traditional quantitative fuzzy set X̄ is assigned -- its quantitative representation. This way we are able partly to recover ordinary fuzzy sets from the structurally fuzzy ones. (shrink)
Adjoin, to a countable standard model M of Zermelo-Fraenkel set theory (ZF), a countable set A of independent Cohen generic reals. If one attempts to construct the model generated over M by these reals (not necessarily containing A as an element) as the intersection of all standard models that include M ∪ A, the resulting model fails to satisfy the power set axiom, although it does satisfy all the other ZF axioms. Thus, there is no smallest ZF model including (...) M ∪ A, but there are minimal such models. These are classified by their sets of reals, and there is one minimal model whose set of reals is the smallest possible. We give several characterizations of this model, we determine which weak axioms of choice it satisfies, and we show that some better known models are forcing extensions of it. (shrink)
The aim of this article is to give an introduction to functional interpretations of set theory given by the authorin Burr (2000a). The first part starts with some general remarks on Gödel's functional interpretation with a focus on aspects related to problems that arise in the context of set theory. The second part gives an insight in the techniques needed to perform a functional interpretation of systems of set theory. However, the first part of this article is (...) not intended to be a complete survey of functional interpretations and here we recommend, for example, Avigad and Feferman (1998),Troelstra (1990) and Troelstra (1973). (shrink)
Following the book Algebraic Set Theory from André Joyal and leke Moerdijk [8], we give a characterization of the initial ZF-algebra, for Heyting pretoposes equipped with a class of small maps. Then, an application is considered (the effective topos) to show how to recover an already known model (McCarty [9]).
Gödel's dialectica interpretation of Heyting arithmetic HA may be seen as expressing a lack of confidence in our understanding of unbounded quantification. Instead of formally proving an implication with an existential consequent or with a universal antecedent, the dialectica interpretation asks, under suitable conditions, for explicit 'interpreting' instances that make the implication valid. For proofs in constructive set theory CZF-, it may not always be possible to find just one such instance, but it must suffice to explicitly name a (...) set consisting of such interpreting instances. The aim of eliminating unbounded quantification in favor of appropriate constructive functionals will still be obtained, as our ∧-interpretation theorem for constructive set theory in all finite types CZFω- shows. By changing to a hybrid interpretation ∧q, we show closure of CZFω- under rules that – in stronger forms – have already been studied in the context of Heyting arithmetic. In a similar spirit, we briefly survey modified realizability of CZFω- and its hybrids. Central results of this paper have been proved by Burr 2000a and Schulte 2006, however, for different translations. We use a simplified interpretation that goes back to Diller and Nahm 1974. A novel element is a lemma on absorption of bounds which is essential for the smooth operation of our translation. (shrink)
We study the sets of the infinite sentences constructible with a dictionary over a finite alphabet, from the viewpoint of descriptive set theory. Among others, this gives some true co-analytic sets. The case where the dictionary is finite is studied and gives a natural example of a set at level ω of the Wadge hierarchy.
Partial functions can be easily represented in set theory as certain sets of ordered pairs. However, classical set theory provides no special machinery for reasoning about partial functions. For instance, there is no direct way of handling the application of a function to an argument outside its domain as in partial logic. There is also no utilization of lambda-notation and sorts or types as in type theory. This paper introduces a version of von-Neumann-Bernays-Gödel set theory for (...) reasoning about sets, proper classes, and partial functions represented as classes of ordered pairs. The underlying logic of the system is a partial first-order logic, so class-valued terms may be nondenoting. Functions can be specified using lambda-notation, and reasoning about the application of functions to arguments is facilitated using sorts similar to those employed in the logic of the IMPS Interactive Mathematical Proof System. The set theory is intended to serve as a foundation for mechanized mathematics systems. (shrink)
In fact, Godel gave an important model of pure predication, where he showed that restricted comprehension without parameters is valid, but where restricted comprehension with parameters is not (although this invalidity was not established until Cohen). This is the model based on ordinal definability in set theory.
The main questions considered in this paper are the consistency of a variant of a set theory with intuitionistic logic, with Brouwer's principle and the investigation of the comparative power of the Church's Thesis' variants at the set theory level.
Andrzej Kisielewicz has proposed three systems of double extension set theory of which we have shown two to be inconsistent in an earlier paper. Kisielewicz presented an argument that the remaining system interprets ZF, which is defective: it actually shows that the surviving possibly consistent system of double extension set theory interprets ZF with Separation and Comprehension restricted to 0 formulas. We show that this system does interpret ZF, using an analysis of the structure of the ordinals.
The separation, uniformization, and other properties of the Borel and projective hierarchies over hyperfinite sets are investigated and compared to the corresponding properties in classical descriptive set theory. The techniques used in this investigation also provide some results about countably determined sets and functions, as well as an improvement of an earlier theorem of Kunen and Miller.
Using two distinct membership symbols makes possible to base set theory on one general axiom schema of comprehension. Is the resulting system consistent? Can set theory and mathematics be based on a single axiom schema of comprehension?
It is well known that, in the terminology of Moschovakis, Descriptive set theory (1980), every adequate normed pointclass closed under ∀ω has an effective version of the generalized reduction property (GRP) called the easy uniformization property (EUP). We prove a dual result: every adequate normed pointclass closed under ∃ω has the EUP. Moschovakis was concerned with the descriptive set theory of subsets of Polish topological spaces. We set up a general framework for parts of descriptive set theory (...) and prove results that have as special cases not only the just-mentioned topological results, but also corresponding results concerning the descriptive set theory of classes of structures. Vaught (1973) asked whether the class of cPCδ classes of countable structures has the GRP. It does. A cPC(A) class is the class of all models of a sentence of the form ¬∃K̄φ, where φ is a sentence of L∞ω that is in A and K̄ is a set of relation symbols that is in A. Vaught also asked whether there is any primitive recursively closed set A such that some effective version of the GRP holds for the class of cPC(A) classes of countable structures. There is: The class of cPC(A) classes of countable structures has the EUP if ω ∈ A and A is countable and primitive recursively closed. Those results and some extensions are obtained by first showing that the relevant classes of classes of structures, which Vaught showed normed, are in a suitable sense adequate and closed under ∃ω, and then applying the dual easy uniformization theorem. (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)
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.
