Philosophy of Set Theory
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Set Theory, by Thomas Jech, Academic Press, New York, 1978, Xii + 621 Pp., '$53.00
BOOK REVIEWS 775 BULLETIN (New Series) OF THE AMERICAN MATHEMATICAL SOCIETY Volume 3, Number 1, July 1980 © 1980 American Mathematical Society 0002-9904/80/0000-0 319/$01.75 Set theory, by Thomas Jech, Academic Press, New York, 1978, xii + 621 pp., '$53.00. "General set theory is pretty trivial stuff really" (Halmos; see [H, p. vi]). At least, with the hindsight afforded by Cantor, Zermelo, and others, it is pretty trivial to do the following. First, write down a list of axioms about sets and membership, enunciating some "obviously true" set-theoretic principles; the most popular Hst today is called ZFC (the Zermelo-Fraenkel axioms with the axiom of Choice). Next, explain how, from ZFC, one may derive all of conventional mathematics, including the general theory of transfinite cardi nals and ordinals. This "trivial" part of set theory is well covered in standard texts, such as [E] or [H]. Jech's book is an introduction to the "nontrivial" part. Now, nontrivial set theory may be roughly divided into two general areas. The first area, classical set theory, is a direct outgrowth of Cantor's work. Cantor set down the basic properties of cardinal numbers. In particular, he showed that if K is a cardinal number, then 2", or exp(/c), is a cardinal strictly larger than K (if A is a set of size K, 2* is the cardinality of the family of all subsets of A). Now starting with a cardinal K, we may form larger cardinals exp(ic), exp2(ic) = exp(exp(fc)), exp3(ic) = exp(exp2(ic)), and in fact this may be continued through the transfinite to form expa(»c) for every ordinal number a. -
Cantor, God, and Inconsistent Multiplicities*
STUDIES IN LOGIC, GRAMMAR AND RHETORIC 44 (57) 2016 DOI: 10.1515/slgr-2016-0008 Aaron R. Thomas-Bolduc University of Calgary CANTOR, GOD, AND INCONSISTENT MULTIPLICITIES* Abstract. The importance of Georg Cantor’s religious convictions is often ne- glected in discussions of his mathematics and metaphysics. Herein I argue, pace Jan´e(1995), that due to the importance of Christianity to Cantor, he would have never thought of absolutely infinite collections/inconsistent multiplicities, as being merely potential, or as being purely mathematical entities. I begin by considering and rejecting two arguments due to Ignacio Jan´e based on letters to Hilbert and the generating principles for ordinals, respectively, showing that my reading of Cantor is consistent with that evidence. I then argue that evidence from Cantor’s later writings shows that he was still very religious later in his career, and thus would not have given up on the reality of the absolute, as that would imply an imperfection on the part of God. The theological acceptance of his set theory was very important to Can- tor. Despite this, the influence of theology on his conception of absolutely infinite collections, or inconsistent multiplicities, is often ignored in contem- porary literature.1 I will be arguing that due in part to his religious convic- tions, and despite an apparent tension between his earlier and later writings, Cantor would never have considered inconsistent multiplicities (similar to what we now call proper classes) as completed in a mathematical sense, though they are completed in Intellectus Divino. Before delving into the issue of the actuality or otherwise of certain infinite collections, it will be informative to give an explanation of Cantor’s terminology, as well a sketch of Cantor’s relationship with religion and reli- gious figures. -
“Gödel's Modernism: on Set-Theoretic Incompleteness,” Revisited
“G¨odel'sModernism: on Set-Theoretic Incompleteness," revisited∗ Mark van Atten and Juliette Kennedy As to problems with the answer Yes or No, the con- viction that they are always decidable remains un- touched by these results. —G¨odel Contents 1 Introduction 1.1 Questions of incompleteness On Friday, November 15, 1940, Kurt G¨odelgave a talk on set theory at Brown University.1 The topic was his recent proof of the consistency of Cantor's Con- tinuum Hypothesis, henceforth CH,2 with the axiomatic system for set theory ZFC.3 His friend from their days in Vienna, Rudolf Carnap, was in the audience, and afterward wrote a note to himself in which he raised a number of questions on incompleteness:4 (Remarks I planned to make, but did not) Discussion on G¨odel'slecture on the Continuum Hypothesis, November 14,5 1940 There seems to be a difference: between the undecidable propo- sitions of the kind of his example [i.e., 1931] and propositions such as the Axiom of Choice, and the Axiom of the Continuum [CH ]. We used to ask: \When these two have been decided, is then everything decided?" (The Poles, Tarski I think, suspected that this would be the case.) Now we know that (on the basis of the usual finitary rules) there will always remain undecided propositions. ∗An earlier version of this paper appeared as ‘G¨odel'smodernism: on set-theoretic incom- pleteness', Graduate Faculty Philosophy Journal, 25(2), 2004, pp.289{349. Erratum facing page of contents in 26(1), 2005. 1 1. Can we nevertheless still ask an analogous question? I.e. -
Set-Theoretic Geology, the Ultimate Inner Model, and New Axioms
Set-theoretic Geology, the Ultimate Inner Model, and New Axioms Justin William Henry Cavitt (860) 949-5686 [email protected] Advisor: W. Hugh Woodin Harvard University March 20, 2017 Submitted in partial fulfillment of the requirements for the degree of Bachelor of Arts in Mathematics and Philosophy Contents 1 Introduction 2 1.1 Author’s Note . .4 1.2 Acknowledgements . .4 2 The Independence Problem 5 2.1 Gödelian Independence and Consistency Strength . .5 2.2 Forcing and Natural Independence . .7 2.2.1 Basics of Forcing . .8 2.2.2 Forcing Facts . 11 2.2.3 The Space of All Forcing Extensions: The Generic Multiverse 15 2.3 Recap . 16 3 Approaches to New Axioms 17 3.1 Large Cardinals . 17 3.2 Inner Model Theory . 25 3.2.1 Basic Facts . 26 3.2.2 The Constructible Universe . 30 3.2.3 Other Inner Models . 35 3.2.4 Relative Constructibility . 38 3.3 Recap . 39 4 Ultimate L 40 4.1 The Axiom V = Ultimate L ..................... 41 4.2 Central Features of Ultimate L .................... 42 4.3 Further Philosophical Considerations . 47 4.4 Recap . 51 1 5 Set-theoretic Geology 52 5.1 Preliminaries . 52 5.2 The Downward Directed Grounds Hypothesis . 54 5.2.1 Bukovský’s Theorem . 54 5.2.2 The Main Argument . 61 5.3 Main Results . 65 5.4 Recap . 74 6 Conclusion 74 7 Appendix 75 7.1 Notation . 75 7.2 The ZFC Axioms . 76 7.3 The Ordinals . 77 7.4 The Universe of Sets . 77 7.5 Transitive Models and Absoluteness . -
Turing, Gödel and the Bright Abyss
Turing, Gödel and the “Bright Abyss” Juliet Floyd ! 2/5/2015 9:25 AM Comment [1]: 1. Check phone number okay to use this ong?; Also need 2. ABSTRACT of 1 Introduction 150-200 words and 3. a CONTRIBUTOR bi- ography of up to 100 words! Xxx, J. They have completely forgotten what is a mathematical creation: a vision that decants little by little over months and years, bringing to light the obvious [evident] thing that no one had seen, taking form in an obvious assertion of which no one had dreamed ... and that the first one to come along can then prove in five minutes, using techniques ready to hand [toutes cuites] • A. Grothendiek, Recoltes et Sémailles, 1986 Mathematics: there is that which is taken on faith and that which is proved; there is that which is buried deep inside the heart of the mathematician1 and that which is wholly public; there is intuition and fact and the “bright abyss” in be- tween; there is the raw, one might say, and the cooked. I hold up my hand and I count five fingers. I take it on faith that the mapping from fingers onto numbers is recursive in the sense of the mathematician’s defi- nition of the informal concept, “human calculability following a fixed routine.” I cannot prove the mapping is recursive—there is nothing to prove! Of course, mathematicians can prove many theorems about recursiveness, moving forward, so to speak, once the definition of the concept “recursive” has been isolated. Moving backwards is more difficult and this is as it should be: for how can one possibly hope to prove that a mathematical -
Cantor-Von Neumann Set-Theory Fa Muller
Logique & Analyse 213 (2011), x–x CANTOR-VON NEUMANN SET-THEORY F.A. MULLER Abstract In this elementary paper we establish a few novel results in set the- ory; their interest is wholly foundational-philosophical in motiva- tion. We show that in Cantor-Von Neumann Set-Theory, which is a reformulation of Von Neumann's original theory of functions and things that does not introduce `classes' (let alone `proper classes'), developed in the 1920ies, both the Pairing Axiom and `half' the Axiom of Limitation are redundant — the last result is novel. Fur- ther we show, in contrast to how things are usually done, that some theorems, notably the Pairing Axiom, can be proved without invok- ing the Replacement Schema (F) and the Power-Set Axiom. Also the Axiom of Choice is redundant in CVN, because it a theorem of CVN. The philosophical interest of Cantor-Von Neumann Set- Theory, which is very succinctly indicated, lies in the fact that it is far better suited than Zermelo-Fraenkel Set-Theory as an axioma- tisation of what Hilbert famously called Cantor's Paradise. From Cantor one needs to jump to Von Neumann, over the heads of Zer- melo and Fraenkel, and then reformulate. 0. Introduction In 1928, Von Neumann published his grand axiomatisation of Cantorian Set- Theory [1925; 1928]. Although Von Neumann's motivation was thoroughly Cantorian, he did not take the concept of a set and the membership-relation as primitive notions, but the concepts of a thing and a function — for rea- sons we do not go into here. This, and Von Neumann's cumbersome nota- tion and terminology (II-things, II.I-things) are the main reasons why ini- tially his theory remained comparatively obscure. -
Arxiv:1901.02074V1 [Math.LO] 4 Jan 2019 a Xoskona Lrecrias Ih Eal Ogv Entv a Definitive a Give T to of Able Basis Be the Might Cardinals” [17]
GENERIC LARGE CARDINALS AS AXIOMS MONROE ESKEW Abstract. We argue against Foreman’s proposal to settle the continuum hy- pothesis and other classical independent questions via the adoption of generic large cardinal axioms. Shortly after proving that the set of all real numbers has a strictly larger car- dinality than the set of integers, Cantor conjectured his Continuum Hypothesis (CH): that there is no set of a size strictly in between that of the integers and the real numbers [1]. A resolution of CH was the first problem on Hilbert’s famous list presented in 1900 [19]. G¨odel made a major advance by constructing a model of the Zermelo-Frankel (ZF) axioms for set theory in which the Axiom of Choice and CH both hold, starting from a model of ZF. This showed that the axiom system ZF, if consistent on its own, could not disprove Choice, and that ZF with Choice (ZFC), a system which suffices to formalize the methods of ordinary mathematics, could not disprove CH [16]. It remained unknown at the time whether models of ZFC could be found in which CH was false, but G¨odel began to suspect that this was possible, and hence that CH could not be settled on the basis of the normal methods of mathematics. G¨odel remained hopeful, however, that new mathemati- cal axioms known as “large cardinals” might be able to give a definitive answer on CH [17]. The independence of CH from ZFC was finally solved by Cohen’s invention of the method of forcing [2]. Cohen’s method showed that ZFC could not prove CH either, and in fact could not put any kind of bound on the possible number of cardinals between the sizes of the integers and the reals. -
Are Large Cardinal Axioms Restrictive?
Are Large Cardinal Axioms Restrictive? Neil Barton∗ 24 June 2020y Abstract The independence phenomenon in set theory, while perva- sive, can be partially addressed through the use of large cardinal axioms. A commonly assumed idea is that large cardinal axioms are species of maximality principles. In this paper, I argue that whether or not large cardinal axioms count as maximality prin- ciples depends on prior commitments concerning the richness of the subset forming operation. In particular I argue that there is a conception of maximality through absoluteness, on which large cardinal axioms are restrictive. I argue, however, that large cardi- nals are still important axioms of set theory and can play many of their usual foundational roles. Introduction Large cardinal axioms are widely viewed as some of the best candi- dates for new axioms of set theory. They are (apparently) linearly ordered by consistency strength, have substantial mathematical con- sequences for questions independent from ZFC (such as consistency statements and Projective Determinacy1), and appear natural to the ∗Fachbereich Philosophie, University of Konstanz. E-mail: neil.barton@uni- konstanz.de. yI would like to thank David Aspero,´ David Fernandez-Bret´ on,´ Monroe Eskew, Sy-David Friedman, Victoria Gitman, Luca Incurvati, Michael Potter, Chris Scam- bler, Giorgio Venturi, Matteo Viale, Kameryn Williams and audiences in Cambridge, New York, Konstanz, and Sao˜ Paulo for helpful discussion. Two anonymous ref- erees also provided helpful comments, and I am grateful for their input. I am also very grateful for the generous support of the FWF (Austrian Science Fund) through Project P 28420 (The Hyperuniverse Programme) and the VolkswagenStiftung through the project Forcing: Conceptual Change in the Foundations of Mathematics. -
Martin's Maximum and Weak Square
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 00, Number 0, Pages 000{000 S 0002-9939(XX)0000-0 MARTIN'S MAXIMUM AND WEAK SQUARE JAMES CUMMINGS AND MENACHEM MAGIDOR (Communicated by Julia Knight) Abstract. We analyse the influence of the forcing axiom Martin's Maximum on the existence of square sequences, with a focus on the weak square principle λ,µ. 1. Introduction It is well known that strong forcing axioms (for example PFA, MM) and strong large cardinal axioms (strongly compact, supercompact) exert rather similar kinds of influence on the combinatorics of infinite cardinals. This is perhaps not so sur- prising when we consider the widely held belief that essentially the only way to obtain a model of PFA or MM is to collapse a supercompact cardinal to become !2. We quote a few results which bring out the similarities: 1a) (Solovay [14]) If κ is supercompact then λ fails for all λ ≥ κ. 1b) (Todorˇcevi´c[15]) If PFA holds then λ fails for all λ ≥ !2. ∗ 2a) (Shelah [11]) If κ is supercompact then λ fails for all λ such that cf(λ) < κ < λ. ∗ 2b) (Magidor, see Theorem 1.2) If MM holds then λ fails for all λ such that cf(λ) = !. 3a) (Solovay [13]) If κ is supercompact then SCH holds at all singular cardinals greater than κ. 3b) (Foreman, Magidor and Shelah [7]) If MM holds then SCH holds. 3c) (Viale [16]) If PFA holds then SCH holds. In fact both the p-ideal di- chotomy and the mapping reflection principle (which are well known con- sequences of PFA) suffice to prove SCH. -
A Cardinal Preserving Extension Making the Set of Points of Countable V Cofinality Nonstationary
A CARDINAL PRESERVING EXTENSION MAKING THE SET OF POINTS OF COUNTABLE V COFINALITY NONSTATIONARY MOTI GITIK, ITAY NEEMAN, AND DIMA SINAPOVA Abstract. Assuming large cardinals we produce a forcing extension of V which preserves cardinals, does not add reals, and makes the set of points of countable V cofinality in κ+ nonstationary. Continuing to force further, we obtain an extension in which the set of points of countable V cofinality in ν is nonstationary for every regular ν ≥ κ+. Finally we show that our large cardinal assumption is optimal. The results in this paper were inspired by the following question, posed in a preprint (http://arxiv.org/abs/math/0509633v1, 27 September 2005) to the paper Viale [9]: Suppose V ⊂ W and V and W have the same cardinals and the same reals. Can it be shown, in ZFC alone, that for every cardinal κ, there is in V a <ω + partition {As | s ∈ κ } of the points of κ of countable V cofinality, into disjoint sets which are stationary in W ? In this paper we show that under some assumptions on κ there is a reals and cardinal preserving generic extension W which satisfies that the set of points of κ+ of countable V cofinality is nonstationary. In particular, a partition as above cannot be found for each κ. Continuing to force further, we produce a reals and cardinal preserving extension in which the set of points of λ of countable V cofinality is nonstationary for every regular λ ≥ κ+. All this is done under the large cardinal assumption that for each α<κ there exists θ<κ with Mitchell order at least α. -
A Framework for Forcing Constructions at Successors of Singular Cardinals
A FRAMEWORK FOR FORCING CONSTRUCTIONS AT SUCCESSORS OF SINGULAR CARDINALS JAMES CUMMINGS, MIRNA DAMONJA, MENACHEM MAGIDOR, CHARLES MORGAN, AND SAHARON SHELAH Abstract. We describe a framework for proving consistency re- sults about singular cardinals of arbitrary conality and their suc- cessors. This framework allows the construction of models in which the Singular Cardinals Hypothesis fails at a singular cardinal κ of uncountable conality, while κ+ enjoys various combinatorial prop- erties. As a sample application, we prove the consistency (relative to that of ZFC plus a supercompact cardinal) of there being a strong limit singular cardinal κ of uncountable conality where SCH fails + and such that there is a collection of size less than 2κ of graphs on κ+ such that any graph on κ+ embeds into one of the graphs in the collection. Introduction The class of uncountable regular cardinals is naturally divided into three disjoint classes: the successors of regular cardinals, the successors of singular cardinals and the weakly inaccessible cardinals. When we 2010 Mathematics Subject Classication. Primary: 03E35, 03E55, 03E75. Key words and phrases. successor of singular, Radin forcing, forcing axiom, uni- versal graph. Cummings thanks the National Science Foundation for their support through grant DMS-1101156. Cummings, Dºamonja and Morgan thank the Institut Henri Poincaré for their support through the Research in Paris program during the period 24-29 June 2013. Dºamonja, Magidor and Shelah thank the Mittag-Leer Institute for their sup- port during the month of September 2009. Mirna Dºamonja thanks EPSRC for their support through their grants EP/G068720 and EP/I00498. Morgan thanks EPSRC for their support through grant EP/I00498. -
A NEW L¨OWENHEIM-SKOLEM THEOREM 1. Introduction The
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 357, Number 5, Pages 1693–1715 S 0002-9947(04)03445-2 Article electronically published on December 16, 2004 ANEWLOWENHEIM-SKOLEM¨ THEOREM MATTHEW FOREMAN AND STEVO TODORCEVIC Abstract. This paper establishes a refinement of the classical L¨owenheim- Skolem theorem. The main result shows that any first order structure has a countable elementary substructure with strong second order properties. Sev- eral consequences for Singular Cardinals Combinatorics are deduced from this. 1. Introduction The L¨owenheim-Skolem Theorem [21] is one of the classical and formative results of first order logic. Its consequences have been important technically in the devel- opment of Model Theory, Set Theory and interesting from the point of view of the Philosophy of Mathematics [16]. In this paper we improve the L¨owenheim-Skolem Theorem and deduce important combinatorial consequences from the stronger ver- sion. There have been many attempts to improve and generalize properties of first order logic to stronger logics. The literature is much too large to survey here. One property that defines first order logic is the fact that every infinite structure in a countable language has a countable elementary substructure. This is not true of many stronger logics such as second order logic. In particular, in the classical L¨owenheim-Skolem theorem, one has no control over the second order properties of the elementary substructure. In this paper we prove that if one fixes in advance a collection of “intervals” around each point in a particular domain κ (e.g. a club guessing ladder system), then for all real numbers r and all structures A with domain κ, there is a countable elementary substructure of A that has non-empty intersection with exactly those intervals specified by r.