Minimal collapse maps at arbitrary projective level
|
|
- Briana Phelps
- 5 years ago
- Views:
Transcription
1 Minimal collapse maps at arbitrary projective level Vladimir Kanovei 1 Vassily Lyubetsky 2 1 IITP RAS and MIIT, Moscow. Supported by RFBR grant IITP RAS, Moscow. Support of RSF grant acknowledged Descriptive Set Theory in Turin September 6 8, 2017 Kanovei Lyubetsky Minimal collapse maps at projective levels Torino September / 9
2 Generic collapse maps Back Kanovei Lyubetsky Minimal collapse maps at projective levels Torino September / 9
3 Generic collapse maps Back 1 Cohen : there exist generic cofinal maps a : ω ω 1 (in fact, for any two cardinals) Kanovei Lyubetsky Minimal collapse maps at projective levels Torino September / 9
4 Generic collapse maps Back 1 Cohen : there exist generic cofinal maps a : ω ω 1 (in fact, for any two cardinals) 2 Prikry : there exist minimal cofinal maps a : ω ω 1, Kanovei Lyubetsky Minimal collapse maps at projective levels Torino September / 9
5 Generic collapse maps Back 1 Cohen : there exist generic cofinal maps a : ω ω 1 (in fact, for any two cardinals) 2 Prikry : there exist minimal cofinal maps a : ω ω 1, the minimality means that if b V[a], b : ω ω1 V is cofinal then a V[b] Kanovei Lyubetsky Minimal collapse maps at projective levels Torino September / 9
6 Generic collapse maps Back 1 Cohen : there exist generic cofinal maps a : ω ω 1 (in fact, for any two cardinals) 2 Prikry : there exist minimal cofinal maps a : ω ω 1, the minimality means that if b V[a], b : ω ω1 V is cofinal then a V[b] 3 Uri Abraham 1984 : if V = L is the ground model then there exists a minimal cofinal map a : ω ω1 V such that a is (coded by) a lightface Π2 1 real singleton in V[a]. Kanovei Lyubetsky Minimal collapse maps at projective levels Torino September / 9
7 Generic collapse maps Back 1 Cohen : there exist generic cofinal maps a : ω ω 1 (in fact, for any two cardinals) 2 Prikry : there exist minimal cofinal maps a : ω ω 1, the minimality means that if b V[a], b : ω ω1 V is cofinal then a V[b] 3 Uri Abraham 1984 : if V = L is the ground model then there exists a minimal cofinal map a : ω ω1 V such that a is (coded by) a lightface Π2 1 real singleton in V[a]. 4 VK + VL, the main result : if V = L is the ground model and n 3 then there exists a minimal cofinal map a : ω ω1 V such that it is true in V[a] that Kanovei Lyubetsky Minimal collapse maps at projective levels Torino September / 9
8 Generic collapse maps Back 1 Cohen : there exist generic cofinal maps a : ω ω 1 (in fact, for any two cardinals) 2 Prikry : there exist minimal cofinal maps a : ω ω 1, the minimality means that if b V[a], b : ω ω1 V is cofinal then a V[b] 3 Uri Abraham 1984 : if V = L is the ground model then there exists a minimal cofinal map a : ω ω1 V such that a is (coded by) a lightface Π2 1 real singleton in V[a]. 4 VK + VL, the main result : if V = L is the ground model and n 3 then there exists a minimal cofinal map a : ω ω1 V such that it is true in V[a] that 1 a is (coded by) a lightface Πn 1 real singleton, but Kanovei Lyubetsky Minimal collapse maps at projective levels Torino September / 9
9 Generic collapse maps Back 1 Cohen : there exist generic cofinal maps a : ω ω 1 (in fact, for any two cardinals) 2 Prikry : there exist minimal cofinal maps a : ω ω 1, the minimality means that if b V[a], b : ω ω1 V is cofinal then a V[b] 3 Uri Abraham 1984 : if V = L is the ground model then there exists a minimal cofinal map a : ω ω1 V such that a is (coded by) a lightface Π2 1 real singleton in V[a]. 4 VK + VL, the main result : if V = L is the ground model and n 3 then there exists a minimal cofinal map a : ω ω1 V such that it is true in V[a] that 1 a is (coded by) a lightface Πn 1 real singleton, but 2 every Σn 1 real is constructible. Kanovei Lyubetsky Minimal collapse maps at projective levels Torino September / 9
10 Cohen-style collapse Back Definition (Cohen-style collapse forcing) The forcing ω <ω 1 consists of all strings (finite sequences) of ordinals α < ω 1. The forcing ω 1 <ω naturally adjoins a map a : ω onto ω 1. Kanovei Lyubetsky Minimal collapse maps at projective levels Torino September / 9
11 Minimal cofinal map Back Definition (Minimal cofinal map forcing, Prikry + folclore) The forcing P consists of all trees T ω 1 <ω such that 1 every node of T has a branching node above it; 2 every branching node of T is an ω 1 -branching node. Kanovei Lyubetsky Minimal collapse maps at projective levels Torino September / 9
12 Minimal cofinal map Back Definition (Minimal cofinal map forcing, Prikry + folclore) The forcing P consists of all trees T ω 1 <ω such that 1 every node of T has a branching node above it; 2 every branching node of T is an ω 1 -branching node. The Laver-style version P Laver requires that in addition 3 any node of T above a branching node is branching itself. Kanovei Lyubetsky Minimal collapse maps at projective levels Torino September / 9
13 Minimal cofinal map Back Definition (Minimal cofinal map forcing, Prikry + folclore) The forcing P consists of all trees T ω 1 <ω such that 1 every node of T has a branching node above it; 2 every branching node of T is an ω 1 -branching node. The Laver-style version P Laver requires that in addition 3 any node of T above a branching node is branching itself. P Laver is more difficult to deal with. Kanovei Lyubetsky Minimal collapse maps at projective levels Torino September / 9
14 Minimal cofinal map Back Definition (Minimal cofinal map forcing, Prikry + folclore) The forcing P consists of all trees T ω 1 <ω such that 1 every node of T has a branching node above it; 2 every branching node of T is an ω 1 -branching node. The Laver-style version P Laver requires that in addition 3 any node of T above a branching node is branching itself. P Laver is more difficult to deal with. Both P and P Laver naturally adjoin a cofinal map a : ω ω1 V, but such a map a is not definable in V[a] since the forcing notions P and P Laver are too homogeneous. Kanovei Lyubetsky Minimal collapse maps at projective levels Torino September / 9
15 Uri Abraham cofinal map Back Kanovei Lyubetsky Minimal collapse maps at projective levels Torino September / 9
16 Uri Abraham cofinal map Back Definition (Uri Abraham forcing, in L) In L, the forcing U is a subset U = ξ<ω 2 U ξ P, such that 1 each U ξ P is a set of cardinality ℵ 1 ; 2 U adds a single generic map, so U is very non-homogeneous; 3 being U-generic is Π2 1. Kanovei Lyubetsky Minimal collapse maps at projective levels Torino September / 9
17 Uri Abraham cofinal map Back Definition (Uri Abraham forcing, in L) In L, the forcing U is a subset U = ξ<ω 2 U ξ P, such that 1 each U ξ P is a set of cardinality ℵ 1 ; 2 U adds a single generic map, so U is very non-homogeneous; 3 being U-generic is Π2 1. There is also a P Laver -version, actually used by Abraham. Kanovei Lyubetsky Minimal collapse maps at projective levels Torino September / 9
18 Uri Abraham cofinal map Back Definition (Uri Abraham forcing, in L) In L, the forcing U is a subset U = ξ<ω 2 U ξ P, such that 1 each U ξ P is a set of cardinality ℵ 1 ; 2 U adds a single generic map, so U is very non-homogeneous; 3 being U-generic is Π2 1. There is also a P Laver -version, actually used by Abraham. The forcing U adjoins a cofinal map a : ω ω 1 to L, and a is a Π 1 2 -singleton in the extension. Kanovei Lyubetsky Minimal collapse maps at projective levels Torino September / 9
19 Uri Abraham cofinal map Back Definition (Uri Abraham forcing, in L) In L, the forcing U is a subset U = ξ<ω 2 U ξ P, such that 1 each U ξ P is a set of cardinality ℵ 1 ; 2 U adds a single generic map, so U is very non-homogeneous; 3 being U-generic is Π2 1. There is also a P Laver -version, actually used by Abraham. The forcing U adjoins a cofinal map a : ω ω 1 to L, and a is a Π 1 2 -singleton in the extension. The single generic object construction goes back to Jensen 1970 minimal-π 1 2 -singleton forcing. Kanovei Lyubetsky Minimal collapse maps at projective levels Torino September / 9
20 Π 1 n -singleton cofinal map Back Kanovei Lyubetsky Minimal collapse maps at projective levels Torino September / 9
21 Π 1 n -singleton cofinal map Back Observation The Uri Abraham forcing U is essentially a 1 2 path through a certain POset P of sets U P of cardinality card U ℵ 1. Kanovei Lyubetsky Minimal collapse maps at projective levels Torino September / 9
22 Π 1 n -singleton cofinal map Back Observation The Uri Abraham forcing U is essentially a 1 2 path through a certain POset P of sets U P of cardinality card U ℵ 1. Definition (Π 1 n -singleton cofinal map forcing) Let n 3. In L, we define U n using a 1 n path through P, generic so it meets all dense subsets of P of boldface class Σ 1 n 1. Kanovei Lyubetsky Minimal collapse maps at projective levels Torino September / 9
23 Π 1 n -singleton cofinal map Back Observation The Uri Abraham forcing U is essentially a 1 2 path through a certain POset P of sets U P of cardinality card U ℵ 1. Definition (Π 1 n -singleton cofinal map forcing) Let n 3. In L, we define U n using a 1 n path through P, generic so it meets all dense subsets of P of boldface class Σ 1 n 1. The genericity condition makes the forcing properties of U n to be very close to those of the whole homogeneous forcing notion P up to the nth level of the projective hierarchy. Kanovei Lyubetsky Minimal collapse maps at projective levels Torino September / 9
24 Π 1 n -singleton cofinal map Back Observation The Uri Abraham forcing U is essentially a 1 2 path through a certain POset P of sets U P of cardinality card U ℵ 1. Definition (Π 1 n -singleton cofinal map forcing) Let n 3. In L, we define U n using a 1 n path through P, generic so it meets all dense subsets of P of boldface class Σ 1 n 1. The genericity condition makes the forcing properties of U n to be very close to those of the whole homogeneous forcing notion P up to the nth level of the projective hierarchy. In particular U n forces all lightface Σ 1 n reals to be constructible. Kanovei Lyubetsky Minimal collapse maps at projective levels Torino September / 9
25 A problem Back Problem In the context of the Namba forcing, define a generic extension L[a] of L by a cofinal map a : ω ω2 L, such that ω1 L is not collapsed and a is definable in L[a]. Kanovei Lyubetsky Minimal collapse maps at projective levels Torino September / 9
26 Acknowledgements Titlepage The speaker thanks the organizers for support Kanovei Lyubetsky Minimal collapse maps at projective levels Torino September / 9
27 Acknowledgements Titlepage The speaker thanks everybody for patience Kanovei Lyubetsky Minimal collapse maps at projective levels Torino September / 9
Successive cardinals with the tree property
UCLA March 3, 2014 A classical theorem Theorem (König Infinity Lemma) Every infinite finitely branching tree has an infinite path. Definitions A tree is set T together with an ordering < T which is wellfounded,
More informationITERATING ALONG A PRIKRY SEQUENCE
ITERATING ALONG A PRIKRY SEQUENCE SPENCER UNGER Abstract. In this paper we introduce a new method which combines Prikry forcing with an iteration between the Prikry points. Using our method we prove from
More informationA variant of Namba Forcing
A variant of Namba Forcing Moti Gitik School of Mathematical Sciences Raymond and Beverly Sackler Faculty of Exact Science Tel Aviv University Ramat Aviv 69978, Israel August 0, 009 Abstract Ronald Jensen
More informationFORCING WITH SEQUENCES OF MODELS OF TWO TYPES
FORCING WITH SEQUENCES OF MODELS OF TWO TYPES ITAY NEEMAN Abstract. We present an approach to forcing with finite sequences of models that uses models of two types. This approach builds on earlier work
More informationCardinal characteristics, projective wellorders and large continuum
Cardinal characteristics, projective wellorders and large continuum Vera Fischer a,1,, Sy David Friedman a,1, Lyubomyr Zdomskyy a,1 a Kurt Gödel Research Center, University of Vienna, Währinger Strasse
More informationThe choice of ω 1 and combinatorics at ℵ ω
The choice of ω 1 and combinatorics at ℵ ω Spencer Unger UCLA October 19, 2013 Outline Combinatorial properties Theorems using supercompactness Bringing results down to ℵ ω Some new theorems A sketch of
More informationIncreasing δ 1 2 and Namba-style forcing
Increasing δ 1 2 and Namba-style forcing Richard Ketchersid Miami University Jindřich Zapletal University of Florida April 17, 2007 Paul Larson Miami University Abstract We isolate a forcing which increases
More informationarxiv: v3 [math.lo] 31 Jan 2018
arxiv:1712.00769v3 [math.lo] 31 Jan 2018 Non-uniformizable sets with countable cross-sections on a given level of the projective hierarchy Vladimir Kanovei Vassily Lyubetsky February 1, 2018 Abstract We
More informationAnnals of Pure and Applied Logic
Annals of Pure and Applied Logic 161 (2010) 916 922 Contents lists available at ScienceDirect Annals of Pure and Applied Logic journal homepage: www.elsevier.com/locate/apal Cardinal characteristics and
More informationTrees and generic absoluteness
in ZFC University of California, Irvine Logic in Southern California University of California, Los Angeles November 6, 03 in ZFC Forcing and generic absoluteness Trees and branches The method of forcing
More informationTutorial 1.3: Combinatorial Set Theory. Jean A. Larson (University of Florida) ESSLLI in Ljubljana, Slovenia, August 4, 2011
Tutorial 1.3: Combinatorial Set Theory Jean A. Larson (University of Florida) ESSLLI in Ljubljana, Slovenia, August 4, 2011 I. Generalizing Ramsey s Theorem Our proof of Ramsey s Theorem for pairs was
More informationForcing Axioms and Inner Models of Set Theory
Forcing Axioms and Inner Models of Set Theory Boban Veličković Equipe de Logique Université de Paris 7 http://www.logique.jussieu.fr/ boban 15th Boise Extravaganza in Set Theory Boise State University,
More informationTHE STRONG TREE PROPERTY AND THE FAILURE OF SCH
THE STRONG TREE PROPERTY AND THE FAILURE OF SCH JIN DU Abstract. Fontanella [2] showed that if κ n : n < ω is an increasing sequence of supercompacts and ν = sup n κ n, then the strong tree property holds
More informationITERATIONS WITH MIXED SUPPORT
ITERATIONS WITH MIXED SUPPORT VERA FISCHER Abstract. In this talk we will consider three properties of iterations with mixed (finite/countable) supports: iterations of arbitrary length preserve ω 1, iterations
More informationSubversions of forcing classes
Subversions of forcing classes Gunter Fuchs July 19, 2018 1 st Girona conference on inner model theory CUNY College of Staten Island and the CUNY Graduate Center Proper and subproper forcing Proper forcing
More informationGREGORY TREES, THE CONTINUUM, AND MARTIN S AXIOM
The Journal of Symbolic Logic Volume 00, Number 0, XXX 0000 GREGORY TREES, THE CONTINUUM, AND MARTIN S AXIOM KENNETH KUNEN AND DILIP RAGHAVAN Abstract. We continue the investigation of Gregory trees and
More informationFRAGILITY AND INDESTRUCTIBILITY II
FRAGILITY AND INDESTRUCTIBILITY II SPENCER UNGER Abstract. In this paper we continue work from a previous paper on the fragility and indestructibility of the tree property. We present the following: (1)
More informationNon-trivial automorphisms from variants of small d
Non-trivial automorphisms from variants of small d Fields October 24, 2012 Notation If A and B are subsets of N let denote the equivalence relation defined by A B if and only if A B is finite. Let [A]
More informationA NEW LINDELOF SPACE WITH POINTS G δ
A NEW LINDELOF SPACE WITH POINTS G δ ALAN DOW Abstract. We prove that implies there is a zero-dimensional Hausdorff Lindelöf space of cardinality 2 ℵ1 which has points G δ. In addition, this space has
More informationTHE TREE PROPERTY AT ℵ ω+1 DIMA SINAPOVA
THE TREE PROPERTY AT ℵ ω+1 DIMA SINAPOVA Abstract. We show that given ω many supercompact cardinals, there is a generic extension in which there are no Aronszajn trees at ℵ ω+1. This is an improvement
More informationUNIVERSALLY BAIRE SETS AND GENERIC ABSOLUTENESS TREVOR M. WILSON
UNIVERSALLY BAIRE SETS AND GENERIC ABSOLUTENESS TREVOR M. WILSON Abstract. We prove several equivalences and relative consistency results involving notions of generic absoluteness beyond Woodin s ) (Σ
More informationProjective well-orderings of the reals and forcing axioms
Projective well-orderings of the reals and forcing axioms Andrés Eduardo Department of Mathematics Boise State University 2011 North American Annual Meeting UC Berkeley, March 24 27, 2011 This is joint
More informationPSEUDO P-POINTS AND SPLITTING NUMBER
PSEUDO P-POINTS AND SPLITTING NUMBER ALAN DOW AND SAHARON SHELAH Abstract. We construct a model in which the splitting number is large and every ultrafilter has a small subset with no pseudo-intersection.
More informationISOLATING CARDINAL INVARIANTS
Journal of Mathematical Logic, Vol. 3, No. 1 (2003) 143 162 c World Scientific Publishing Company & Singapore University Press ISOLATING CARDINAL INVARIANTS JINDŘICH ZAPLETAL Department of Mathematics,
More informationarxiv: v1 [math.lo] 8 May 2017
arxiv:1705.02975v1 [math.lo] 8 May 2017 Definable E 0 classes at arbitrary projective levels Vladimir Kanovei Vassily Lyubetsky October 16, 2018 Abstract Using a modification of the invariant Jensen forcing
More informationClub degrees of rigidity and almost Kurepa trees
Club degrees of rigidity and almost Kurepa trees Gunter Fuchs The College of Staten Island/CUNY August 25, 2012 Abstract A highly rigid Souslin tree T is constructed such that forcing with T turns T into
More informationMaharam Algebras. Equipe de Logique, Université de Paris 7, 2 Place Jussieu, Paris, France
Maharam Algebras Boban Veličković Equipe de Logique, Université de Paris 7, 2 Place Jussieu, 75251 Paris, France Abstract Maharam algebras are complete Boolean algebras carrying a positive continuous submeasure.
More informationINSEPARABLE SEQUENCES AND FORCING
Novi Sad J. Math. Vol. 43, No. 2, 2013, 185-189 INSEPARABLE SEQUENCES AND FORCING Boris Šobot 1 Abstract. An inseparable sequence is an almost disjoint family A ξ : ξ < ω 1 of subsets of ω such that for
More informationLarge Cardinals and Higher Degree Theory
Large Cardinals and Higher Degree Theory SHI Xianghui School of Mathematical Sciences Beijing Normal University May 2013, NJU 1 / 20 Dedicated to Professor DING DeCheng on his 70 th Birthday. 2 / 20 Higher
More informationInfinite Combinatorics, Definability, and Forcing
Infinite Combinatorics, Definability, and Forcing David Schrittesser University of Copenhagen (Denmark) RIMS Workshop on Infinite Combinatorics and Forcing Theory Schrittesser (Copenhagen) Combinatorics,
More informationAronszajn Trees and the SCH
Aronszajn Trees and the SCH Itay Neeman and Spencer Unger February 28, 2009 1 Introduction These notes are based on results presented by Itay Neeman at the Appalachian Set Theory workshop on February 28,
More informationSilver trees and Cohen reals
Silver trees and Cohen reals Otmar Spinas Abstract We prove that the meager ideal M is Tukey reducible to the Mycielski ideal J(Si) which is the ideal associated with Silver forcing Si. This implies add
More informationViolating the Singular Cardinals Hypothesis Without Large Cardinals
Violating the Singular Cardinals Hypothesis Without Large Cardinals Talk at the University of Bristol by Peter Koepke (Bonn), joint work with Moti Gitik (Jerusalem) November 29, 2010 Cantor s Continuum
More informationCANONICALIZATION BY ABSOLUTENESS
CANONICALIZATION BY ABSOLUTENESS WILLIAM CHAN Abstract. This note will give the argument of Neeman and Norwood to show Σ 1 1 (Π1 1 or 1 1 ) canonicalization of equivalence relation in L(R) with all Σ 1
More informationLuzin and Sierpiński sets meet trees
, based on joint work with R. Ra lowski & Sz. Żeberski Wroc law University of Science and Technology Winter School in Abstract Analysis 2018, section Set Theory and Topology 01.02.2018, Hejnice Definition
More informationA product of γ-sets which is not Menger.
A product of γ-sets which is not Menger. A. Miller Dec 2009 Theorem. Assume CH. Then there exists γ-sets A 0, A 1 2 ω such that A 0 A 1 is not Menger. We use perfect sets determined by Silver forcing (see
More informationTHE TREE PROPERTY AND THE FAILURE OF THE SINGULAR CARDINAL HYPOTHESIS AT ℵ ω 2
THE TREE PROPERTY AND THE FAILURE OF THE SINGULAR CARDINAL HYPOTHESIS AT ℵ ω 2 DIMA SINAPOVA Abstract. We show that given ω many supercompact cardinals, there is a generic extension in which the tree property
More informationNAMBA FORCING, WEAK APPROXIMATION, AND GUESSING
NAMBA FORCING, WEAK APPROXIMATION, AND GUESSING SEAN COX AND JOHN KRUEGER Abstract. We prove a variation of Easton s lemma for strongly proper forcings, and use it to prove that, unlike the stronger principle
More informationViolating the Singular Cardinals Hypothesis Without Large Cardinals
Violating the Singular Cardinals Hypothesis Without Large Cardinals CUNY Logic Workshop, November 18, 2011 by Peter Koepke (Bonn); joint work with Moti Gitik (Tel Aviv) Easton proved that the behavior
More informationSet Theory and Models of Arithmetic ALI ENAYAT. First European Set Theory Meeting
Set Theory and Models of Arithmetic ALI ENAYAT First European Set Theory Meeting Bedlewo, July 12, 2007 PA is finite set theory! There is an arithmetical formula E(x, y) that expresses the x-th digit of
More informationProjective measure without projective Baire
Projective measure without projective Baire David Schrittesser Westfälische Wilhems-Universität Münster 4th European Set Theory Conference Barcelona David Schrittesser (WWU Münster) Projective measure
More informationHomogeneous spaces and Wadge theory
Homogeneous spaces and Wadge theory Andrea Medini Kurt Gödel Research Center University of Vienna July 18, 2018 Everybody loves homogeneous stuff! Topological homogeneity A space is homogeneous if all
More informationCCC Forcing and Splitting Reals
CCC Forcing and Splitting Reals Boban Velickovic Equipe de Logique, Université de Paris 7 2 Place Jussieu, 75251 Paris, France Abstract Prikry asked if it is relatively consistent with the usual axioms
More informationTallness and Level by Level Equivalence and Inequivalence
Tallness and Level by Level Equivalence and Inequivalence Arthur W. Apter Department of Mathematics Baruch College of CUNY New York, New York 10010 USA and The CUNY Graduate Center, Mathematics 365 Fifth
More informationThe Proper Forcing Axiom: a tutorial
Young Set Theory Workshop 2010, Raach, Austria. The Proper Forcing Axiom: a tutorial Justin Tatch Moore 1 Notes taken by Giorgio Venturi In these notes we will present an exposition of the Proper Forcing
More informationA Basis Theorem for Perfect Sets
A Basis Theorem for Perfect Sets Marcia J. Groszek Theodore A. Slaman November 17, 2000 Abstract We show that if there is a nonconstructible real, then every perfect set has a nonconstructible element,
More informationBOUNDING, SPLITTING, AND ALMOST DISJOINTNESS
BOUNDING, SPLITTING, AND ALMOST DISJOINTNESS Abstract. We investigate some aspects of bounding, splitting, and almost disjointness. In particular, we investigate the relationship between the bounding number,
More informationJónsson posets and unary Jónsson algebras
Jónsson posets and unary Jónsson algebras Keith A. Kearnes and Greg Oman Abstract. We show that if P is an infinite poset whose proper order ideals have cardinality strictly less than P, and κ is a cardinal
More informationForcing Closed Unbounded Subsets of ω 2
Forcing Closed Unbounded Subsets of ω 2 M.C. Stanley July 2000 Abstract. It is shown that there is no satisfactory first-order characterization of those subsets of ω 2 that have closed unbounded subsets
More informationThe topology of ultrafilters as subspaces of 2 ω
Many non-homeomorphic ultrafilters Basic properties Overview of the results Andrea Medini 1 David Milovich 2 1 Department of Mathematics University of Wisconsin - Madison 2 Department of Engineering, Mathematics,
More informationPart II. Logic and Set Theory. Year
Part II Year 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2018 60 Paper 4, Section II 16G State and prove the ǫ-recursion Theorem. [You may assume the Principle of ǫ- Induction.]
More informationIndependence of Boolean algebras and forcing
Annals of Pure and Applied Logic 124 (2003) 179 191 www.elsevier.com/locate/apal Independence of Boolean algebras and forcing Milos S. Kurilic Department of Mathematics and Informatics, University of Novi
More informationDistributivity of Quotients of Countable Products of Boolean Algebras
Rend. Istit. Mat. Univ. Trieste Volume 41 (2009), 27 33. Distributivity of Quotients of Countable Products of Boolean Algebras Fernando Hernández-Hernández Abstract. We compute the distributivity numbers
More informationPartition Relation Perspectives. Jean A. Larson
Partition Relation Perspectives Jean A. Larson The Role of the Hiigher Infinite in Mathematics and Other Disciplines Newton Institute, Cambridge England, 12/15/15 Mirna s doctoral work In 1993, Mirna Dzamonja
More informationExtensions of the Axiom of Determinacy. Paul B. Larson
Extensions of the Axiom of Determinacy Paul B. Larson November 7, 2018 2 Contents 0.1 Introduction.............................. 5 0.2 Notation................................ 7 0.3 Prerequisites.............................
More informationUniversal graphs and functions on ω 1
Universal graphs and functions on ω 1 Saharon Shelah a,1, Juris Steprāns b,2 a Department of Mathematics, Rutgers University, Hill Center, Piscataway, New Jersey, U.S.A. 08854-8019 and Institute of Mathematics,
More informationInner models and ultrafilters in
Inner models and ultrafilters in L(R) Itay Neeman Department of Mathematics University of California Los Angeles Los Angeles, CA 90095-1555 ineeman@math.ucla.edu Part 3: 1. The finite intersection property.
More informationTowards a descriptive set theory for domain-like structures
Theoretical Computer Science 365 (2006) 258 282 www.elsevier.com/locate/tcs Towards a descriptive set theory for domain-like structures Victor L. Selivanov Siberian Division of the Russian Academy of Sciences,
More informationCanonical models for fragments of the Axiom of Choice
Canonical models for fragments of the Axiom of Choice Paul Larson Miami University Jindřich Zapletal University of Florida October 31, 2016 Abstract We develop technology for investigation of natural forcing
More informationChain Conditions of Horn and Tarski
Chain Conditions of Horn and Tarski Stevo Todorcevic Berkeley, April 2, 2014 Outline 1. Global Chain Conditions 2. The Countable Chain Condition 3. Chain Conditions of Knaster, Shanin and Szpilrajn 4.
More informationarxiv: v1 [math.lo] 10 Apr 2014
ADDING A RANDOM REAL NUMBER AND ITS EFFECT ON MARTIN S AXIOM JOAN BAGARIA AND SAHARON SHELAH arxiv:1404.2776v1 [math.lo] 10 Apr 2014 Abstract. We show that adding a random real number destroys a large
More informationINNER MODELS WITH LARGE CARDINAL FEATURES USUALLY OBTAINED BY FORCING
INNER MODELS WITH LARGE CARDINAL FEATURES USUALLY OBTAINED BY FORCING ARTHUR W. APTER, VICTORIA GITMAN, AND JOEL DAVID HAMKINS Abstract. We construct a variety of inner models exhibiting large cardinal
More informationTHE UNIVERSAL HOMOGENEOUS TRIANGLE-FREE GRAPH HAS FINITE RAMSEY DEGREES
THE UNIVERSAL HOMOGENEOUS TRIANGLE-FREE GRAPH HAS FINITE RAMSEY DEGREES NATASHA DOBRINEN Abstract. The universal homogeneous triangle-free graph H 3 has finite big Ramsey degrees : For each finite triangle-free
More informationCombinatorial dichotomies and cardinal invariants
Dilip Raghavan (Joint with Stevo Todorcevic) National University of Singapore ASL North American annual meeting, University of Waterloo May 9, 2013 Outline 1 The Project 2 3 4 Calibrating some consequences
More informationLusin sequences under CH and under Martin s Axiom
arxiv:math/9807178v1 [math.lo] 15 Jul 1998 Lusin sequences under CH and under Martin s Axiom Uri Abraham Department of Mathematics and Computer Science, Ben-Gurion University, Beér-Sheva, Israel Saharon
More informationNOTES FOR 197, SPRING 2018
NOTES FOR 197, SPRING 2018 We work in ZFDC, Zermelo-Frankel Theory with Dependent Choices, whose axioms are Zermelo s I - VII, the Replacement Axiom VIII and the axiom DC of dependent choices; when we
More informationA Sharp for the Chang Model
A Sharp for the Chang Model William Mitchell wjm@ufl.edu University of Florida February 19, 2011 Inner Model Theory & Large Cardinals A 50 Year Celebration Mitchell (University of Florida) A Sharp for
More informationVALUATION THEORY, GENERALIZED IFS ATTRACTORS AND FRACTALS
VALUATION THEORY, GENERALIZED IFS ATTRACTORS AND FRACTALS JAN DOBROWOLSKI AND FRANZ-VIKTOR KUHLMANN Abstract. Using valuation rings and valued fields as examples, we discuss in which ways the notions of
More informationOn The Model Of Hyperrational Numbers With Selective Ultrafilter
MSC 03H05 On The Model Of Hyperrational Numbers With Selective Ultrafilter A. Grigoryants Moscow State University Yerevan Branch February 27, 2019 Abstract In standard construction of hyperrational numbers
More informationWHY Y-C.C. DAVID CHODOUNSKÝ AND JINDŘICH ZAPLETAL
WHY Y-C.C. DAVID CHODOUNSKÝ AND JINDŘICH ZAPLETAL Abstract. We outline a portfolio of novel iterable properties of c.c.c. and proper forcing notions and study its most important instantiations, Y-c.c.
More informationP-FILTERS AND COHEN, RANDOM, AND LAVER FORCING
P-FILTERS AND COHEN, RANDOM, AND LAVER FORCING ALAN DOW Abstract. We answer questions about P-filters in the Cohen, random, and Laver forcing extensions of models of CH. In the case of the ℵ 2 -random
More informationDENSELY k-separable COMPACTA ARE DENSELY SEPARABLE
DENSELY k-separable COMPACTA ARE DENSELY SEPARABLE ALAN DOW AND ISTVÁN JUHÁSZ Abstract. A space has σ-compact tightness if the closures of σ-compact subsets determines the topology. We consider a dense
More informationFORCING AXIOMS AND THE CONTINUUM HYPOTHESIS, PART II: TRANSCENDING ω 1 -SEQUENCES OF REAL NUMBERS
FORCING AXIOMS AND THE CONTINUUM HYPOTHESIS, PART II: TRANSCENDING ω 1 -SEQUENCES OF REAL NUMBERS JUSTIN TATCH MOORE Abstract. The purpose of this article is to prove that the forcing axiom for completely
More informationA DIRECT PROOF OF THE FIVE ELEMENT BASIS THEOREM
A DIRECT PROOF OF THE FIVE ELEMENT BASIS THEOREM BOBAN VELIČKOVIĆ AND GIORGIO VENTURI Abstract. We present a direct proof of the consistency of the existence of a five element basis for the uncountable
More informationSouslin s Hypothesis
Michiel Jespers Souslin s Hypothesis Bachelor thesis, August 15, 2013 Supervisor: dr. K.P. Hart Mathematical Institute, Leiden University Contents 1 Introduction 1 2 Trees 2 3 The -Principle 7 4 Martin
More informationSection 7.5: Cardinality
Section 7: Cardinality In this section, we shall consider extend some of the ideas we have developed to infinite sets One interesting consequence of this discussion is that we shall see there are as many
More informationOn Subcomplete Forcing
City University of New York (CUNY) CUNY Academic Works Dissertations, Theses, and Capstone Projects Graduate Center 6-2017 On Subcomplete Forcing Kaethe B. Minden The Graduate Center, City University of
More informationLindelöf indestructibility, topological games and selection principles
Lindelöf indestructibility, topological games and selection principles Marion Scheepers and Franklin D. Tall April 8, 2010 Abstract Arhangel skii proved that if a first countable Hausdorff space is Lindelöf,
More informationINTRODUCTION TO CARDINAL NUMBERS
INTRODUCTION TO CARDINAL NUMBERS TOM CUCHTA 1. Introduction This paper was written as a final project for the 2013 Summer Session of Mathematical Logic 1 at Missouri S&T. We intend to present a short discussion
More information20 Ordinals. Definition A set α is an ordinal iff: (i) α is transitive; and. (ii) α is linearly ordered by. Example 20.2.
20 Definition 20.1. A set α is an ordinal iff: (i) α is transitive; and (ii) α is linearly ordered by. Example 20.2. (a) Each natural number n is an ordinal. (b) ω is an ordinal. (a) ω {ω} is an ordinal.
More informationCARDINAL RESTRICTIONS ON SOME HOMOGENEOUS COMPACTA. István Juhász*, Peter Nyikos**, and Zoltán Szentmiklóssy*
CARDINAL RESTRICTIONS ON SOME HOMOGENEOUS COMPACTA István Juhász*, Peter Nyikos**, and Zoltán Szentmiklóssy* Abstract. We give restrictions on the cardinality of compact Hausdorff homogeneous spaces that
More informationBeyond the Axiom of Completeness
Peter Fekete Beyond the Axiom of Completeness Supplement to On the Continuum exploring alternative structures to the continuum other than that provided by the Axiom of Completeness. Peter Fekete, February
More informationClasses of Polish spaces under effective Borel isomorphism
Classes of Polish spaces under effective Borel isomorphism Vassilis Gregoriades TU Darmstadt October 203, Vienna The motivation It is essential for the development of effective descriptive set theory to
More informationAPPLICATIONS OF ANOTHER CHARACTERIZATION OF βn \ N
APPLICATIONS OF ANOTHER CHARACTERIZATION OF βn \ N ALAN DOW AND KLAAS PIETER HART Abstract. Steprāns provided a characterization of βn \ N in the ℵ 2 -Cohen model that is much in the spirit of Parovičenko
More informationOn the cofinality of infinite partially ordered sets: factoring a poset into lean essential subsets
1 On the cofinality of infinite partially ordered sets: factoring a poset into lean essential subsets Reinhard Diestel Oleg Pikhurko 8 February 2003 Keywords: infinite posets, cofinality, poset decomposition
More informationVon Neumann s Problem
Von Neumann s Problem Boban Velickovic Equipe de Logique, Université de Paris 7 2 Place Jussieu, 75251 Paris, France Abstract A well known problem of Von Neumann asks if every ccc weakly distributive complete
More informationHYBRID PRIKRY FORCING
HYBRID PRIKRY FORCING DIMA SINAPOVA Abstract. We present a new forcing notion combining diagonal supercompact Prikry focing with interleaved extender based forcing. We start with a supercompact cardinal
More informationEFIMOV S PROBLEM AND BOOLEAN ALGEBRAS
EFIMOV S PROBLEM AND BOOLEAN ALGEBRAS ALAN DOW AND ROBERTO PICHARDO-MENDOZA Abstract. We continue the study, started by P. Koszmider, of a class of Boolean algebras, the so called T -algebras. We prove
More informationLusin sequences under CH and under Martin s Axiom
F U N D A M E N T A MATHEMATICAE 169 (2001) Lusin sequences under CH and under Martin s Axiom by Uri Abraham (Beer-Sheva) and Saharon Shelah (Jerusalem) Abstract. Assuming the continuum hypothesis there
More informationOn the open-open game
F U N D A M E N T A MATHEMATICAE 145 (1994) On the open-open game by Peg D a n i e l s (Auburn, Ala.), Kenneth K u n e n (Madison, Wisc.) and Haoxuan Z h o u (San Antonio, Tex.) Abstract. We modify a game
More informationThe axiom of choice and two-point sets in the plane
A.Miller AC and 2-point sets The axiom of choice and two-point sets in the plane Abstract Arnold W. Miller In this paper we prove that it consistent to have a two-point set in a model of ZF in which the
More informationTemplate iterations with non-definable ccc forcing notions
Template iterations with non-definable ccc forcing notions Diego Alejandro Mejía Graduate School of System Informatics, Kobe University, Kobe, Japan. damejiag@kurt.scitec.kobe-u.ac.jp arxiv:1305.4740v4
More informationTHE NEXT BEST THING TO A P-POINT
THE NEXT BEST THING TO A P-POINT ANDREAS BLASS, NATASHA DOBRINEN, AND DILIP RAGHAVAN Abstract. We study ultrafilters on ω 2 produced by forcing with the quotient of P(ω 2 ) by the Fubini square of the
More informationBanach-Mazur game played in partially ordered sets
Banach-Mazur game played in partially ordered sets arxiv:1505.01094v1 [math.lo] 5 May 2015 Wies law Kubiś Department of Mathematics Jan Kochanowski University in Kielce, Poland and Institute of Mathematics,
More informationA Sharp for the Chang Model
A Sharp for the Chang Model William Mitchell wjm@ufl.edu University of Florida February 19, 2011 Inner Model Theory & Large Cardinals A 50 Year Celebration Mitchell (University of Florida) A Sharp for
More informationMAD FAMILIES AND THEIR NEIGHBORS
MAD FAMILIES AND THEIR NEIGHBORS ANDREAS BLASS, TAPANI HYTTINEN, AND YI ZHANG Abstract. We study several sorts of maximal almost disjoint families, both on a countable set and on uncountable, regular cardinals.
More informationarxiv:math/ v1 [math.lo] 4 May 2006
KUREPA-TREES AND NAMBA FORCING arxiv:math/0605130v1 [math.lo] 4 May 2006 BERNHARD KÖNIG AND YASUO YOSHINOBU Abstract. We show that compact cardinals and MM are sensitive to λ-closed forcings for arbitrarily
More informationCantor s Letter to Dedekind
Cantor s Letter to Dedekind (Halle, 28 July 1899) Áron Dombrovszki October 24, 2017 Introducion in the first part of his letter, Cantor deals with the same contradiction as Burali-Forti about the multiplicity
More informationCOVERING MATRICES, SQUARES, SCALES, AND STATIONARY REFLECTION
COVERING MATRICES, SQUARES, SCALES, AND STATIONARY REFLECTION A thesis presented for the degree of Doctor of Philosophy Chris Lambie-Hanson Department of Mathematical Sciences Carnegie Mellon University
More informationSOME REMARKS ON NON-SPECIAL COHERENT ARONSZAJN TREES
SOME REMARKS ON NON-SPECIAL COHERENT ARONSZAJN TREES MICHAEL HRUŠÁK AND CARLOS MARTÍNEZ RANERO Abstract. We introduce some guessing principles sufficient for the existence of non-special coherent Aronszajn
More information