Successive cardinals with the tree property
|
|
- Augusta Cain
- 6 years ago
- Views:
Transcription
1 UCLA March 3, 2014
2 A classical theorem Theorem (König Infinity Lemma) Every infinite finitely branching tree has an infinite path.
3 Definitions A tree is set T together with an ordering < T which is wellfounded, transitive, irreflexive and such that for all t T the set {x T x < T t} is linearly ordered by < T. The height of an element t is the order-type of the collection of the predecessors of t under < T. That is, the unique ordinal α such that (α, ) ({x T x < T t}, < T ). The α th level of the tree is the collection of nodes of height α. The height of a tree T is the least ordinal β such that there are no nodes of height β. A set b is a cofinal branch through T if b T and (b, < T ) is a linear order whose order-type is the height of the tree.
4 The tree property Theorem (König Infinity Lemma) Every tree of height ω with finite levels has a cofinal branch Let κ be a regular cardinal. Definition A κ-tree is a tree of height κ with levels of size less than κ. Definition A cardinal κ has the tree property if every κ-tree has a cofinal branch. A counterexample to the tree property at κ is called a κ-aronszajn tree.
5 When do Aronszajn trees exist? Theorem (Aronszajn) There is a tree of height ω 1 all of whose levels are countable, which has no cofinal branch. Theorem (Specker) If κ <κ = κ, then there is a κ + -Aronszajn tree. In particular CH implies that there is an ω 2 -Aronszajn tree. Remark The tree constructed is special in the sense that there is a function from T to κ such that f (s) f (t) whenever s < T t.
6 The tree property and large cardinals Definition A uncountable cardinal κ is inaccessible if it is a regular limit cardinal and for all µ < κ, 2 µ < κ. Definition A cardinal κ is weakly compact if κ is uncountable and for all f : [κ] 2 2, there is H κ of size κ such that f is constant on [H] 2. Theorem (Tarski and Keisler) κ is weakly compact if and only if it is inaccessible and has the tree property.
7 What about the tree property at non-inaccessible cardinals? Theorem (Mitchell) The theory ZFC + there is a weakly compact cardinal is consistent if and only if the theory ZFC + ω 2 has the tree property is consistent.
8 Measurable Cardinals Definition A cardinal κ is measurable if there is a transitive class N and an elementary embedding j : V N with critical point κ. Fact κ is measurable implies κ has the tree property. Proof. Let T be a κ-tree and assume that the underlying set of T is κ. Let j witness that κ is measurable. j(t ) is a tree of height j(κ) and j(t ) κ = T. In N choose a point on level κ of j(t ). This point determines a branch through T.
9 Mitchell s Forcing Let λ be a measurable cardinal. We define a poset M as follows: Conditions are pairs (p, f ) such that p P = Add(ω, λ) f is a countable partial function with dom(f ) λ, for all α dom(f ), f (α) is a P α-name for an element of Add(ω 1, 1) V [P α] We set (p 1, f 1 ) (p 2, f 2 ) if and only if p 1 p 2, dom(f 1 ) dom(f 2 ) and for all α dom(f 2 ), p 1 α f 1 (α) f 2 (α).
10 Properties of Mitchell s forcing M is λ-cc M adds a generic for P and P α Add(ω 1, 1) V [P α] for many α. In particular in an extension by M, 2 ω = λ = ω 2. {(p, f ) M p = } ordered as a suborder of M is countably closed. Call this forcing Q. The forcing P Q induces a generic for M in a natural way. In an extension by M α the forcing M/M α is equivalent to a forcing M defined in a similar fashion to M. In particular there are P and Q analogs of P and Q such that P Q generates a generic for M. P is simply a quotient of P over its initial segment.
11 Mitchell continued Claim ω 2 has the tree property in V [M]. Proof. Let j : V M witness that λ is measurable in V. Let T V [M] be an ω 2 Aronszajn tree. Lift the elementary embedding to j : V [M] M[j(M)]. By reflection properties of j, there is an inaccessible α < κ such that T α V [M α] and V [M α] T α is an ω 2 Aronszajn tree. To obtain a contradiction it is enough to show that forcing with Q P over V [M α] cannot add a branch through T α. This follows from standard facts about forcings which do not add branches.
12 Questions Question Is it consistent that all regular cardinals greater than ℵ 1 have the tree property? This question is very hard. So in pursuit of a positive answer we ask: Question What is the largest initial segment of regular cardinals which can have the tree property?
13 Theorem (Abraham) If there is a supercompact cardinal with a weakly compact cardinal above it, then there is a forcing extension in which ℵ 2 and ℵ 3 have the tree property simultaneously. Theorem (Cummings and Foreman) If there are infinitely many supercompact cardinals, then there is a forcing extension in which simultaneously for all n 2, ℵ n has the tree property. Theorem (Neeman) If there are infinitely many supercompact cardinals then there is a forcing extension in which all regular cardinals in the interval [ℵ 2, ℵ ω+1 ] have the tree property.
14 A few notes on the proofs The proofs all have a similar flavor and are quite technical. The original models of Abraham, and Cummings and Foreman are built in a iterative fashion. First establish the tree property at ℵ 2, then at ℵ 3 etc. The key point is to establish the tree property in an indestructible way. There are two main types of indestructibility required.
15 Directed closed forcing The main tool for this is iteration with a prediction mechanism. Theorem (Laver) Assuming there is a supercompact cardinal κ, there is a forcing extension in which the supercompactness of κ is indestructible under κ-directed closed forcing. Going back to Mitchell s construction it is relatively straightforward to fold in this kind of iteration with prediction. Theorem Assuming there is a supercompact cardinal, there is a forcing extension in which ℵ 2 has the tree property and the tree property is indestructible under ℵ 2 -directed closed forcing. We cannot apply this theorem directly in the proof of say Abraham s theorem, but it captures one of the main ideas of the proof.
16 A recipe for indestructibility Let κ be supercompact and F be a Laver function for κ. Let P be a poset such that there are posets P α for α < κ such that in a given ultrapower P is the class of α P α and there are projections π α : P P α. Let G be P generic. In V [G] define a diagonal Easton support iteration as follows. The definition is by induction on α < κ. Suppose we have defined U α for some α. We allow α into the domain of conditions when Pα U α F (α) is α-directed closed. In this case we allow our partial functions to return P α U α-names for elements of F (α).
17 Recipe continued The ordering is given by u u if and only if dom(u) dom(u ) and there is p G such that for all α dom(u ), (π α (p), u α) u(α) u (α). Remark To obtain a model where the tree property at ℵ 2 is indestructible under ℵ 2 -directed closed forcing, we use this construction with M in place of P and M α in place of P α.
18 More indestructibility Also important in the Abraham, and Cummings and Foreman results are the ideas need to prove the following theorem: Theorem The tree property at ℵ 2 in Mitchell s model is indestructible under adding an arbitrary number of Cohen subsets of ω 1 with a poset from the ground model. The proof of this fact goes by repeating the proof of Mitchell s theorem in the presence of this extra forcing.
19 Preservation lemmas The method of proof requires us to force further to see that we get branches through all trees. We then argue that this further forcing could not have added these branches. Lemma (Silver) If R is χ + -closed and 2 χ η, then forcing with R cannot add a branch through an η-tree. Lemma (U) If P is χ + -cc, R is χ + -closed and 2 χ η, then forcing with R over V P cannot add a cofinal branch through an η-tree.
20 Preservation Lemmas continued Lemma (Kunen and Tall) If P is τ-knaster, then P cannot add a branch through a branchless tree of height τ. Lemma (U) Suppose that P P is τ-cc. Forcing with P cannot add a cofinal branch through a tree of height τ.
21 How do you add ℵ ω+1? The original proof of the consistency of the tree property at ℵ ω+1 is due to Magidor and Shelah and it uses a little more than a huge cardinal. This upperbound was improved by Sinapova to only ω supercompact cardinals using a Prikry forcing construction. Neeman was able to obtain the same result as Sinapova, but only using a product of Levy Collapses. The key point in all of these theorems is the selection of the cardinal that will become ω 1. Neeman s theorem getting the consistency of the tree property at every regular cardinal in the interval [ℵ 2, ℵ ω+1 ] proceeds by trying to combine ideas from the Cummings and Foreman constrution with ideas from the proof with the product of Levy Collapses. Ideas of indestructibility play a role in the proof, but their presence is less obvious because the forcing has become more complex.
22 Scales Scales are a notion from Shelah s PCF theory. The general setting is a singular cardinal ν with an increasing and cofinal sequence ν i i < cf(ν) of regular cardinals less than ν. Given members f, g i ν i we say that f < g if and only if there is a j < cf(ν) such that for all i j, f (i) < g(i). A sequence of functions f α α < ν + is a scale of length ν + in i ν i if it is increasing and cofinal in i ν i under the ordering <. A point γ < ν + with cf(γ) > cf(ν) is good for a scale f of length ν + if there are A γ cofinal and j < cf(ν) such that for all i j the sequence f α (i) α A is strictly increasing.
23 Scales continued A scale f is good if there is a club C ν + such that all γ in C of cofinality greater than cf(ν) are good for f. A scale f is bad if it is not good. We say there is a bad scale of length ν + if there is a bad scale of length ν + in some product ν i. Relating scales with other principles we have: Theorem (Shelah) For a singular ν, ν implies ν + I [ν + ] implies All scales of length ν + are good. Moreover we have Theorem (Jensen) There is a special ν + -Aronszajn tree if and only if ν holds.
24 Theorems from supercompactness It turns out that all of the weak square principles above fail in the presence of supercompactness. Theorem Let κ be a supercompact cardinal and ν > κ be singular with cf(ν) < κ, every scale of length ν + is bad. Let f α α < ν + be a scale in the product i ν i. Let j : V M witness that κ is ν + -supercompact. In particular crit(j) = κ and ν+ M M.
25 A proof continued Let γ = sup j ν + and note that γ < j(ν + ). It is not hard to show that the function, i sup j ν i is a so called exact upper bound for j(f ) α α < γ. It follows that γ is bad for j( f ). Standard reflection arguments show that there is a stationary set S ν + of bad points for f. Moreover S concentrates on cofinalities µ + where µ is a singular cardinal of cofinality cf(ν).
26 Bringing results down to ℵ ω Theorem Assuming there is a supercompact cardinal it is relatively consistent that there is a bad scale of length ℵ ω+1, in particular ℵ ω fails. Ideas of the proof: Fix a scale of length κ +ω+1 in the product κ +n. By our previous argument the scale has stationarily many bad points of some cofinality µ + < κ. Force with Coll(ω, µ) Coll(µ ++, < κ). Show that the scale is still a scale. Show that the stationary set of bad points is preserved. Show that it is still a set of bad points, but now concentrating on cofinality ω 1.
27 A parting theorem Let κ n n < ω be an increasing sequence of supercompact cardinals and let R be the Cummings-Foreman iteration for getting the tree property at each ℵ n. Theorem (U) There are a µ < κ 0 and a generic object d G for Coll(ω, µ) (R) V [Coll(ω,µ)] such that in V [d G], there are a bad scale of length ℵ ω+1 and a non-reflecting stationary subset of ℵ ω+1.
The 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 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 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 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 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 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 informationA NOTE ON THE EIGHTFOLD WAY
A NOTE ON THE EIGHTFOLD WAY THOMAS GILTON AND JOHN KRUEGER Abstract. Assuming the existence of a Mahlo cardinal, we construct a model in which there exists an ω 2 -Aronszajn tree, the ω 1 -approachability
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 informationSingular Failures of GCH and Level by Level Equivalence
Singular Failures of GCH and Level by Level Equivalence 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 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 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 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 informationDiamond, non-saturation, and weak square principles
Diamond, non-saturation, and weak square principles Logic Colloquium 2009 (European ASL summer meeting) 02-Aug-09, Sofia Assaf Rinot Tel-Aviv University http://www.tau.ac.il/ rinot 1 Diamond on successor
More informationVARIATIONS FOR SEPARATING CLUB GUESSING PRINCIPLES
P max VARIATIONS FOR SEPARATING CLUB GUESSING PRINCIPLES TETSUYA ISHIU AND PAUL B. LARSON Abstract. In his book on P max [6], Woodin presents a collection of partial orders whose extensions satisfy strong
More informationTHE FAILURE OF DIAMOND ON A REFLECTING STATIONARY SET
THE FAILURE OF DIAMOND ON A REFLECTING STATIONARY SET MOTI GITIK AND ASSAF RINOT Abstract. 1. It is shown that the failure of S, for a set S ℵ ω+1 that reflects stationarily often, is consistent with GCH
More informationCOLLAPSING FUNCTIONS
COLLAPSING FUNCTIONS ERNEST SCHIMMERLING AND BOBAN VELICKOVIC Abstract. We define what it means for a function on ω 1 to be a collapsing function for λ and show that if there exists a collapsing function
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 informationDiamond on successors of singulars
Diamond on successors of singulars ESI workshop on large cardinals and descriptive set theory 18-Jun-09, Vienna Assaf Rinot Tel-Aviv University http://www.tau.ac.il/ rinot 1 Diamond on successor cardinals
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 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 Ultrapower Axiom implies GCH above a supercompact cardinal
The Ultrapower Axiom implies GCH above a supercompact cardinal arxiv:1810.05036v1 [math.lo] 9 Oct 2018 Gabriel Goldberg October 12, 2018 Abstract We prove that the Generalized Continuum Hypothesis holds
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 information1. Introduction Definition 1.1. For an L ω1,ω-sentence φ, the spectrum of φ is the set
KUREPA TREES AND SPECTRA OF L ω1,ω-sentences DIMA SINAPOVA AND IOANNIS SOULDATOS Abstract. We construct a single L ω1,ω-sentence ψ that codes Kurepa trees to prove the consistency of the following: (1)
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 informationScales, topological reflections, and large cardinal issues by Peter Nyikos
Scales, topological reflections, and large cardinal issues by Peter Nyikos Reflection theorems in set-theoretic topology typically take the following form: if all small subspaces of a suitable kind of
More informationInner models from extended logics
1 / 43 Inner models from extended logics Joint work with Juliette Kennedy and Menachem Magidor Department of Mathematics and Statistics, University of Helsinki ILLC, University of Amsterdam January 2017
More informationSINGULAR COFINALITY CONJECTURE AND A QUESTION OF GORELIC. 1. introduction
SINGULAR COFINALITY CONJECTURE AND A QUESTION OF GORELIC MOHAMMAD GOLSHANI Abstract. We give an affirmative answer to a question of Gorelic [5], by showing it is consistent, relative to the existence of
More informationMARTIN S MAXIMUM AND DEFINABILITY IN H(ℵ 2 ) Keywords: Forcing Axioms; Definability; Large Cardinals. 1. Introduction
MARTIN S MAXIMUM AND DEFINABILITY IN H(ℵ 2 ) PAUL B. LARSON Abstract. In [6], we modified a coding device from [14] and the consistency proof of Martin s Maximum from [3] to show that from a supercompact
More informationStatue of Aristotle at the Aristotle University of Thessaloniki, Greece
Statue of Aristotle at the Aristotle University of Thessaloniki, Greece Is the amalgamation property for L ω1,ω-sentences absolute for transitive models of ZFC? Logic Seminar - UIC 2018 02 01 Ioannis (Yiannis)
More informationTHE PRECIPITOUSNESS OF TAIL CLUB GUESSING IDEALS
THE PRECIPITOUSNESS OF TAIL CLUB GUESSING IDEALS TETSUYA ISHIU Abstract. From a measurable cardinal, we build a model in which the nonstationary ideal on ω 1 is not precipitous, but there is a precipitous
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 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 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 informationIDEAL PROJECTIONS AND FORCING PROJECTIONS
DEAL PROJECTONS AND FORCNG PROJECTONS SEAN COX AND MARTN ZEMAN Abstract. t is well known that saturation of ideals is closely related to the antichain-catching phenomenon from Foreman-Magidor-Shelah [10].
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 informationThe Seed Order. Gabriel Goldberg. October 8, 2018
The Seed Order arxiv:1706.00831v1 [math.lo] 2 Jun 2017 1 Introduction Gabriel Goldberg October 8, 2018 This paper is an exposition of the basic theory of the seed order, serving as a companion paper to
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 informationGeneric Absoluteness. Joan Bagaria and Sy D. Friedman. Abstract. However, this is not true for 1 3 predicates. Indeed, if we add a Cohen real
Generic Absoluteness Joan Bagaria and Sy D. Friedman Abstract We explore the consistency strength of 3 and 4 absoluteness, for a variety of forcing notions. Introduction Shoeneld's absoluteness theorem
More informationEQUICONSISTENCIES AT SUBCOMPACT CARDINALS
EQUICONSISTENCIES AT SUBCOMPACT CARDINALS ITAY NEEMAN AND JOHN STEEL Abstract. We present equiconsistency results at the level of subcompact cardinals. Assuming SBH δ, a special case of the Strategic Branches
More informationPFA AND IDEALS ON ω 2 WHOSE ASSOCIATED FORCINGS ARE PROPER
PFA AND IDEALS ON ω 2 WHOSE ASSOCIATED FORCINGS ARE PROPER SEAN COX Abstract. Given an ideal I, let P I denote the forcing with I- positive sets. We consider models of forcing axioms M A(Γ) which also
More informationORGANIC AND TIGHT J. CUMMINGS, M. FOREMAN, AND E. SCHIMMERLING
ORGANIC AND TIGHT J. CUMMINGS, M. FOREMAN, AND E. SCHIMMERLING 1. Introduction This report is motivated by the combinatorics of ℵ ω in L where there are canonical examples of scales, square sequences other
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 informationCLUB GUESSING SEQUENCES NATURAL STRUCTURES IN SET THEORY
Unspecified Journal Volume 00, Number 0, Pages 000 000 S????-????(XX)0000-0 CLUB GUESSING SEQUENCES NATURAL STRUCTURES IN SET THEORY TETSUYA ISHIU Abstract. Natural structures in set theory played key
More informationFréchet cardinals. Gabriel Goldberg. October 12, 2018
Fréchet cardinals Gabriel Goldberg arxiv:1810.05035v1 [math.lo] 9 Oct 2018 October 12, 2018 Abstract An infinite cardinal λ is called Fréchet if the Fréchet filter on λ extends to a countably complete
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 informationMinimal collapse maps at arbitrary projective level
Minimal collapse maps at arbitrary projective level Vladimir Kanovei 1 Vassily Lyubetsky 2 1 IITP RAS and MIIT, Moscow. Supported by RFBR grant 17-01-00757 2 IITP RAS, Moscow. Support of RSF grant 14-50-00150
More informationSix lectures on the stationary tower
Six lectures on the stationary tower Paul B. Larson November 19, 2012 1 The stationary tower 1.1 Definition. Let X be a nonempty set. A set c P(X) is club in P(X) if there is a function f : X
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 informationCOUNTEREXAMPLES TO THE UNIQUE AND COFINAL BRANCHES HYPOTHESES
COUNTEREXAMPLES TO THE UNIQUE AND COFINAL BRANCHES HYPOTHESES ITAY NEEMAN AND JOHN STEEL Abstract. We produce counterexamples to the unique and cofinal branches hypotheses, assuming (slightly less than)
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 informationTopology Proceedings. COPYRIGHT c by Topology Proceedings. All rights reserved.
Topology Proceedings Web: http://topology.auburn.edu/tp/ Mail: Topology Proceedings Department of Mathematics & Statistics Auburn University, Alabama 36849, USA E-mail: topolog@auburn.edu ISSN: 0146-4124
More informationThe Vaught Conjecture Do uncountable models count?
The Vaught Conjecture Do uncountable models count? John T. Baldwin Department of Mathematics, Statistics and Computer Science University of Illinois at Chicago May 22, 2005 1 Is the Vaught Conjecture model
More informationPROPER FORCING REMASTERED
PROPER FORCING REMASTERED BOBAN VELIČKOVIĆ AND GIORGIO VENTURI Abstract. We present the method introduced by Neeman of generalized side conditions with two types of models. We then discuss some applications:
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 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 informationCardinal invariants above the continuum
arxiv:math/9509228v1 [math.lo] 15 Sep 1995 Cardinal invariants above the continuum James Cummings Hebrew University of Jerusalem cummings@math.huji.ac.il Saharon Shelah Hebrew University of Jerusalem shelah@math.huji.ac.il
More informationDenition 2: o() is the height of the well-founded relation. Notice that we must have o() (2 ) +. Much is known about the possible behaviours of. For e
Possible behaviours for the Mitchell ordering James Cummings Math and CS Department Dartmouth College Hanover NH 03755 January 23, 1998 Abstract We use a mixture of forcing and inner models techniques
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 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 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 informationForcing notions in inner models
Forcing notions in inner models David Asperó Abstract There is a partial order P preserving stationary subsets of! 1 and forcing that every partial order in the ground model V that collapses asu ciently
More informationM ath. Res. Lett. 15 (2008), no. 00, NN c International Press 2008 A UNIVERSAL ARONSZAJN LINE. Justin Tatch Moore. 1.
M ath. Res. Lett. 15 (2008), no. 00, 10001 100NN c International Press 2008 A UNIVERSAL ARONSZAJN LINE Justin Tatch Moore Abstract. The purpose of this note is to define an Aronszajn line η C and prove
More informationSEPARATING CLUB GUESSING PRINCIPLES IN THE PRESENCE OF FAT FORCING AXIOMS
SEPARATING CLUB GUESSING PRINCIPLES IN THE PRESENCE OF FAT FORCING AXIOMS DAVID ASPERÓ AND MIGUEL ANGEL MOTA Abstract. We separate various weak forms of Club Guessing at ω 1 in the presence of 2 ℵ0 large,
More informationHandbook of Set Theory. Foreman, Kanamori, and Magidor (eds.)
Handbook of Set Theory Foreman, Kanamori, and Magidor (eds.) August 5, 2006 2 Contents I Forcing over models of determinacy 5 by Paul B. Larson 1 Iterations............................... 7 2 P max.................................
More informationKNASTER AND FRIENDS I: CLOSED COLORINGS AND PRECALIBERS
KNASTER AND FRIENDS I: CLOSED COLORINGS AND PRECALIBERS CHRIS LAMBIE-HANSON AND ASSAF RINOT Abstract. The productivity of the κ-chain condition, where κ is a regular, uncountable cardinal, has been the
More informationSOME COMBINATORIAL PRINCIPLES DEFINED IN TERMS OF ELEMENTARY SUBMODELS. 1. Introduction
SOME COMBINATORIAL PRINCIPLES DEFINED IN TERMS OF ELEMENTARY SUBMODELS SAKAÉ FUCHINO AND STEFAN GESCHKE Abstract. We give an equivalent, but simpler formulation of the axiom SEP, which was introduced in
More informationBOUNDING THE CONSISTENCY STRENGTH OF A FIVE ELEMENT LINEAR BASIS
BOUNDING THE CONSISTENCY STRENGTH OF A FIVE ELEMENT LINEAR BASIS BERNHARD KÖNIG, PAUL LARSON, JUSTIN TATCH MOORE, AND BOBAN VELIČKOVIĆ Abstract. In [13] it was demonstrated that the Proper Forcing Axiom
More informationUltrafilters and Set Theory. Andreas Blass University of Michigan Ann Arbor, MI
Ultrafilters and Set Theory Andreas Blass University of Michigan Ann Arbor, MI 48109 ablass@umich.edu Ultrafilters and Set Theory Ultrafilters and Set Theory But not large cardinals (Itay Neeman) Ultrafilters
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 informationORGANIC AND TIGHT J. CUMMINGS, M. FOREMAN, AND E. SCHIMMERLING
ORGANIC AND TIGHT J. CUMMINGS, M. FOREMAN, AND E. SCHIMMERLING 1. Introduction This paper is motivated by the combinatorics of ℵ ω in L where there are canonical examples of scales, square sequences other
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 informationANDRÉS EDUARDO CAICEDO, PAUL LARSON, GRIGOR SARGSYAN, RALF SCHINDLER, JOHN STEEL, AND MARTIN ZEMAN
SQUARE PRINCIPLES IN P max EXTENSIONS ANDRÉS EDUARDO CAICEDO, PAUL LARSON, GRIGOR SARGSYAN, RALF SCHINDLER, JOHN STEEL, AND MARTIN ZEMAN Abstract. By forcing with P max over strong models of determinacy,
More informationBPFA and BAAFA. Their equiconsistency and their nonequivalence. Thilo Weinert. February 4, 2009
Their equiconsistency and their nonequivalence February 4, 2009 1 Basics Axiom A The strengthened proper game Σ n-correct cardinals 2 Bounded Forcing Axioms Their definition A remedy for Axiom A Some facts
More informationHandbook of Set Theory. Foreman, Kanamori (eds.)
Handbook of Set Theory Foreman, Kanamori (eds.) July 10, 2007 2 Contents I Determinacy in L(R) 5 by Itay Neeman 1 Extenders and Iteration Trees................... 8 2 Iterability...............................
More informationThe extent of the failure of Ramsey s theorem at successor cardinals
The extent of the failure of Ramsey s theorem at successor cardinals 2012 North American Annual Meeting of the ASL University of Wisconsin Madison 31-March-2012 Assaf Rinot University of Toronto Mississauga
More informationCH AND THE MOORE-MROWKA PROBLEM
CH AND THE MOORE-MROWKA PROBLEM ALAN DOW AND TODD EISWORTH Abstract. We show that the Continuum Hypothesis is consistent with all regular spaces of hereditarily countable π-character being C-closed. This
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 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 informationCardinal preserving elementary embeddings
Cardinal preserving elementary embeddings Andrés Eduardo Caicedo California Institute of Technology Department of Mathematics Mail code 253-37 Pasadena, CA 91125 Homepage: http://www.its.caltech.edu/ caicedo/
More informationGeneralizing Gödel s Constructible Universe:
Generalizing Gödel s Constructible Universe: Ultimate L W. Hugh Woodin Harvard University IMS Graduate Summer School in Logic June 2018 Ordinals: the transfinite numbers is the smallest ordinal: this is
More informationSOME RESULTS IN POLYCHROMATIC RAMSEY THEORY
SOME RESULTS IN POLYCHROMATIC RAMSEY THEORY URI ABRAHAM, JAMES CUMMINGS, AND CLIFFORD SMYTH 1. Introduction Classical Ramsey theory (at least in its simplest form) is concerned with problems of the following
More informationORDINAL DEFINABLE SUBSETS OF SINGULAR CARDINALS
ORDINAL DEFINABLE SUBSETS OF SINGULAR CARDINALS JAMES CUMMINGS, SY-DAVID FRIEDMAN, MENACHEM MAGIDOR, ASSAF RINOT, AND DIMA SINAPOVA Abstract. A remarable result by Shelah states that if κ is a singular
More informationDescriptive inner model theory
Descriptive inner model theory Grigor Sargsyan Department of Mathematics Rutgers University Hill Center for the Mathematical Sciences 110 Frelinghuysen Rd. Piscataway, NJ 08854 USA http://math.rutgers.edu/
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 informationFor a xed value of, we will prove that there are some simple constraints on the triple of cardinals (b(); d(); 2 ). We will also prove that any triple
Cardinal invariants above the continuum James Cummings Hebrew University of Jerusalem cummings@math.huji.ac.il Saharon Shelah Hebrew University of Jerusalem shelah@math.huji.ac.il y February 25, 1998 Abstract
More informationThe constructible universe
The constructible universe In this set of notes I want to sketch Gödel s proof that CH is consistent with the other axioms of set theory. Gödel s argument goes well beyond this result; his identification
More informationUnsolvable problems, the Continuum Hypothesis, and the nature of infinity
Unsolvable problems, the Continuum Hypothesis, and the nature of infinity W. Hugh Woodin Harvard University January 9, 2017 V : The Universe of Sets The power set Suppose X is a set. The powerset of X
More informationAppalachian Set Theory Workshop, May 31, 2008 Lectures by Justin Tatch Moore Notes taken by David Milovich
SET MAPPING REFLECTION Appalachian Set Theory Workshop, May 31, 2008 Lectures by Justin Tatch Moore Notes taken by David Milovich 1. Introduction The goal of these lectures is to give an exposition of
More informationCardinal Preserving Elementary Embeddings
Outline Andrés E. Department of Mathematics California Institute of Technology XIII SLALM, Oaxaca, México, August 2006 Outline Outline 1 : Forcing axioms and inner models 2 Inner models M with ω1 M = ω
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 informationA simple maximality principle
A simple maximality principle arxiv:math/0009240v1 [math.lo] 28 Sep 2000 Joel David Hamkins The City University of New York Carnegie Mellon University http://math.gc.cuny.edu/faculty/hamkins February 1,
More information2 RENATA GRUNBERG A. PRADO AND FRANKLIN D. TALL 1 We thank the referee for a number of useful comments. We need the following result: Theorem 0.1. [2]
CHARACTERIZING! 1 AND THE LONG LINE BY THEIR TOPOLOGICAL ELEMENTARY REFLECTIONS RENATA GRUNBERG A. PRADO AND FRANKLIN D. TALL 1 Abstract. Given a topological space hx; T i 2 M; an elementary submodel of
More informationTOPOLOGY PROCEEDINGS Volume 28, No. 1, 2004 Pages
TOPOLOGY PROCEEDINGS Volume 28, No. 1, 2004 Pages 113-132 A FAMILY OF TREES WITH NO UNCOUNTABLE BRANCHES MIRNA DŽAMONJA AND JOUKO VÄÄNÄNEN Abstract. We construct a family of 2 ℵ 1 trees of size ℵ 1 and
More informationON CUTS IN ULTRAPRODUCTS OF LINEAR ORDERS I. 1. introduction
ON CUTS IN ULTRAPRODUCTS OF LINEAR ORDERS I MOHAMMAD GOLSHANI AND SAHARON SHELAH Abstract. For an ultrafilter D on a cardinal κ, we wonder for which pair (θ 1, θ 2 ) of regular cardinals, we have: for
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 informationNAM TRANG TREVOR WILSON. September 16, 2016
DETERMINACY FROM STRONG COMPACTNESS OF ω 1 NAM TRANG TREVOR WILSON September 16, 2016 Abstract In the absence of the Axiom of Choice, the small cardinal ω 1 can exhibit properties more usually associated
More informationExtremely large cardinals in the absence of Choice
Extremely large cardinals in the absence of Choice David Asperó University of East Anglia UEA pure math seminar, 8 Dec 2014 The language First order language of set theory. Only non logical symbol: 2 The
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 information