Mathematical Research Letters 9, 1 7 (2002) GENERIC ABSOLUTENESS AND THE CONTINUUM. Stevo Todorcevic

Size: px
Start display at page:

Download "Mathematical Research Letters 9, 1 7 (2002) GENERIC ABSOLUTENESS AND THE CONTINUUM. Stevo Todorcevic"

Transcription

1 Mathematical Research Letters 9, 1 7 (2002) GENERIC ABSOLUTENESS AND THE CONTINUUM Stevo Todorcevic Let H ω2 denote the collection of all sets whose transitive closure has size at most ℵ 1. Thus, (H ω2, ) is a natural model of ZFC minus the ower-set axiom which correctlyestimates manyof the roblems left oen bythe smaller and better understood structure (H ω1, ) of hereditarilycountable sets. One of such roblems is, for examle, the Continuum Hyothesis. It is largely for this reason that the structure (H ω2, ) has recentlyreceived a considerable amount of study (see e.g. [15] and [16]). Recall the well-known Levy-Schoenfield absoluteness theorem ([10, 2]) which states that for everyσ 0 sentence ϕ(x, a) with one free variable x and arameter a from H ω2, if there is an x such that ϕ(x, a) holds then there is such an x in H ω2, or in other words, (1) (H ω2, ) 1 (V, ). Strictlyseaking, what is usuallycalled the Levy-Schoenfield absoluteness theorem is a bit stronger result than this, but this is the form of their absoluteness theorem that allows a variation of interest to us here. The generic absoluteness considered in this aer is a natural strengthening of (1) where the universe V is relaced byone of its boolean-valued extensions V B, i.e. the statement of the form (2) (H ω2, ) 1 (V B, ) for a suitablychosen boolean-valued extension V B. This sort of generic absoluteness has aarentlybeen first considered byj. Stavi (see [11]) and then by J. Bagaria [4] who has also observed that anyof the Bounded Forcing Axioms introduced bym.goldstern and S.Shelah [9] is equivalent to the corresonding generic absoluteness statement for the structure (H ω2, ). The most rominent such statement (besides of course Martin s axiom; see [6]) is the Bounded Martin s Maximum which asserts (2) for anyboolean-valued extension V B which reserves stationarysubsets of ω 1 (see [1]-[4], [6]-[9], [11]-[12], [14]-[16]). The urose of this note is to answer the natural question (aearing exlicitelyor imlicitlyin some of the listed aers) which asks whether anyof the standard forms of the generic absoluteness (2) discussed above decides the size of the continuum. Theorem 1. Assume generic absoluteness (2) for boolean-valued extensions which reserve stationary subsets of ω 1. Then there is a well ordering of the continuum of length ω 2 which is definable in the structure (H ω2, ). Received May 6,

2 2 STEVO TODORCEVIC Remark 2. It should be noted that rior to our work, substantial and quite insiring advances towards Theorem 1 had alreadybeen made. For examle, W. H. Woodin [16, 10.3] roved Theorem 1 under the additional assumtion of the existence of a measurable cardinal and D. Asero [2] roved the weaker conclusion in Theorem 1 to the effect that there is F ω ω of size ℵ 2 which is cofinal in the ordering of eventual dominance of ω ω. We start roving Theorem 1 byfixing the onlyarameter of our definition, a one-to-one sequence r ξ (ξ<ω 1 ) of elements of the Cantor set 2 ω. This allows us to associate to everycountable set of ordinals X, the real r X = r ot(x). (See [13] for a more recise functor X r ot(x) which can also be used in the definitions that follow.) For a air x and y of distinct members of 2 ω, set (x, y) = min{n <ω: x(n) y(n)}. Note that for three distinct members x, y and z of 2 ω, the set (x, y, z) ={ (x, y), (y, z), (x, z)} has exactlytwo elements. Definition 3. Let θ AC denote the statement that for every S ω 1 there exist ordinals γ>β>α ω 1 and an increasing continuous decomosition γ = ν<ω 1 N ν of the ordinal γ into countable sets such that for all ν<ω 1, (3) N ν ω 1 S iff (r Nν α,r Nν β) = max (r Nν α,r Nν β,r Nν ). For a given S ω 1 we let θ 1 AC (S, {r ξ : ξ<ω 1 }) denote the Σ 1 sentence of (H ω2, ) asserting the existence of γ > β > α ω 1 and the decomosition N ν (ν<ω 1 ) of γ satisfying the equivalence (3) for all ν<ω 1. Theorem 1 follows from the following more informative result. Theorem 4. For every S ω 1 there is a boolean-valued extension which reserves stationary subsets of ω 1 and satisfies θ 1 AC (S, {r ξ : ξ<ω 1 }). Corollary 5. The generic absoluteness (2) for boolean extensions which reserve stationary subsets of ω 1 imlies θ AC. We need a few definitions, so let λ =2 2ℵ 1. For ω 1 α<β<γ λ + and P {min, max}, set Sαβγ P = {N [γ] ω : (r N α,r N β )=P (r N α,r N β,r N )}. For A ω 1 and α, β, γ and P as above, set Sαβγ(A) P ={N Sαβγ P : N ω 1 A}.

3 GENERIC ABSOLUTENESS AND THE CONTINUUM 3 For ω 1 α<β<λ +,A ω 1 and P {min, max}, set Γ P αβ(a) ={γ <λ + : S P αβγ(a) is stationary}. Lemma 6. There exist ω 1 α<β<λ +, such that Γ P αβ (A) is stationary for all stationary A ω 1 and P {min, max}. Proof. Otherwise, for each ω 1 α < β < λ +, we can choose a stationary A(α, β) ω 1 and P (α, β) {min, max} such that D(α, β) ={γ <λ + : S P (α,β) αβγ (A(α, β)) is nonstationary} contains a closed and unbounded subset of λ +. It follows that there is a single closed and unbounded set D λ + such that for all α<βin D, D \ (β +1) D(α, β). Alying λ + (ω +2) 2 to the coloring of (α, β) (A(α, β),p(α, β)), we 2 ℵ 1 can find E D of order-tye ω+2, a stationaryset A ω 1, and P {min, max} such that A(α, β) =A and P (α, β) =P for all α<βin E. It follows that (4) S P αβγ(a) is nonstationaryfor all α<β<γin E. Let κ be a large enough regular cardinal and M ν (ν<ω 1 ) a continuous - chain of countable elementarysubmodels of (H κ, ) containing all the objects accumulated so far. Let N ν = M ν λ +, (ν <ω 1 ), and A 0 = {ν A : N ν ω 1 = ν}. Then A 0 is stationaryas A \ A 0 is not. Note that for ν<ω 1 and α<β<γ from E, the set Sαβγ P (A) belongs to M ν,soby(4) N ν γ = M ν γ/ Sαβγ(A). P It follows that: (5) (r Nν α,r Nν β) = P (r Nν α,r Nν β,r Nν γ) for all ν A 0 and α<β<γfrom E, where P = min if P = max and P = max if P = min. Case 1. P = min. For α<βin E and k ω, set A αβ [ k] ={ν A 0 : (r Nν α,r Nν β) k}. For α<βin E, set k αβ = max{k ω : A \ A αβ [ k] is nonstationary}. Fix α<β<γ<δin E. Consider ν A αβ [ k αβ ]. Alying (5) to triles α<β<γand α<β<δ,we get that

4 4 STEVO TODORCEVIC (r Nν α,r Nν β) < (r Nν β,r Nν γ ), and (r Nν α,r Nν β) < (r Nν β,r Nν δ). Note that this gives the equalities r Nν γ n = r Nν β n = r Nν δ n for n = (r Nν α,r Nν β) + 1. It follows that, k αβ (r Nν α,r Nν β) < (r Nν γ,r Nν δ). Since ν was chosen to be an arbitrarymember of A αβ [ k αβ ], we conclude that the set A \ A γδ [ k αβ +1] is nonstationary. Hence k γδ k αβ + 1. This shows that k αβ <k γδ for all α<β<γ<δfrom E, and this is in direct contradiction with the fact that E has order-tye ω +2. Case 2. P = max. Fix α<β<γ<δin E and consider an arbitrary ν Aγδ [ k γδ ]. Alying (5) to triles α<γ<δand β<γ<δ,we get that (r Nν α,r Nν γ) > (r Nν γ,r Nν δ ), and (r Nν β,r Nν γ) > (r Nν γ,r Nν δ). This gives that r Nν α n = r Nν γ n = r Nν β n for n = (r Nν γ,r Nν δ) + 1. It follows that, k γδ (r Nν γ,r Nν δ) < (r Nν α,r Nν β). Since ν is an arbitrarymember of A γδ [ k γδ ], we conclude that the set A \ A αβ [ k γδ +1] is nonstationary. Hence k αβ k γδ + 1. This shows that k αβ >k γδ for all α<β<γ<δfrom E, and this can haen onlyif the set E is finite, a contradiction. The case-analysis shows that our initial assumtion that the conclusion of Lemma 6 is false, leads to contradictions finishing thus the roof. Fix ω 1 α<β<λ + satisfying the conclusion of Lemma 6. Lemma 7. For every stationary set A ω 1 and P {min, max}, the set Sαβ(A) P ={N [λ + ] ω : N ω 1 A & (r Nν α,r Nν β) = = P (r Nν α,r Nν β,r N )} is stationary.

5 GENERIC ABSOLUTENESS AND THE CONTINUUM 5 Proof. Consider an f :(λ + ) <ω λ +. We need to find N Sαβ P (A) such that f (N) <ω N. Since α and β satisfythe conclusion of Lemma 6, the set Γ P αβ (A) is a stationarysubset of λ +, so there is γ Γ P αβ (A) such that f γ <ω γ. Then Sαβγ P (A) is stationaryso alying this to the restriction g = f γ<ω we find N Sαβγ P (A) such that g N <ω N. Note that N Sαβ P (A) and that g N <ω = f N <ω. This finishes the roof. We are now readyto start the roof of Theorem 4. Proof of Theorem 4. Fix a subset S of ω 1. Let P be the oset of all countable increasing continuous transfinite sequences of the form = Nν : ν ν such that for all ν ν, (6) Nν ω 1 S iff (r N ν α,r N ν β) = max (r N ν α,r N ν β,r N ν ). Clearly, it suffices to show that P reserves stationarysubsets of ω 1. So, consider a stationarysubset A of ω 1, P, and a P-term τ for a closed and unbounded subset of ω 1. Let κ be a large enough regular cardinal so that the structure (H κ, ) contains all the objects accumulated so far. Suose first that A S is stationary. By Lemma 7, the set Sαβ max (A S) is stationary, so we can find a countable elementarysubmodel M of (H κ, ) containing all the relevant objects such that M λ + Sαβ max (A S). Working in M we build a decreasing sequence = 0 1 n of elements of P M and a sequence ξ n (n<ω) of ordinals from M ω 1 such that: (a) M λ + = n<ω ν ν n Nν n, (b) n forces that ξ n belongs to τ, (c) su n<ω ξ n = M ω 1. Let ν q = su n<ω ν n and q =( n ) { ν q,m λ + }. n<ω Then q P,q and q forces that M ω 1 belongs to the intersection of τ and A. The case when A \ S is stationaryis considered similarlyusing Lemma 7 for A \ S and P = min, i.e., the fact that Sαβ min (A \ S) is stationary. This finishes the roof of Theorem 4. We finish this note with the following observation which shows that θ AC not onlygives an uer bound on the size of the continuum but also the exact value. Theorem 8. θ AC imlies 2 ℵ0 =2 ℵ1 = ℵ 2. Proof. It remains to show that θ AC imlies 2 ℵ0 =2 ℵ1. This will be done by showing that θ AC violates the weak-diamond rincile of Devlin and Shelah [5]. Define F :2 <ω1 2 byletting F (f) =0ifff codes (in the usual way) a well

6 6 STEVO TODORCEVIC ordering < f of its domain ν which has to be a countable limit ordinal bigger than 0 such that if we let then α f <β f <γ f and α f = ot ({ξ <ν: ξ< f 0},< f ), β f = ot ({ξ <ν: ξ< f 1},< f ), γ f = ot (ν, < f ), (r αf,r βf ) = max (r αf,r βf,r γf ). If weak-diamond holds it would alyto F giving us g 2 ω1 such that for every f 2 ω1, the set {ν <ω 1 : F (f ν) =g(ν)} is a stationarysubset of ω 1. Let S be equal to g 1 (1). Alying θ AC to S we get ω 1 α<β<γ<ω 2 and an increasing continuous decomosition γ = N ν ν<ω 1 of the ordinal γ into countable subsets such that for all ν<ω 1, (7) N ν ω 1 S iff (r Nν α,r Nν β) = max (r Nν α,r Nν β,r Nν ). Then we can find f 2 ω1 which codes a well-ordering < f of ω 1 of order tye γ so that for almost all countable limit ordinals ν, It follows that for almost all ν<ω 1, α f ν = ot(n ν α), β f ν = ot(n ν β), γ f ν = ot(n ν ). (8) ν S iff (r αf ν,r βf ν ) = max (r αf ν,r βf ν,r γf ν ). Let A = {ν <ω 1 : F (f ν) =g(ν)}. Then bythe choice of g, the set A is stationary. If A S is stationary, we can find ν A S for which the equivalence (8) is true, i.e., such that (r αf ν,r βf ν ) = max (r αf ν,r βf ν,r γf ν ). Going back to the definition of F we see that F (f ν) =0, and therefore, g(ν) = 0 which means that ν / S, a contradiction. If A \ S is stationarywe chose ν A \ S satisfying the equivalence (8), i.e., such that (r αf ν,r βf ν ) = min (r αf ν,r βf ν,r γf ν ). Alying the definition of F, we see that F (f ν) =1, and therefore g(ν) =1 which means ν S, a contradiction. This finishes the roof of Theorem 8.

7 GENERIC ABSOLUTENESS AND THE CONTINUUM 7 References [1] D. Aseró, Bounded forcing axioms and the continuum, rerint, [2], Bounded Martin s Maximum, d and c, rerint, [3] D. Aseró, J. Bagaria, Bounded forcing axioms and the continuum, Ann. Pure, Al. Logic. 109 (2001), [4] J. Bagaria, Bounded forcing axioms as rinciles of generic absoluteness, Arch. Math. Logic 39 (2000), [5] K. J. Devlin, S. Shelah, A weak version of diamond which follows from 2 ℵ 0 < 2 ℵ 1, Israel J. Math. 29 (1978), [6] M. Foreman, M. Magidor, S. Shelah, Martin s maximum, saturated ideals and non regular ultrafilters. I. Ann. of Math. (2) 127 (1998), [7] D. H. Fremlin, Consequences of Martin s axiom, Cambridge Tracts in Mathematics, 84. Cambridge University Press, Cambridge, [8] S. Fuchino, On otential embedding and versions of Martin s axiom, Notre Dame J. Formal Logic 33 (1992), [9] M. Goldstern, S. Shelah, The bounded roer forcing axiom, J. Symbolic Logic 60 (1995), [10] T. Jech, Set Theory. Pure and Alied Mathematics, Academic Press, New York-London, [11] T. Miyamoto, Localized reflecting cardinals and weak fragments of PFA, rerint, [12] J. Stavi, J. Väänänen, Reflection rinciles for the continuum. rerint, [13] S. Todorcevic, Partitioning airs of countable sets, Proc. Amer. Math. Soc. 111 (1991), [14], Comaring the continuum with the first two uncountable cardinals, Logic and scientific methods (Florence, 1995), , Synthese Lib., 259, Kluwer Acad. Publ., Dordrecht, [15], Localized reflection and fragments of PFA, DIMACS Series in Discr. Math. and Theoret. Com. Sci. 58 (2002), [16] H. Woodin, The axiom of determinacy, forcing axioms, and the nonstationary ideal, de Gruyter Series in Logic and its Alications, 1. Walter de Gruyter & Co., Berlin, [17], The Continuum Hyothesis. I, II. Notices Amer. Math. Soc. 48 (2001), , Université de Paris 7 - C.N.R.S., UMR 7056, 2 Place Jussieu - Case 7012, Paris Cedex 05, France. address: stevo@math.jussieu.fr

SET MAPPING REFLECTION

SET 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 information

Forcing Axioms and Inner Models of Set Theory

Forcing 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 information

Tutorial 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 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 information

CCC Forcing and Splitting Reals

CCC 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 information

BOUNDING THE CONSISTENCY STRENGTH OF A FIVE ELEMENT LINEAR BASIS

BOUNDING 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 information

Scales, topological reflections, and large cardinal issues by Peter Nyikos

Scales, 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 information

An introduction to OCA

An introduction to OCA An introduction to OCA Gemma Carotenuto January 29, 2013 Introduction These notes are extracted from the lectures on forcing axioms and applications held by professor Matteo Viale at the University of

More information

STEVO TODORCEVIC AND JUSTIN TATCH MOORE

STEVO 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 information

M 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, 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 information

The Proper Forcing Axiom: a tutorial

The 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

Increasing δ 1 2 and Namba-style forcing

Increasing δ 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 information

VARIATIONS FOR SEPARATING CLUB GUESSING PRINCIPLES

VARIATIONS 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 information

SELF-DUAL UNIFORM MATROIDS ON INFINITE SETS

SELF-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 information

COMPLETE NORMALITY AND COUNTABLE COMPACTNESS

COMPLETE 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 information

A DIRECT PROOF OF THE FIVE ELEMENT BASIS THEOREM

A 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 information

THE STRONG TREE PROPERTY AND THE FAILURE OF SCH

THE 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 information

COLLAPSING FUNCTIONS

COLLAPSING 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 information

INSEPARABLE SEQUENCES AND FORCING

INSEPARABLE 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 information

Annals of Pure and Applied Logic

Annals 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 information

THE PRECIPITOUSNESS OF TAIL CLUB GUESSING IDEALS

THE 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 information

FORCING 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 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 information

A NOTE ON THE EIGHTFOLD WAY

A 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 information

SOME USES OF SET THEORY IN ALGEBRA. Stanford Logic Seminar February 10, 2009

SOME USES OF SET THEORY IN ALGEBRA. Stanford Logic Seminar February 10, 2009 SOME USES OF SET THEORY IN ALGEBRA Stanford Logic Seminar February 10, 2009 Plan I. The Whitehead Problem early history II. Compactness and Incompactness III. Deconstruction P. Eklof and A. Mekler, Almost

More information

A FIVE ELEMENT BASIS FOR THE UNCOUNTABLE LINEAR ORDERS

A 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 information

arxiv: v2 [math.lo] 15 Sep 2018

arxiv: v2 [math.lo] 15 Sep 2018 ON BOOLEAN ALGEBRAS WITH STRICTLY POSITIVE MEASURES arxiv:1809.04118v2 [math.lo] 15 Sep 2018 MENACHEM MAGIDOR AND GRZEGORZ PLEBANEK Abstract. We investigate reflection-type problems on the class SPM, of

More information

Generic 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. 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 information

Distributivity of Quotients of Countable Products of Boolean Algebras

Distributivity 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 information

Projective well-orderings of the reals and forcing axioms

Projective 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 information

Semi-stationary reflection and weak square

Semi-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 information

THE 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 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 information

Diamond on successors of singulars

Diamond 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 information

Appalachian Set Theory Workshop, May 31, 2008 Lectures by Justin Tatch Moore Notes taken by David Milovich

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 information

On the Length of Borel Hierarchies

On 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 information

Forcing notions in inner models

Forcing 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 information

MORE ABOUT SPACES WITH A SMALL DIAGONAL

MORE 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 information

SMALL COMBINATORIAL CARDINAL CHARACTERISTICS AND THEOREMS OF EGOROV AND BLUMBERG

SMALL COMBINATORIAL CARDINAL CHARACTERISTICS AND THEOREMS OF EGOROV AND BLUMBERG Real Analysis Exchange Vol. 26(2), 2000/2001, pp. 905 911 Krzysztof Ciesielski, Department of Mathematics, West Virginia University, Morgantown, WV 26506-6310, USA, email: K Cies@math.wvu.edu, internet:

More information

Diamond, non-saturation, and weak square principles

Diamond, 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 information

Löwenheim-Skolem Theorems, Countable Approximations, and L ω. David W. Kueker (Lecture Notes, Fall 2007)

Löwenheim-Skolem Theorems, Countable Approximations, and L ω. David W. Kueker (Lecture Notes, Fall 2007) Löwenheim-Skolem Theorems, Countable Approximations, and L ω 0. Introduction David W. Kueker (Lecture Notes, Fall 2007) In its simplest form the Löwenheim-Skolem Theorem for L ω1 ω states that if σ L ω1

More information

Appalachian Set Theory Workshop on Coherent Sequences Lectures by Stevo Todorcevic Notes taken by Roberto Pichardo Mendoza

Appalachian Set Theory Workshop on Coherent Sequences Lectures by Stevo Todorcevic Notes taken by Roberto Pichardo Mendoza Appalachian Set Theory Workshop on Coherent Sequences Lectures by Stevo Todorcevic Notes taken by Roberto Pichardo Mendoza 1 Introduction 2 Preliminaries Let s begin by defining the basic structure for

More information

arxiv: v1 [math.lo] 7 Dec 2017

arxiv: v1 [math.lo] 7 Dec 2017 CANONICAL TRUTH MERLIN CARL AND PHILIPP SCHLICHT arxiv:1712.02566v1 [math.lo] 7 Dec 2017 Abstract. We introduce and study a notion of canonical set theoretical truth, which means truth in a transitive

More information

A variant of Namba Forcing

A 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 information

Singular Failures of GCH and Level by Level Equivalence

Singular 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 information

TRANSFERING SATURATION, THE FINITE COVER PROPERTY, AND STABILITY

TRANSFERING SATURATION, THE FINITE COVER PROPERTY, AND STABILITY TRANSFERING SATURATION, THE FINITE COVER PROPERTY, AND STABILITY John T. Baldwin Department of Mathematics University of Illinois at Chicago Chicago, IL 60680 Rami Grossberg Department of Mathematics Carnegie

More information

Chain Conditions of Horn and Tarski

Chain 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 information

Modal Logic of Forcing Classes

Modal Logic of Forcing Classes Outline CUNY Graduate Center Department of Mathematics March 11, 2016 Outline Outline 1 Outline 1 Modal Logic Background Modal Axioms K (ϕ ψ) ( ϕ ψ) T ϕ ϕ 4 ϕ ϕ.2 ϕ ϕ.3 ( ϕ ψ) [(ϕ ψ) (ψ ϕ)] 5 ϕ ϕ Modal

More information

ITERATING ALONG A PRIKRY SEQUENCE

ITERATING 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 information

Complexity of Ramsey null sets

Complexity of Ramsey null sets Available online at www.sciencedirect.com Advances in Mathematics 230 (2012) 1184 1195 www.elsevier.com/locate/aim Complexity of Ramsey null sets Marcin Sabok Instytut Matematyczny Uniwersytetu Wrocławskiego,

More information

PCF THEORY AND CARDINAL INVARIANTS OF THE REALS

PCF THEORY AND CARDINAL INVARIANTS OF THE REALS PCF THEORY AND CARDINAL INVARIANTS OF THE REALS LAJOS SOUKUP Abstract. The additivity spectrum ADD(I) of an ideal I P(I) is the set of all regular cardinals κ such that there is an increasing chain {A

More information

Ultrafilters with property (s)

Ultrafilters with property (s) Ultrafilters with property (s) Arnold W. Miller 1 Abstract A set X 2 ω has property (s) (Marczewski (Szpilrajn)) iff for every perfect set P 2 ω there exists a perfect set Q P such that Q X or Q X =. Suppose

More information

COUNTEREXAMPLES TO THE UNIQUE AND COFINAL BRANCHES HYPOTHESES

COUNTEREXAMPLES 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 information

Forcing Axioms and Cardinal Arithmetic

Forcing 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 information

SHELAH S SINGULAR COMPACTNESS THEOREM

SHELAH S SINGULAR COMPACTNESS THEOREM SHELAH S SINGULAR COMPACTNESS THEOREM PAUL C. EKLOF Abstract. We present Shelah s famous theorem in a version for modules, together with a self-contained proof and some examples. This exposition is based

More information

arxiv: v1 [math.lo] 11 Feb 2011

arxiv: v1 [math.lo] 11 Feb 2011 BOUNDED FORCING AXIOMS AND BAUMGARTNER S CONJECTURE arxiv:1102.2275v1 [math.lo] 11 Feb 2011 DAVID ASPERÓ, SY-DAVID FRIEDMAN, MIGUEL ANGEL MOTA, AND MARCIN SABOK Abstract. We study the spectrum of forcing

More information

FRAGILITY AND INDESTRUCTIBILITY II

FRAGILITY 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 information

The Ultrapower Axiom implies GCH above a supercompact cardinal

The 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 information

1. Introduction Definition 1.1. For an L ω1,ω-sentence φ, the spectrum of φ is the set

1. 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 information

THE TREE PROPERTY AT ℵ ω+1 DIMA SINAPOVA

THE 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 information

A NEW LINDELOF SPACE WITH POINTS G δ

A 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 information

Jónsson Properties for Non-Ordinal Sets Under the Axiom of Determinacy

Jó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 information

GROUPS WITH UNBOUNDED POTENTIAL AUTOMORPHISM TOWER HEIGHTS

GROUPS WITH UNBOUNDED POTENTIAL AUTOMORPHISM TOWER HEIGHTS GROUPS WITH UNBOUNDED POTENTIAL AUTOMORPHISM TOWER HEIGHTS PHILIPP LÜCKE Abstract. We show that it is consistent with the axioms of ZFC that there exists an infinite centreless group G with the property

More information

Forcing with matrices of countable elementary submodels

Forcing 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 information

On the Length of Borel Hierarchies

On the Length of Borel Hierarchies On the Length of Borel Hierarchies Arnold W. Miller November 7, 2016 This is a survey paper on the lengths of Borel hierarchies and related hierarchies. It consists of lecture notes of a lecture given

More information

GREGORY TREES, THE CONTINUUM, AND MARTIN S AXIOM

GREGORY 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 information

EXTERNAL AUTOMORPHISMS OF ULTRAPRODUCTS OF FINITE MODELS

EXTERNAL AUTOMORPHISMS OF ULTRAPRODUCTS OF FINITE MODELS EXTERNAL AUTOMORPHISMS OF ULTRAPRODUCTS OF FINITE MODELS PHILIPP LÜCKE AND SAHARON SHELAH Abstract. Let L be a finite first-order language and M n n < ω be a sequence of finite L-models containing models

More information

CLUB GUESSING SEQUENCES NATURAL STRUCTURES IN SET THEORY

CLUB 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 information

Tallness and Level by Level Equivalence and Inequivalence

Tallness 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 information

Combinatorial dichotomies and cardinal invariants

Combinatorial 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 information

The Arkhangel skiĭ Tall problem under Martin s Axiom

The Arkhangel skiĭ Tall problem under Martin s Axiom F U N D A M E N T A MATHEMATICAE 149 (1996) The Arkhangel skiĭ Tall problem under Martin s Axiom by Gary G r u e n h a g e and Piotr K o s z m i d e r (Auburn, Ala.) Abstract. We show that MA σ-centered

More information

Inner models from extended logics

Inner 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 information

MARTIN S MAXIMUM AND DEFINABILITY IN H(ℵ 2 ) Keywords: Forcing Axioms; Definability; Large Cardinals. 1. Introduction

MARTIN 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 information

Maharam Algebras. Equipe de Logique, Université de Paris 7, 2 Place Jussieu, Paris, France

Maharam 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 information

The Continuum Hypothesis, Part II

The Continuum Hypothesis, Part II The Continuum Hypothesis, Part II W. Hugh Woodin Introduction In the first part of this article, I identified the correct axioms for the structure P(N), N, +,,, which is the standard structure for Second

More information

Handbook of Set Theory. Foreman, Kanamori, and Magidor (eds.)

Handbook 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 information

Elementary Analysis in Q p

Elementary Analysis in Q p Elementary Analysis in Q Hannah Hutter, May Szedlák, Phili Wirth November 17, 2011 This reort follows very closely the book of Svetlana Katok 1. 1 Sequences and Series In this section we will see some

More information

Topology Proceedings. COPYRIGHT c by Topology Proceedings. All rights reserved.

Topology 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 information

Pseudo-finite model theory

Pseudo-finite model theory Mat. Contemp. 24 (2003), 169-183. Pseudo-finite model theory Jouko Väänänen Department of Mathematics University of Helsinki Helsinki, Finland jouko.vaananen@helsinki.fi September 24, 2002 Abstract We

More information

Ultrafilters and Set Theory. Andreas Blass University of Michigan Ann Arbor, MI

Ultrafilters 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 information

The inverse Goldbach problem

The inverse Goldbach problem 1 The inverse Goldbach roblem by Christian Elsholtz Submission Setember 7, 2000 (this version includes galley corrections). Aeared in Mathematika 2001. Abstract We imrove the uer and lower bounds of the

More information

The Bounded Axiom A Forcing Axiom

The 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 information

A BOREL SOLUTION TO THE HORN-TARSKI PROBLEM. MSC 2000: 03E05, 03E20, 06A10 Keywords: Chain Conditions, Boolean Algebras.

A BOREL SOLUTION TO THE HORN-TARSKI PROBLEM. MSC 2000: 03E05, 03E20, 06A10 Keywords: Chain Conditions, Boolean Algebras. A BOREL SOLUTION TO THE HORN-TARSKI PROBLEM STEVO TODORCEVIC Abstract. We describe a Borel poset satisfying the σ-finite chain condition but failing to satisfy the σ-bounded chain condition. MSC 2000:

More information

IDEAL GAMES AND RAMSEY SETS

IDEAL GAMES AND RAMSEY SETS IDEAL GAMES AND RAMSEY SETS CARLOS DI PRISCO, JOSÉ G. MIJARES, AND CARLOS UZCÁTEGUI Abstract. It is shown that Matet s characterization ([9]) of the Ramsey property relative to a selective co-ideal H,

More information

Slow P -point Ultrafilters

Slow P -point Ultrafilters Slow P -point Ultrafilters Renling Jin College of Charleston jinr@cofc.edu Abstract We answer a question of Blass, Di Nasso, and Forti [2, 7] by proving, assuming Continuum Hypothesis or Martin s Axiom,

More information

Unsolvable problems, the Continuum Hypothesis, and the nature of infinity

Unsolvable 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 information

DO FIVE OUT OF SIX ON EACH SET PROBLEM SET

DO 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 information

ALMOST DISJOINT AND INDEPENDENT FAMILIES. 1. introduction. is infinite. Fichtenholz and Kantorovich showed that there is an independent family

ALMOST DISJOINT AND INDEPENDENT FAMILIES. 1. introduction. is infinite. Fichtenholz and Kantorovich showed that there is an independent family ALMOST DISJOINT AND INDEPENDENT FAMILIES STEFAN GESCHKE Abstract. I collect a number of proofs of the existence of large almost disjoint and independent families on the natural numbers. This is mostly

More information

FORCING WITH SEQUENCES OF MODELS OF TWO TYPES

FORCING 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 information

Cardinal Preserving Elementary Embeddings

Cardinal 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 information

Aronszajn Trees and the SCH

Aronszajn 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 information

SOME REMARKS ON NON-SPECIAL COHERENT ARONSZAJN TREES

SOME 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

arxiv:math/ v1 [math.lo] 4 May 2006

arxiv: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 information

AMS regional meeting Bloomington, IN April 1, 2017

AMS regional meeting Bloomington, IN April 1, 2017 Joint work with: W. Boney, S. Friedman, C. Laskowski, M. Koerwien, S. Shelah, I. Souldatos University of Illinois at Chicago AMS regional meeting Bloomington, IN April 1, 2017 Cantor s Middle Attic Uncountable

More information

SOME CALKIN ALGEBRAS HAVE OUTER AUTOMORPHISMS

SOME CALKIN ALGEBRAS HAVE OUTER AUTOMORPHISMS SOME CALKIN ALGEBRAS HAVE OUTER AUTOMORPHISMS ILIJAS FARAH, PAUL MCKENNEY, AND ERNEST SCHIMMERLING Abstract. We consider various quotients of the C*-algebra of bounded operators on a nonseparable Hilbert

More information

Generalizing Gödel s Constructible Universe:

Generalizing 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 information

FORCING AXIOMS AND THE CONTINUUM HYPOTHESIS

FORCING 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 information

A Basis Theorem for Perfect Sets

A 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 information

ITERATIONS WITH MIXED SUPPORT

ITERATIONS 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 information

REVIEW ON TODD EISWORTH S CHAPTER FOR THE HANDBOOK OF SET THEORY: SUCCESSORS OF SINGULAR CARDINALS

REVIEW ON TODD EISWORTH S CHAPTER FOR THE HANDBOOK OF SET THEORY: SUCCESSORS OF SINGULAR CARDINALS REVIEW ON TODD EISWORTH S CHAPTER FOR THE HANDBOOK OF SET THEORY: SUCCESSORS OF SINGULAR CARDINALS ASSAF RINOT This chapter offers a comprehensive and lucid exposition of the questions and techniques involved

More information

BOUNDS FOR THE SIZE OF SETS WITH THE PROPERTY D(n) Andrej Dujella University of Zagreb, Croatia

BOUNDS FOR THE SIZE OF SETS WITH THE PROPERTY D(n) Andrej Dujella University of Zagreb, Croatia GLASNIK MATMATIČKI Vol. 39(59(2004, 199 205 BOUNDS FOR TH SIZ OF STS WITH TH PROPRTY D(n Andrej Dujella University of Zagreb, Croatia Abstract. Let n be a nonzero integer and a 1 < a 2 < < a m ositive

More information

HOW DO ULTRAFILTERS ACT ON THEORIES? THE CUT SPECTRUM AND TREETOPS

HOW DO ULTRAFILTERS ACT ON THEORIES? THE CUT SPECTRUM AND TREETOPS HOW DO ULTRAFILTERS ACT ON THEORIES? THE CUT SPECTRUM AND TREETOPS DIEGO ANDRES BEJARANO RAYO Abstract. We expand on and further explain the work by Malliaris and Shelah on the cofinality spectrum by doing

More information

Silver trees and Cohen reals

Silver 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 information