Forcing Axioms and Inner Models of Set Theory
|
|
- Janis Porter
- 5 years ago
- Views:
Transcription
1 Forcing Axioms and Inner Models of Set Theory Boban Veličković Equipe de Logique Université de Paris 7 boban 15th Boise Extravaganza in Set Theory Boise State University, Boise, ID April
2 1 History and Motivation This is a report on an ongoing collaboration with Andres Caicedo (Caltech) and a student of mine Matteo Viale. Forcing axioms are natural combinatorial statements which decide many of the questions left open by the usual axioms ZFC of set theory. They assert a kind of saturation of the universe of sets, i.e. if a set satisfying certain properties can be found in a suitable generic extension of the universe then such a set already exists. Let K be a class of forcing notions and κ an uncountable cardinal. FA κ (K) is the statement. For every P K and a family D of κ dense subsets of P there is a filter G in P such that G D, for all D D. 2
3 Examples of forcing axioms (Martin and Solovay) Martin s Axiom (MA + CH) - provides a rich structure theory for the reals and subsets of ℵ 1. (Baumgartner and Shelah) Proper Forcing Axiom (PFA) Very successful in resolving questions left open by MA. The proof of the consistency of PFA uses a supercompact cardinal. (Foreman, Magidor, Shelah) Martin s Maximum (MM) - the provably maximal forcing axiom. Resolves questions left open by PFA such as the saturation of the nonstationary ideal NS ω1, Chang s Conjecture, etc. 3
4 (Goldstern, Shelah) Bounded versions of traditional forcing axioms. Have many of the same consequences, yet require much smaller large cardinal assumptions. Bounded Proper Forcing Axiom (BPFA), Bounded Martin s Maximum (BMM), etc. (Woodin) Axiom ( ). This is different from the other forcing axioms. Assuming large cardinals and working in L(R) Woodin defines a forcing notion P max. If G is a P max -generic the model L(R)[G] satisfies the following. Any Π 2 statement over the structure H ℵ2 which can be forced is already true. Woodin s model satisfies V = L(P(ω 1 )). It is not known if one can obtain such an axiom without going to the inner model L(R). 4
5 Question 1 Is there an inner model theory for forcing axioms? To what extent is a model of a forcing axiom determined by its cardinal structure? By a model we mean a transitive model containing all the ordinals. The motivation for this investigation comes from the following observation I made in Theorem 1 If V satisfies MM and M is an inner model of V such that ℵ M 2 = ℵ V 2 then P(ω 1 ) V M. In fact, this is a consequence of stationary set reflection and a result of Gitik. 5
6 Definition 2 Stationary Set Reflection: If κ ℵ 1 and S [κ] ℵ 0 is stationary then there is X κ with X = ℵ 1 and ω 1 X such that S [X] ℵ 0 is stationary. Shelah showed the following. Theorem 3 MM implies stationary set reflection. In fact, MM implies a much stronger form of reflection of stationary sets called SRP. Most of the consequences of MM which do not follow already from PFA are actually obtained using SRP. On the other hand, PFA does not even imply the weaker form of stationary set reflection. Theorem 4 (Gitik) Suppose M V are models of set theory and there is a real x V \ M. Then the set ([ω 2 ] ℵ 0 ) V \ M is stationary in V. 6
7 Proof of Theorem 1: For each α [ω 1, ω 2 ) choose in M a closed unbounded set C α [α] ℵ 0. Let S = α C α. By Gitik s result if R V M then E = [ω 2 ] ℵ 0 \ S is stationary. By MM there is α < ω 2 such that E [α] ℵ 0 is stationary, which is a contradiction. Thus, R M = R V. But then by almost disjoint coding P(ω 1 ) V M. 7
8 Assuming V W are models of Woodin s axiom ( ) and have the same cardinals. Then V = W. To what extent can we extend this to models of other forcing axioms? Question 2 If V W are models of some strong forcing axiom and V and W have the same cardinals. Is ORD ω 1 V = ORD ω 1 W? Why require V and W to have the same cardinals? We want to avoid situations like the following. 8
9 Suppose V satisfies say MM and has a supercompact cardinal. We can first collapse cardinals and then force MM all over again to obtain a generic extension W of V such that V and W both satisfy MM but otherwise have little in common. If V has a proper class of completely Jónsson cardinals and G is generic for the class stationary tower forcing P and W = V [G] then there is an elementary embedding j : V W and we can arrange cp(j) to be arbitrary high and of cofinality ω in W. 9
10 These questions are closely related to the study of the Härtig quantifier. The logic L(I) is obtained by augmenting first-order logic with the binary quantifier I. If M = (M,...) is a structure, iff M = (M,...) = Ixy (φ(x), ψ(y)) { b M : M = φ(b) } = { c M : M = ψ(c) }. One is then interested in the expressive power of the logic L(I) under the assumption of strong forcing axioms. 10
11 In 1984 Foreman, Magidor and Shelah showed that MM implies that κ ℵ 1 = κ, for every regular κ ℵ 2. In 1987 Todorcevic and I showed that PFA implies that 2 ℵ 0 = ℵ 2. In 2003 Moore showed that BPFA implies 2 ℵ 0 = ℵ 2. His proof gives a well ordering of the reals which is 2 -definable over H(ℵ 2 ) with parameter a subset of ω 1. Can one improve this to a 1 well ordering of the reals? Does PFA imply that κ ℵ 1 = κ, for all κ ℵ 2, in particular, does PFA imply the Singular Cardinal Hypothesis (SCH)? Can one get well orderings definable without parameters? In 2003 Moore introduced the Mapping Reflection Principle (MRP) and deduced it from PFA. This principle plays a crucial role in our analysis. 11
12 2 The mapping reflection principle Definition 5 Let θ be a regular cardinal, let X be uncountable, and let M H θ be countable such that [X] ω M. A subset Σ of [X] ω is M-stationary iff for all E M such that E [X] ω is club, Σ E M. Recall the Ellentuck topology on [X] ω. Basic open sets are of the form [x, N] = {Y [X] ω : x Y N} where N [X] ω and x N is finite. Definition 6 A set mapping Σ is open stationary iff there is an uncountable set X = X Σ and a regular cardinal θ = θ Σ such that [X] ω H θ, dom(σ) is a club in [H θ ] ω and Σ(M) [X] ω is open and M-stationary, for every M dom(σ). 12
13 Definition 7 The Mapping Reflection Principle is the following statement. If Σ is an open stationary set mapping whose domain is a club, there is a continuous -chain N = (N ξ : ξ < ω 1 ) of elements dom(σ) such that for all limit ordinals ξ < ω 1 there is ν < ξ such that N η X Σ Σ(N ξ ) for all η such that ν < η < ξ. If (N ξ : ξ < ω 1 ) satisfies the conclusion of MRP for Σ then it is said to be a reflecting sequence for Σ. 13
14 Example. Suppose α = K 0 α K 1 α is a partition of α into clopen sets, for each α < ω 1. Let M H ℵ2 be countable. Then one of K 0 α and K 1 α is M- stationary. Let Σ(M) = [ω 1 ] ℵ 0 \ K i α where i is such that Kα 1 i is M-stationary. Let N be a reflecting sequence for Σ. Set C = {N ξ ω 1 : ξ < ω 1 }. Then C is a club subset of ω 1 and for every limit point ξ of C there is i such that C \ Kξ i is bounded in ξ. 14
15 Theorem 8 (Moore) PFA implies MRP. In fact, what Moore showed is that given a stationary set mapping Σ there is a proper poset which adds a reflecting sequence for Σ. Using a bounded version of MRP he showed the following. Theorem 9 (Moore) BPFA implies 2 ℵ 0 = ℵ 2. On the other hand Moore also showed that MRP implies the failure of κ, for all κ > ω 1. This was later improved by Sharon. Theorem 10 (Sharon) Assume MRP. Then κ,ω fails, for all κ ω 1. Thus, MRP has considerable large cardinal strength. 15
16 We will discuss the following two theorems. Theorem 11 (Caicedo, V.) Assume V W are two models of set theory, ℵ V 2 = ℵ W 2 and BPFA holds in both V and W. Then P(ω 1 ) W V. Theorem 12 (Caicedo, V.) Assume BPFA. Then there is a 1 -definable well-ordering of P(ω 1 ) with parameter a subset of ω 1. The length of the wellordering is ω 2. Sketch Let C = ( C ξ : ξ < ω 1 & lim(ξ)) be a fixed C-sequence, i.e., C ξ is cofinal in ξ of order type ω, for all limit ξ < ω 1. We define a robust coding of reals by ordinals, in fact by triples of ordinals < ω 2. We can then use almost disjoint coding relative to a fixed ω 1 -sequence of reals to code subsets of ω 1 by reals. 16
17 Let ω 1 < β < γ < δ be fixed limit ordinals and suppose N M δ are countable sets of ordinals. Assume that {ω 1, β, γ} N, that sup(ξ N) < sup(ξ M) and sup(ξ M) is a limit ordinal, for every ξ {ω 1, β, γ, δ}. We define a finite binary sequence s βγδ (N, M). This sequence is defined using the oscillation of N and M relative to β, γ and δ and the fixed parameter C. Finally, we say that the triple (β, γ, δ) codes a real r if there is a continuous increasing sequence of countable sets (N ξ : ξ < ω 1 ) whose union is δ such that for every countable limit ordinal ξ there is ν < ξ such that r = s βγδ (N η, N ξ ). ν<η<ξ 17
18 Let r be a given real. To show that r is coded by a triple of ordinals we first use MRP. We define an open stationary set mapping Σ r such that a reflecting sequence for Σ r gives us a triple of ordinals coding r. Σ r is defined on the set of all countable elementary submodels of H ℵ4 containing C. For M dom(σ r ) we let { N [M ω 4 ] ω : s ω2 ω 3 ω 4 (N, M ω 4 ) r }. Σ r (M) is open in the Ellentuck topology. The hard part is showing that it is M-stationary. This is done using Namba type games inside M. Let M be the transitive collapse of M and let π be the collapsing map. Then, from the point of view of M, obviously ω M 2, ω M 3 and ω M 4 are different regular cardinals, but from the outside they are actually countable ordinals and the C-sequence provides a witness to this. 18
19 Not every triple of ordinals < ω 2 codes a real, but given ordinals ω 1 < β < γ < δ < ω 2 of cofinality ω 1 we can define a family of clopen partitions α = K 0 α K 1 α, for α < ω 1 as in the example presented above. Now, using a bounded version of MRP we can show that (β, γ, δ) codes something, although not necessarily a real. Now, given V W such that ℵ V 2 = ℵ W 2 and both V and W satisfy MRP we show that R W V as follows. 19
20 Fix a C-sequence C in V as a parameter. Then any real r W is coded in W by some triple (β, γ, δ) and this is witnessed by a continuous increasing sequence N = (N ξ : ξ < ω 1 ) of countable subsets of δ whose union is δ. In V there is another continuous increasing sequence P = (P ξ : ξ < ω 1 ) witnessing that (β, γ, δ) codes something. But there is a club of ξ < ω 1 such that N ξ = P ξ and the coding is local enough to guarantee that on any limit point of this club, P actually codes r, so r V. 20
21 Let V I be the set of Gödel numbers of the validities for the logic L(I) with the Härtig quantifier. Theorem 13 (Caicedo, V.) Assume BPFA. Then V I is not projective. Using the result of Steel that PFA implies AD L(R) and a result of Solovay saying that AD L(R) and the existence of R imply that there is a real which is ordinal definable in L(R ) but not ordinal definable in L(R) we obtain the following. Theorem 14 (Caicedo, V.) Assume PFA. V I is not ordinal definable in L(R). Then 21
22 3 The P -ideal dichotomy In the Fall of 2005 my student Matteo Viale showed that PFA implies the Singular Cardinal Hypothesis. He used some ideas of Moore and deduced SCH from MRP. Recently he found another proof of SCH using another consequence of PFA, the P- ideal dichotomy. Since this proof seems optimal we present the main ideas. Definition 15 A P-ideal I on a set X is an ideal containing all finite subsets of X such that for every sequence {A n } n of elements of I there is A I such that A n A for all n, where A B means A \ B is finite. Given A, B X we write A B iff A B is finite. Given any family A P(X) we let A = {B : B A, for all A A} Note that for any A P(X) A is an ideal, but not necessarily a P-ideal. 22
23 P-ideal dichotomy(pid). Let X be any set and suppose I [X] ℵ 0 is a P-ideal such that all finite subsets of X are in I. Then either there is an uncountable Y X such that or [Y ] ℵ 0 I, there is a countable sequence {X n } n, such that X n I, for all n, and such that X = n X n. The P-ideal dichotomy was introduced by Abraham and Todorcevic and is known to follow from PFA. 23
24 Theorem 16 (Viale) Assume PID. Then κ ℵ 0 = κ, for all κ 2 ℵ 0. In particular, PID implies SCH. Let κ be a cardinal of countable cofinality. A covering matrix for κ + is a sequence such that C = {K(n, β) : n < ω, β < κ + } 1. K(n, β) < κ, for all n and β 2. K(n, β) K(m, β), for all β and n < m 3. β = n K(n, β), for all β 4. for all α < β and n there is m such that K(n, α) K(m, β). 24
25 Fact 1 For every singular cardinal κ of countable cofinality there is a covering matrix for κ +. be a cardinal of countable cofi- Now, let κ > 2 ℵ 0 nality and let C = {K(n, β) : n < ω, β < κ + } be a covering matrix for κ +. Let I = C. Fact 2 I is a P-ideal. Fact 3 There is no uncountable set X κ + such that [X] ℵ 0 I. 25
26 By the P-ideal dichotomy one gets a decomposition κ + = n X n such that X n I, for all n. Fact 4 [X n ] ℵ 0 = m<ω,β<κ + [K(m, β)] ℵ 0. Since there is n such that X n = κ + and K(m, β) is of size < κ, for all m and β it follows that (κ + ) ℵ 0 = κ + sup λ ℵ 0. λ<κ This allows us to show that κ ℵ 0 = κ, for all regular κ 2 ℵ 0 by induction on κ. The only nontrivial case is the successors of singular cardinals of countable cofinality and this is handled by the above facts. 26
27 Using similar, but more involved ideas, Viale has also shown the following. Theorem 17 (Viale) Assume V W, the P-ideal dichotomy holds in W and V and W have the same reals and cardinals. Let κ be the least such that (κ ω ) W V. Then κ is not a regular cardinal in V. 27
28 Theorem 18 (Viale) Assume V W are models with the same cardinals and reals. Assume that W satisfies PID and κ is the least such that (κ ω ) W V (so cof(κ) V = ω). 1. For every W -regular λ < κ there is a stationary set in κ + consisting of ordinals of V cofinality λ which is not stationary in W. 2. If κ = ℵ V ω then κ is V -Jónsson, i.e. any algebra on κ which is in V has a proper subalgebra of the same size in W. So, if V and W have the same bounded subsets of κ then κ is Jónsson in W. 28
29 Open problems Assume If V W, both V and W are models of PFA and have the same cardinals. Is ORD ω 1 V = ORD ω 1 W? Does PFA or MM imply the existence of a wellordering of the reals which is definable without parameters? Asperó has shown that the existence of such a well-ordering is consistent with PFA. Does the P-ideal dichotomy imply 2 ℵ 0 ℵ 2? It is known that most standard forcing for adding a real destroy the P-ideal dichotomy. 29
Appalachian 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 informationForcing Axioms and Cardinal Arithmetic
Forcing Axioms and Cardinal Arithmetic Boban Veličković Equipe de Logique, Université de Paris 7, 2 Place Jussieu, 75251 Paris, France Abstract We survey some recent results on the impact of strong forcing
More informationSET MAPPING REFLECTION
SET MAPPING REFLECTION JUSTIN TATCH MOORE Abstract. In this note we will discuss a new reflection principle which follows from the Proper Forcing Axiom. The immediate purpose will be to prove that the
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 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 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 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 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 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 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 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 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 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 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 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 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 informationForcing axioms and inner models
Outline Andrés E. Department of Mathematics California Institute of Technology Boise State University, February 27 2008 Outline Outline 1 Introduction 2 Inner models M with ω1 M = ω 1 Inner models M with
More informationA FIVE ELEMENT BASIS FOR THE UNCOUNTABLE LINEAR ORDERS
A FIVE ELEMENT BASIS FOR THE UNCOUNTABLE LINEAR ORDERS JUSTIN TATCH MOORE Abstract. In this paper I will show that it is relatively consistent with the usual axioms of mathematics (ZFC) together with a
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 informationFORCING AXIOMS AND THE CONTINUUM HYPOTHESIS
FORCING AXIOMS AND THE CONTINUUM HYPOTHESIS DAVID ASPERÓ, PAUL LARSON, AND JUSTIN TATCH MOORE 1. Introduction One way to formulate the Baire Category Theorem is that no compact space can be covered by
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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationDiagonalize This. Iian Smythe. Department of Mathematics Cornell University. Olivetti Club November 26, 2013
Diagonalize This Iian Smythe Department of Mathematics Cornell University Olivetti Club November 26, 2013 Iian Smythe (Cornell) Diagonalize This Nov 26, 2013 1 / 26 "Surprised Again on the Diagonal", Lun-Yi
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 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 five element basis for the uncountable linear orders
Annals of Mathematics, 163 (2006), 669 688 A five element basis for the uncountable linear orders By Justin Tatch Moore* Dedicated to Fennel Moore Abstract In this paper I will show that it is relatively
More informationCOMPLETE NORMALITY AND COUNTABLE COMPACTNESS
Topology Proceedings Vol 17, 1992 COMPLETE NORMALITY AND COUNTABLE COMPACTNESS PETER J. NYIKOS, BORIS SHAPIROVSKIĬ, ZOLTÁN SZENTMIKLÓSSY AND BOBAN VELIČKOVIĆ One of the classical separation axioms of topology
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 informationSuccessive 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 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 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 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 informationThe Proper Forcing Axiom
Proceedings of the International Congress of Mathematicians Hyderabad, India, 2010 The Proper Forcing Axiom Justin Tatch Moore This article is dedicated to Stephanie Rihm Moore. The author s preparation
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 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 informationSemi-stationary reflection and weak square
Semi-stationary reflection and weak square Hiroshi Sakai Results in this note will be included in a forthcoming joint paper with Fuchino, Torres and Usuba. 1 Introduction In this note we investigate how
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 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 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 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 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 Bounded Axiom A Forcing Axiom
The Bounded Axiom A Forcing Axiom Thilo Weinert 1 1 Contact: e-mail: weinert@math.uni-bonn.de, Phone: +49 228 73 3791 Abstract We introduce the Bounded Axiom A Forcing Axiom(BAAFA). It turns out that it
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 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 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 informationAn inner model from Ω-logic. Daisuke Ikegami
An inner model from Ω-logic Daisuke Ikegami Kobe University 12. November 2014 Goal & Result Goal Construct a model of set theory which is close to HOD, but easier to analyze. Goal & Result Goal Construct
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 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 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 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 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 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 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 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 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 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 informationOn the Length of Borel Hierarchies
University of Wisconsin, Madison July 2016 The Borel hierachy is described as follows: open = Σ 0 1 = G closed = Π 0 1 = F Π 0 2 = G δ = countable intersections of open sets Σ 0 2 = F σ = countable unions
More informationarxiv: v2 [math.lo] 1 Mar 2016
A DIRECT PROOF OF THE FIVE ELEMENT BASIS THEOREM arxiv:1012.0596v2 [math.lo] 1 Mar 2016 BOBAN VELIČKOVIĆ AND GIORGIO VENTURI Abstract. We present a direct proof of the consistency of the existence of a
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 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 informationFORCING AXIOMS, FINITE CONDITIONS AND SOME MORE
FORCING AXIOMS, FINITE CONDITIONS AND SOME MORE MIRNA DŽAMONJA Abstract. We survey some classical and some recent results in the theory of forcing axioms, aiming to present recent breakthroughs and interest
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 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 informationSELF-DUAL UNIFORM MATROIDS ON INFINITE SETS
SELF-DUAL UNIFORM MATROIDS ON INFINITE SETS NATHAN BOWLER AND STEFAN GESCHKE Abstract. We extend the notion of a uniform matroid to the infinitary case and construct, using weak fragments of Martin s Axiom,
More informationJónsson Properties for Non-Ordinal Sets Under the Axiom of Determinacy
Jónsson Properties for Non-Ordinal Sets Under the Axiom of Determinacy Fifth NY Graduate Student Logic Conference The Jónsson Property For κ a cardinal and n ω, [κ] n = {(α 1,, α n ) κ n : α 1 < < α n
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 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 informationOuter Model Satisfiability. M.C. (Mack) Stanley San Jose State
Outer Model Satisfiability M.C. (Mack) Stanley San Jose State The Universe of Pure Sets V 0 = V α+1 = P(V α ) = { x : x V α } V λ = V α, λ a limit α
More informationBounding by canonical functions, with CH
Bounding by canonical functions, with CH Paul Larson Saharon Shelah April 12, 2002 Abstract We show that the members of a certain class of semi-proper iterations do not add countable sets of ordinals.
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 informationSTEVO TODORCEVIC AND JUSTIN TATCH MOORE
June 27, 2006 THE METRIZATION PROBLEM FOR FRÉCHET GROUPS STEVO TODORCEVIC AND JUSTIN TATCH MOORE 1. Introduction Let us begin this paper by recalling the following classical metrization theorem of Birkhoff
More informationMORE ABOUT SPACES WITH A SMALL DIAGONAL
MORE ABOUT SPACES WITH A SMALL DIAGONAL ALAN DOW AND OLEG PAVLOV Abstract. Hušek defines a space X to have a small diagonal if each uncountable subset of X 2 disjoint from the diagonal, has an uncountable
More informationForcing with matrices of countable elementary submodels
Forcing with matrices of countable elementary submodels Boriša Kuzeljević IMS-JSPS Joint Workshop - IMS Singapore, January 2016 Boriša Kuzeljević (NUS) Matrices of elementary submodels January 2016 1 /
More informationBorel cardinals and Ramsey ultrafilters (draft of Sections 1-3)
Borel cardinals and Ramsey ultrafilters (draft of Sections 1-3) Richard Ketchersid Paul Larson Jindřich Zapletal May 17, 2012 Abstract This is a draft of the first three sections of a paper in preparation
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 informationClassical Theory of Cardinal Characteristics
Classical Theory of Cardinal Characteristics Andreas Blass University of Michigan 22 August, 2018 Andreas Blass (University of Michigan) Classical Theory of Cardinal Characteristics 22 August, 2018 1 /
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 informationAn Iterated Forcing Extension In Which All Aleph-1 Dense Sets of Reals Are Isomorphic
San Jose State University SJSU ScholarWorks Master's Theses Master's Theses and Graduate Research Summer 2010 An Iterated Forcing Extension In Which All Aleph-1 Dense Sets of Reals Are Isomorphic Michael
More informationA Note on Singular Cardinals in Set Theory without Choice
arxiv:0709.2436v1 [math.lo] 15 Sep 2007 A Note on Singular Cardinals in Set Theory without Choice Denis I. Saveliev 2007 August 11, Beijing Partially supported by grant 06-01-00608-a of Russian Foundation
More informationDO FIVE OUT OF SIX ON EACH SET PROBLEM SET
DO FIVE OUT OF SIX ON EACH SET PROBLEM SET 1. THE AXIOM OF FOUNDATION Early on in the book (page 6) it is indicated that throughout the formal development set is going to mean pure set, or set whose elements,
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 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 information