DOCSLIB.ORG

Forcing As a Computational Process

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Forcing As a Computational Process FORCING AS A COMPUTATIONAL PROCESS JOEL DAVID HAMKINS, RUSSELL MILLER, AND KAMERYN J. WILLIAMS Abstract. We investigate how set-theoretic forcing can be seen as a compu- tational process on the models of set theory. Given an oracle for information about a model of set theory hM; 2M i, we explain senses in which one may compute M-generic filters G ⊆ P 2 M and the corresponding forcing exten- sions M[G]. Specifically, from the atomic diagram one may compute G, from the ∆0-diagram one may compute M[G] and its ∆0-diagram, and from the ele- mentary diagram one may compute the elementary diagram of M[G]. We also examine the information necessary to make the process functorial, and con- clude that in the general case, no such computational process will be functorial. For any such process, it will always be possible to have different isomorphic presentations of a model of set theory M that lead to different non-isomorphic forcing extensions M[G]. Indeed, there is no Borel function providing generic filters that is functorial in this sense. 1. Introduction The method of forcing, introduced by Paul Cohen to show the consistency of the failure of the continuum hypothesis, has become ubiquitous within set theory.1 In this paper we analyze this method from the perspective of computable structure theory. To what extent is forcing an effective process? Main Question. Given an oracle for a countable model of set theory M, to what extent can we compute its various forcing extensions M[G]? We answer this, considering multiple levels of information which might be given by the oracle. Main Theorem 1 (Forcing as a computational process). (1) For each countable model M of set theory and for any forcing notion P 2 M there is an M-generic filter G ⊆ P computable from the atomic diagram of M. 2 (2) Given the ∆0-diagram of M and a forcing notion P 2 M, we can uniformly compute such a G, the atomic diagram of M[G], and moreover the ∆0- diagram of M[G]. 2010 Mathematics Subject Classification. 03C57, 03E40. Key words and phrases. Forcing, computable structure theory. We thank the anonymous referee for their helpful comments. The second author was supported by NSF grant # DMS-1362206, Simons Foundation grant # 581896, and several PSC-CUNY research awards. Commentary can be made about this article on the first author's blog at http://jdh.hamkins.org/forcing-as-a-computational-process. 1We will give an overview of the construction during Section 4. For full details we refer the reader to [Sho71] or [Kun80]. See also [Cho09] for a conceptual overview. 2 ∆0 in the sense of the L´evyhierarchy, as described below. 1 2 JOEL DAVID HAMKINS, RUSSELL MILLER, AND KAMERYN J. WILLIAMS (3) From P and the elementary diagram of M, we can uniformly compute the elementary diagram of M[G], and this holds level-by-level for the Σn- diagrams. These statements are proved in Section 4 as Theorems 8, 10, and 11 below. In Section 5 we will extend these results to look at the generic multiverse of a countable model of set theory, i.e. those models obtained from the original model by taking both forcing extensions and grounds, where taking grounds is the process inverse to building forcing extensions. In Section 6 we also consider versions of these results for class forcing instead of set forcing. We remark here that in this context the ∆0-diagram of M refers to the set of formulae true in M that are ∆0 in the L´evyhierarchy. In this hierarchy, the standard one used within set theory, ∆0-formulae are those whose only quantifiers are bounded by sets, that is, of the form 9x 2 y or 8x 2 y. This differs from ∆0 in the arithmetical hierarchy, whose formulae's quantifiers are only those bounded by the order relation on !, that is of the form 9x < y or 8x < y. In Section 2 we will show that very little can be computed from the atomic diagram for a model of set theory. From the diagram we are not even able to compute relations as simple as x ⊆ y. We view this as evidence that for the computable structure theory of set theory the L´evy∆0-diagram is an appropriate choice of the basic information to be used. The usual signature of set theory|just equality and the membership relation|is too spartan to say anything of use. In Section 3 we introduce an expansion of the signature for set theory which captures the strength of the L´evy ∆0-diagram. We show that the Σn-formulae in the L´evyhierarchy are precisely those that are Σn in the arithmetical hierarchy with the expanded signature. We end the paper, in Sections 7 and 8, by investigating how much information is required to make the process of computing M[G] from M functorial. Without significant detail about the dense subsets of P, it will not be so. Recall that a pre- sentation of a countable structure M is simply a structure isomorphic to M whose domain is !. The following theorem emphasizes the importance of not conflating the isomorphism type of M with a specific presentation of M. Main Theorem 2 (Nonfunctoriality of forcing). There is no computable procedure and indeed no Borel procedure which performs the tasks of Main Theorem 1 in a uniform way so that distinct presentations of the model M will result in isomorphic presentations of the extension M[G]. We also show that forcing can be made a functorial process. One way to do this is to add extra information to the signature of the model. Another way is to restrict to a special class of models, namely the pointwise definable models. 2. The atomic diagram of a model of set theory knows very little In this section, we show that very little about a model of set theory can be computed from its atomic diagram. In particular, many basic set-theoretic relations are not decidable from the atomic diagram. As a warmup, let us first see that the atomic diagram does not suffice to identify even a single fixed element. Proposition 3. For any countable model of set theory hM; 2M i and any element b 2 M, no algorithm will pick out the number representing b uniformly given an oracle for the atomic diagram of a copy of M. FORCING AS A COMPUTATIONAL PROCESS 3 For example, given the atomic diagram of a copy of M, one cannot reliably find the empty set, nor the ordinal !, nor the set R of reals. Proof. Fix b 2 M and fix an oracle for the atomic diagram of a copy of M. Suppose we are faced with an algorithm purported to identify b. Run the algorithm until it has produced a number that it claims is representing b. This algorithm inspected only finitely much of the atomic diagram of M. The number b it produced has at most finitely many elements in that portion of the atomic diagram. But M has many sets that extend that pattern of membership, and so we may find an alternative copy M 0 of M whose atomic diagram agrees with the original one on the part that was used by the computation, but disagrees afterwards in such a way that the number for b now represents a different set. So the algorithm will get the 0 wrong answer on M . This idea can be extended to characterize which relations on M are computably from the atomic diagram. In particular, any such relation must contain both finite and infinite sets. Theorem 4. Let hM; 2M i j= ZF be a countable model of set theory and let X ⊆ M n for some 1 ≤ n < !. The following are equivalent. (In the following, Σ1 in all cases refers to the arithmetical hierarchy, not the L´evyhierarchy.3) (1) X is uniformly relatively intrinsically computably enumerable in the atomic diagram of M. That is, there is a single computably enumerable operator which given the atomic diagram of a presentation of M will output the copy of X for that presentation. (2) Membership of each single ~a in X is witnessed by a finite pattern of 2 in the transitive closures of fa0g;:::; fan−1g, and the list of finite patterns witnessing membership is enumeration-reducible to the Σ1-diagram of M. (3) There is a L!1;!-formula '(x) so that '(x) is Σ1 and defines X, and the set of (finite) disjuncts in this formula is enumeration-reducible to the Σ1- diagram of M. Proof. (1 , 3) is a standard fact in computable structure theory, first established in [AKMS89], relativized here since M does not have a computable presentation. (2 ) 1) For notational simplicity we will present the argument for the n = 1 case. Suppose membership of a in X ⊆ M is witnessed by a finite pattern of 2 in the transitive closure of fag. That is, a is in X if and only if one of a certain list of finite graphs can be found in the pointed graph (TC(fag); a; 2M ). By hypothesis this list is e-reducible to the Σ1-diagram of M, which we can enumerate, since we have the atomic diagram of M as an oracle. Therefore, we can list out these finite graphs, one by one. Meanwhile, we enumerate 2M and M, and continually check whether the most recent pair in 2M has completed a copy of a graph from this list.
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.
    [Show full text]
  • The Universal Finite Set 3
    THE UNIVERSAL FINITE SET JOEL DAVID HAMKINS AND W. HUGH WOODIN Abstract. We define a certain finite set in set theory { x | ϕ(x) } and prove that it exhibits a universal extension property: it can be any desired particular finite set in the right set-theoretic universe and it can become successively any desired larger finite set in top-extensions of that universe. Specifically, ZFC proves the set is finite; the definition ϕ has complexity Σ2, so that any affirmative instance of it ϕ(x) is verified in any sufficiently large rank-initial segment of the universe Vθ ; the set is empty in any transitive model and others; and if ϕ defines the set y in some countable model M of ZFC and y ⊆ z for some finite set z in M, then there is a top-extension of M to a model N in which ϕ defines the new set z. Thus, the set shows that no model of set theory can realize a maximal Σ2 theory with its natural number parameters, although this is possible without parameters. Using the universal finite set, we prove that the validities of top-extensional set-theoretic potentialism, the modal principles valid in the Kripke model of all countable models of set theory, each accessing its top-extensions, are precisely the assertions of S4. Furthermore, if ZFC is consistent, then there are models of ZFC realizing the top-extensional maximality principle. 1. Introduction The second author [Woo11] established the universal algorithm phenomenon, showing that there is a Turing machine program with a certain universal top- extension property in models of arithmetic.
    [Show full text]
  • Open Class Determinacy Is Preserved by Forcing 3
    OPEN CLASS DETERMINACY IS PRESERVED BY FORCING JOEL DAVID HAMKINS AND W. HUGH WOODIN Abstract. The principle of open class determinacy is preserved by pre-tame class forcing, and after such forcing, every new class well-order is isomorphic to a ground-model class well-order. Similarly, the principle of elementary trans- finite recursion ETRΓ for a fixed class well-order Γ is preserved by pre-tame class forcing. The full principle ETR itself is preserved by countably strate- gically closed pre-tame class forcing, and after such forcing, every new class well-order is isomorphic to a ground-model class well-order. Meanwhile, it remains open whether ETR is preserved by all forcing, including the forcing merely to add a Cohen real. 1. Introduction The principle of elementary transfinite recursion ETR—according to which every first-order class recursion along any well-founded class relation has a solution—has emerged as a central organizing concept in the hierarchy of second-order set theories from G¨odel-Bernays set theory GBC up to Kelley-Morse set theory KM and beyond. Many of the principles in the hierarchy can be seen as asserting that certain class recursions have solutions. KM + class-DC KM+CC KM 1 GBC + Π1-comprehension GBC + Open determinacy for class games GBC+ETR = GBC+ Clopen determinacy for class games = GBC + iterated truth predicates GBC + ETROrd = GBC+ Class forcing theorem arXiv:1806.11180v1 [math.LO] 28 Jun 2018 = GBC + truth predicates for LOrd,ω(∈, A) = GBC + truth predicates for LOrd,Ord(∈, A) = GBC + Ord-iterated truth predicates = GBC + Boolean set-completions exist = GBC+Clopen determinacy for class games of rank Ord+1 GBC + ETRω GBC + Con(GBC) GBC In addition, many of these principles, including ETR and its variants, are equiv- alently characterized as determinacy principles for certain kinds of class games.
    [Show full text]
  • Lecture Notes: Axiomatic Set Theory
    Lecture Notes: Axiomatic Set Theory Asaf Karagila Last Update: May 14, 2018 Contents 1 Introduction 3 1.1 Why do we need axioms?...............................3 1.2 Classes and sets.....................................4 1.3 The axioms of set theory................................5 2 Ordinals, recursion and induction7 2.1 Ordinals.........................................8 2.2 Transfinite induction and recursion..........................9 2.3 Transitive classes.................................... 10 3 The relative consistency of the Axiom of Foundation 12 4 Cardinals and their arithmetic 15 4.1 The definition of cardinals............................... 15 4.2 The Aleph numbers.................................. 17 4.3 Finiteness........................................ 18 5 Absoluteness and reflection 21 5.1 Absoluteness...................................... 21 5.2 Reflection........................................ 23 6 The Axiom of Choice 25 6.1 The Axiom of Choice.................................. 25 6.2 Weak version of the Axiom of Choice......................... 27 7 Sets of Ordinals 31 7.1 Cofinality........................................ 31 7.2 Some cardinal arithmetic............................... 32 7.3 Clubs and stationary sets............................... 33 7.4 The Club filter..................................... 35 8 Inner models of ZF 37 8.1 Inner models...................................... 37 8.2 Gödel’s constructible universe............................. 39 1 8.3 The properties of L ................................... 41 8.4 Ordinal definable sets................................. 42 9 Some combinatorics on ω1 43 9.1 Aronszajn trees..................................... 43 9.2 Diamond and Suslin trees............................... 44 10 Coda: Games and determinacy 46 2 Chapter 1 Introduction 1.1 Why do we need axioms? In modern mathematics, axioms are given to define an object. The axioms of a group define the notion of a group, the axioms of a Banach space define what it means for something to be a Banach space.
    [Show full text]
  • A General Setting for the Pointwise Investigation of Determinacy
    A General Setting for the Pointwise Investigation of Determinacy Yurii Khomskii? Institute of Logic, Language and Computation University of Amsterdam Plantage Muidergracht 24 1018 TV Amsterdam The Netherlands Abstract. It is well-known that if we assume a large class of sets of reals to be determined then we may conclude that all sets in this class have certain regularity properties: we say that determinacy implies regularity properties classwise. In [L¨o05]the pointwise relation between determi- nacy and certain regularity properties (namely the Marczewski-Burstin algebra of arboreal forcing notions and a corresponding weak version) was examined. An open question was how this result extends to topological forcing no- tions whose natural measurability algebra is the class of sets having the Baire property. We study the relationship between the two cases, and using a definition which adequately generalizes both the Marczewski- Burstin algebra of measurability and the Baire property, prove results similar to [L¨o05]. We also show how this can be further generalized for the purpose of comparing algebras of measurability of various forcing notions. 1 Introduction The classical theorems due to Mycielski-Swierczkowski, Banach-Mazur and Mor- ton Davis respectively state that under the Axiom of Determinacy all sets of reals are Lebesgue measurable, have the Baire property and the perfect set property (see, e.g., [Ka94, pp 373{377]). In fact, these proofs give classwise implications, i.e., if Γ is a boldface pointclass (closed under continuous preimages and inter- sections with basic open sets) such that all sets in Γ are determined, then all sets in Γ have the corresponding regularity property.
    [Show full text]
  • Equivalents to the Axiom of Choice and Their Uses A
    EQUIVALENTS TO THE AXIOM OF CHOICE AND THEIR USES A Thesis Presented to The Faculty of the Department of Mathematics California State University, Los Angeles In Partial Fulfillment of the Requirements for the Degree Master of Science in Mathematics By James Szufu Yang c 2015 James Szufu Yang ALL RIGHTS RESERVED ii The thesis of James Szufu Yang is approved. Mike Krebs, Ph.D. Kristin Webster, Ph.D. Michael Hoffman, Ph.D., Committee Chair Grant Fraser, Ph.D., Department Chair California State University, Los Angeles June 2015 iii ABSTRACT Equivalents to the Axiom of Choice and Their Uses By James Szufu Yang In set theory, the Axiom of Choice (AC) was formulated in 1904 by Ernst Zermelo. It is an addition to the older Zermelo-Fraenkel (ZF) set theory. We call it Zermelo-Fraenkel set theory with the Axiom of Choice and abbreviate it as ZFC. This paper starts with an introduction to the foundations of ZFC set the- ory, which includes the Zermelo-Fraenkel axioms, partially ordered sets (posets), the Cartesian product, the Axiom of Choice, and their related proofs. It then intro- duces several equivalent forms of the Axiom of Choice and proves that they are all equivalent. In the end, equivalents to the Axiom of Choice are used to prove a few fundamental theorems in set theory, linear analysis, and abstract algebra. This paper is concluded by a brief review of the work in it, followed by a few points of interest for further study in mathematics and/or set theory. iv ACKNOWLEDGMENTS Between the two department requirements to complete a master's degree in mathematics − the comprehensive exams and a thesis, I really wanted to experience doing a research and writing a serious academic paper.
    [Show full text]
  • Forcing in Proof Theory∗
    Forcing in proof theory¤ Jeremy Avigad November 3, 2004 Abstract Paul Cohen's method of forcing, together with Saul Kripke's related semantics for modal and intuitionistic logic, has had profound e®ects on a number of branches of mathematical logic, from set theory and model theory to constructive and categorical logic. Here, I argue that forcing also has a place in traditional Hilbert-style proof theory, where the goal is to formalize portions of ordinary mathematics in restricted axiomatic theories, and study those theories in constructive or syntactic terms. I will discuss the aspects of forcing that are useful in this respect, and some sample applications. The latter include ways of obtaining conservation re- sults for classical and intuitionistic theories, interpreting classical theories in constructive ones, and constructivizing model-theoretic arguments. 1 Introduction In 1963, Paul Cohen introduced the method of forcing to prove the indepen- dence of both the axiom of choice and the continuum hypothesis from Zermelo- Fraenkel set theory. It was not long before Saul Kripke noted a connection be- tween forcing and his semantics for modal and intuitionistic logic, which had, in turn, appeared in a series of papers between 1959 and 1965. By 1965, Scott and Solovay had rephrased Cohen's forcing construction in terms of Boolean-valued models, foreshadowing deeper algebraic connections between forcing, Kripke se- mantics, and Grothendieck's notion of a topos of sheaves. In particular, Lawvere and Tierney were soon able to recast Cohen's original independence proofs as sheaf constructions.1 It is safe to say that these developments have had a profound impact on most branches of mathematical logic.
    [Show full text]
  • Tuple Routing Strategies for Distributed Eddies
    Tuple Routing Strategies for Distributed Eddies Feng Tian David J. DeWitt Department of Computer Sciences University of Wisconsin, Madison Madison, WI, 53706 {ftian, dewitt}@cs.wisc.edu Abstract data stream management systems has begun to receive the attention of the database community. Many applications that consist of streams of data Many of the fundamental assumptions that are the are inherently distributed. Since input stream basis of standard database systems no longer hold for data rates and other system parameters such as the stream management systems [8]. A typical stream query is amount of available computing resources can long running -- it listens on several continuous streams fluctuate significantly, a stream query plan must and produces a continuous stream as its result. The notion be able to adapt to these changes. Routing tuples of running time, which is used as an optimization goal by between operators of a distributed stream query a classic database optimizer, cannot be directly applied to plan is used in several data stream management a stream management system. A data stream management systems as an adaptive query optimization system must use other performance metrics. In addition, technique. The routing policy used can have a since the input stream rates and the available computing significant impact on system performance. In this resources will usually fluctuate over time, an execution paper, we use a queuing network to model a plan that works well at query installation time might be distributed stream query plan and define very inefficient just a short time later. Furthermore, the performance metrics for response time and “optimize-then-execute” paradigm of traditional database system throughput.
    [Show full text]
  • The Bristol Model (5/5)
    The Bristol model (5/5) Asaf Karagila University of East Anglia 22 November 2019 RIMS Set Theory Workshop 2019 Set Theory and Infinity Asaf Karagila (UEA) The Bristol model (5/5) 22 November 2019 1 / 23 Review Bird’s eye view of Bristol We started in L by choosing a Bristol sequence, that is a sequence of permutable families and permutable scales, and we constructed one step at a time models, Mα, such that: 1 M0 = L. Mα Mα+1 2 Mα+1 is a symmetric extension of Mα, and Vω+α = Vω+α . 3 For limit α, Mα is the finite support limit of the iteration, and Mα S Mβ Vω+α = β<α Vω+β. By choosing our Mα-generic filters correctly, we ensured that Mα ⊆ L[%0], where %0 was an L-generic Cohen real. We then defined M, the Bristol model, S S Mα as α∈Ord Mα = α∈Ord Vω+α. Asaf Karagila (UEA) The Bristol model (5/5) 22 November 2019 2 / 23 Properties of the Bristol model Small Violations of Choice Definition (Blass) We say that V |= SVC(X) if for every A there is an ordinal η and a surjection f : X × η → A. We write SVC to mean ∃X SVC(X). Theorem If M = V (x) where V |= ZFC, then M |= SVC. Theorem If M is a symmetric extension of V |= ZFC, Then M |= SVC. The following are equivalent: 1 SVC. 2 1 ∃X such that X<ω AC. 3 ∃P such that 1 P AC. 4 V is a symmetric extension of a model of ZFC (Usuba).
    [Show full text]
  • On the Origins of Bisimulation and Coinduction
    On the Origins of Bisimulation and Coinduction DAVIDE SANGIORGI University of Bologna, Italy The origins of bisimulation and bisimilarity are examined, in the three fields where they have been independently discovered: Computer Science, Philosophical Logic (precisely, Modal Logic), Set Theory. Bisimulation and bisimilarity are coinductive notions, and as such are intimately related to fixed points, in particular greatest fixed points. Therefore also the appearance of coinduction and fixed points is discussed, though in this case only within Computer Science. The paper ends with some historical remarks on the main fixed-point theorems (such as Knaster-Tarski) that underpin the fixed-point theory presented. Categories and Subject Descriptors: F.4.1 [Mathematical logic and formal languages]: Math- ematical Logic—Computational logic; Modal logic; Set theory; F.4.0 [Mathematical logic and formal languages]: General General Terms: Theory, Verification Additional Key Words and Phrases: Bisimulation, coinduction, fixed points, greatest fixed points, history Contents 1 Introduction 112 2 Background 114 2.1 Bisimulation................................ 114 2.2 Approximants of bisimilarity . 116 2.3 Coinduction................................116 3 Bisimulation in Modal Logic 119 3.1 Modallogics................................119 3.2 Fromhomomorphismtop-morphism . 120 3.3 JohanvanBenthem ........................... 122 3.4 Discussion.................................125 4 Bisimulation in Computer Science 125 4.1 Algebraictheoryofautomata . 125 4.2 RobinMilner ...............................128 Author’s address: Dipartimento di Scienze dell’Informazione Universita’ di Bologna Mura Anteo Zamboni, 7 40126 Bologna, ITALY. Permission to make digital/hard copy of all or part of this material without fee for personal or classroom use provided that the copies are not made or distributed for profit or commercial advantage, the ACM copyright/server notice, the title of the publication, and its date appear, and notice is given that copying is by permission of the ACM, Inc.
    [Show full text]
  • FORCING and the INDEPENDENCE of the CONTINUUM HYPOTHESIS Contents 1. Preliminaries 2 1.1. Set Theory 2 1.2. Model Theory 3 2. Th
    FORCING AND THE INDEPENDENCE OF THE CONTINUUM HYPOTHESIS F. CURTIS MASON Abstract. The purpose of this article is to develop the method of forcing and explain how it can be used to produce independence results. We first remind the reader of some basic set theory and model theory, which will then allow us to develop the logical groundwork needed in order to ensure that forcing constructions can in fact provide proper independence results. Next, we develop the basics of forcing, in particular detailing the construction of generic extensions of models of ZFC and proving that those extensions are themselves models of ZFC. Finally, we use the forcing notions Cκ and Kα to prove that the Continuum Hypothesis is independent from ZFC. Contents 1. Preliminaries 2 1.1. Set Theory 2 1.2. Model Theory 3 2. The Logical Justification for Forcing 4 2.1. The Reflection Principle 4 2.2. The Mostowski Collapsing Theorem and Countable Transitive Models 7 2.3. Basic Absoluteness Results 8 3. The Logical Structure of the Argument 9 4. Forcing Notions 9 5. Generic Extensions 12 6. The Forcing Relation 14 7. The Independence of the Continuum Hypothesis 18 Acknowledgements 23 References 23 The Continuum Hypothesis (CH) is the assertion that there are no cardinalities strictly in between that of the natural numbers and that of the reals, or more for- @0 mally, 2 = @1. In 1940, Kurt G¨odelshowed that both the Axiom of Choice and the Continuum Hypothesis are relatively consistent with the axioms of ZF ; he did this by constructing a so-called inner model L of the universe of sets V such that (L; 2) is a (class-sized) model of ZFC + CH.
    [Show full text]
  • Higher Randomness and Forcing with Closed Sets
    Higher randomness and forcing with closed sets Benoit Monin Université Paris Diderot, LIAFA, Paris, France [email protected] Abstract 1 Kechris showed in [8] that there exists a largest Π1 set of measure 0. An explicit construction of 1 this largest Π1 nullset has later been given in [6]. Due to its universal nature, it was conjectured by many that this nullset has a high Borel rank (the question is explicitely mentioned in [3] and 0 [16]). In this paper, we refute this conjecture and show that this nullset is merely Σ3. Together 0 with a result of Liang Yu, our result also implies that the exact Borel complexity of this set is Σ3. To do this proof, we develop the machinery of effective randomness and effective Solovay gen- ericity, investigating the connections between those notions and effective domination properties. 1998 ACM Subject Classification F.4.1 Mathematical Logic Keywords and phrases Effective descriptive set theory, Higher computability, Effective random- ness, Genericity Digital Object Identifier 10.4230/LIPIcs.STACS.2014.566 1 Introduction We will study in this paper the notion of forcing with closed sets of positive measure and several variants of it. This forcing is generally attributed to Solovay, who used it in [15] to produce a model of ZF +DC in which all sets of reals are Lebesgue measurable. Stronger and stronger genericity for this forcing coincides with stronger and stronger notions of randomness. It is actually possible to express most of the randomness definitions that have been made over the years by forcing over closed sets of positive measure.
    [Show full text]