FORCING AND THE HALPERN-LÄUCHLI THEOREM. 1. Introduction This document is a continuation of [1]. It is intended to be part of a larger paper.
|
|
- Rosa Allison
- 5 years ago
- Views:
Transcription
1 FORCING AND THE HALPERN-LÄUCHLI THEOREM NATASHA DOBRINEN AND DAN HATHAWAY Abstract. We will show the various effects that forcing has on the Halpern-Läuchli Theorem. We will show that the the theorem at an inaccessible κ is preserved by forcings of size < κ and, assuming κ is measurable, by <κ-closed forcings. 1. Introduction This document is a continuation of [1]. It is intended to be part of a larger paper. 2. Basic Definitions For the even more basic definitions, see [1]. We review here the fundamental definitions. Although some of these definitions depend on the cardinal κ, in practice there will be no confusion. Definition 2.1. A tree T <κ κ is regular iff it is a perfect κ-tree in which every maximal branch has length κ. Definition 2.2. Given a set X <κ κ and an ordinal ζ < κ, X(ζ) := {t X : Dom(t) = ζ}. We also write Length(t) for Dom(t). Definition 2.3. Given sets X, Y <κ κ, we say that X dominates Y iff ( y Y )( x X) x y. Definition 2.4. Given t <κ κ, Cone(t) is the set of all t t in <κ κ. Definition 2.5. Given d ω and a sequence X i <κ κ : i < d, define the level product of the X i to be X i := { x i : i < d : ( ζ < κ)( i < d) x i X i (ζ)}. i<d The following is the somewhere dense version of the Halpern-Läuchli Theorem, which we shall denote by SDHL(d, σ, κ). Definition 2.6. For d ω and cardinals 0 < σ < κ with κ infinite, SDHL(d, σ, κ) is the statement that given any sequence T i <κ κ : i < 1
2 2 NATASHA DOBRINEN AND DAN HATHAWAY d of regular trees and any coloring c : i<d T i σ, there exits ζ < ζ < κ, t i T i (ζ) : i < d, and X i T i (ζ ) : i < d such that each X i dominates T i (ζ + 1) Cone(t i ) and c i<d X i = 1. The following is the strong tree version of the Halpern-Läuchli Theorem, which we shall denote by HL(d, σ, κ). By [1], HL(d, σ, κ) is equivlanet to SDHL(d, σ, κ). Definition 2.7. For d ω and cardinals σ < κ with κ infinite, HL(d, σ, κ) is the following statement: given any sequence T i <κ κ : i < d of regular trees and a coloring c : i<d T i σ, there exists a sequence of trees T i : i < d such that (1) each T i is a strong subtree of T i as witnessed by the same set A κ independent of i, and (2) there is some σ < σ such that for each ζ A, c i<d T i (ζ) = {σ }. Finally, the following is the tail cone version of the Halpern-Läuchli Theorem, which we shall denote by HL tc (d, < κ, κ). Definition 2.8. For d ω and κ be an infinite cardinal, HL tc (d, < κ, κ) is the following statement: given a sequence of regular trees T i <κ κ : i < d, a sequence of cardinals σ j < κ : j < κ, and a sequence of colorings c j : i<d T i σ j : j < κ, there exists a sequence of strong subtrees T i : i < d such that (1) each T i is a strong subtree of T i as witnesses by the same set A κ independent of i, where {a j : j < κ} is an increasing enumeration of A, and (2) for each j < κ and ζ j, given any sequence t i T i (a ζ ) : i < d, we have c j ( t i : i < d ) = c j ( t i a j : i < d ). Proposition 2.9. For d ω and κ an inaccessible cardinal, HL tc (d, < κ, κ) is equivalent to the modification where in (2), for each j < κ is repaced by for κ many j < κ. Proof. Assume that the modified version of HL tc (d, < κ, κ) holds. We will show that the unmodified version holds. Let T i <κ κ : i < d be a sequence of regular trees. Let σ j < κ : j < κ be a sequence
3 FORCING AND THE HALPERN-LÄUCHLI THEOREM 3 of cardinals. Let c j : j < κ be a sequence of colorings such that c j : i<d T i σ j for each j < κ. For each j < κ, let σ j be the product of the cardinals σ l for l < j. Because κ is inaccessible, each σ j is strictly less than κ. For each j < κ, let c j : i<d T i σ j be a coloring which encodes the colorings c l for l < j. That is, given j < κ and t i<d T i, the sequence c l ( t) : l < j can be recovered from knowing c j ( t). Apply the modified version of HL tc (d, < κ, κ) to get a sequence of trees T i : i < d, where each T i is a strong subtree of T i as witnessed by the same set A = {a j : j < κ} independent of i, and let B κ be the size κ set such that for each j B and ζ j, given any sequence t i T i (a ζ ) : i < d, we have c j( t i : i < d ) = c j( t i a j : i < d ). Temporarily fix j B and l < j. Then because c j encodes c l, we have that given any ζ j and any sequence t i T i (a ζ ) : i < d, we have c l ( t i : i < d ) = c l ( t i a j : i < d ). Now shrink each T i to get some T i, where T i is a strong subtree of T i as witnessed by the set {a j : j B} κ. One can check that the trees T i for i < d witness the conclusion of HL tc (d, < κ, κ). 3. Derived Trees Definition 3.1. Let κ be a cardinal, P a forcing, and T a name such that 1 ( T <κ κ is a tree). Then Der( T ), the derived tree of T, is defined as follows. The elements of Der( T ) are equivalence classes of pairs ( τ, α) satisfying 1 ( τ T and Length( τ) = ˇα), where the equivalence relation = is defined by ( τ 1, α 1 ) = ( τ 2, α 2 ) iff 1 ( τ 1 = τ 2 ). The elements of Der( T ) are ordered as follows: [( τ 1, α 1 )] < [( τ 2, α 2 )] iff 1 ( τ 1 τ 2 and τ 1 τ 2 ). We will now show that Der( T ) is a regular tree when 1 ( T is a regular tree), and that all successors of an element named by some ( τ, α) in Der( T ) are named by successors of that ( τ, α). Lemma 3.2. Let κ be strongly inaccessible, P a forcing of size < κ, and T a name for a regular tree. The following are satisfied. 1) Der( T ) is a κ-tree; 2) Der( T ) has no maximal branches of length < κ; 3) Der( T ) is perfect;
4 4 NATASHA DOBRINEN AND DAN HATHAWAY 4) if [( τ, α)] Der( T ) and X is the set of all τ such that [( τ, α + 1)] is a successor of [( τ, α)] in Der( T ), then 1 (every successor of τ in T is named by an element of ˇX). Proof. First note that if [( τ, α)] is in Der( T ) and β < α, then there is a name τ β such that [( τ β, β)] is in Der( T ) and is < [( τ, α)]: simply let τ be a name for the restriction of τ to level β. To verify 1), we must first show that Der( T ) is a tree. Suppose [( τ 1, α)] > [( τ 2, β)], [( τ 3, γ)] are all in Der( T ). Suppose, without loss of generality, that β γ. It is not hard to show that 1 ( τ 2 τ 3 ), because 1 (all initial segments of τ 1 are comparable with respect to ). Thus, [( τ 2, β)] and [( τ 3, γ)] are comparable in Der( T ). This also shows that given [( τ, α)] in Der( T ) and β < α, there is a unique [( τ, β)] on level β of Der( T ) that is < [( τ, α)]. This establishes that Der( T ) is a tree. We now must show that Der( T ) is a κ-tree. That is, we must show that each level of Der( T ) has < κ nodes. Here is where we use the fact that Der( T ) consists of elements [( τ, α)] where 1 (Length( τ) = ˇα). If we drop the α s from the definition of Der( T ), we can verify 2) through 4) but not 1). Since P < κ and 1 ( T is a ˇκ-tree), it is routine to construct a function g : κ κ such that ( α < κ) 1 ( t T ) Length(t) > ˇα implies t(ˇα) < ǧ(ˇα). Now, a pair ( τ, α) such that [( τ, α)] Der( T ) may be construed as a sequence f ξ : ξ < α where each f ξ is a function from some maximal antichain of P to g(ξ). Thus, we can upper bound the size of level α of Der( T ) by the following: g(ξ) P. ξ<α Since κ is strongly inaccessible, this bound is < κ. We have now shown 1). To verify 2), suppose η < κ and S = [( τ α, α)] : α < η is a sequence such that [( τ 0, α 0 )] < [( τ 1, α 1 )] <... Let ṡ be a name such that 1 ṡ : ˇη <κ κ and ( α < η) 1 ṡ(ˇα) = τ α. Note that 1 ( α < β < ˇη) ṡ(α) ṡ(β), and moreover 1 α<ˇη ṡ(α) ˇη κ. Since 1 ( T has no maximal branches of length < κ), if we let τ η be such that 1 τ η = α<ˇη ṡ(α), we have [( τ η, η)] Der( T ), and this node is above each [( τ α, α)] for α < η. To verify 3), consider any [( τ, α)] Der( T ). Let ḃ be such that 1 (ḃ is the leftmost branch of T which extends τ). Let β be the least ordinal such that α β < κ and there is some p P such that
5 FORCING AND THE HALPERN-LÄUCHLI THEOREM 5 p (there are at least two successors of ḃ ˇβ in the tree T ). Let τ 1 be such that 1 ( τ 1 = ḃ ˇβ). Let τ 2 be such that 1 ( τ 2 is the first successor of τ 1 in T ). Let τ 3 be such that 1 ( τ 3 is the second successor of τ 1 in T if it exists, and it is the first successor otherwise). One can see that [( τ 2, β + 1)] and [( τ 3, β + 1)] are successors of [( τ 1, β)] in Der( T ). Since there is some p such that p ( τ 2 τ 3 ), it follows that [( τ 2, β + 1)] [( τ 3, β + 1)] Finally, the verification of 4) follows almost immediately from the definition of Der( T ). That is, fix [( τ, α)] Der( T ). Let G be P-generic over V. Let t be an arbitrary successor of τ G in T G. Let τ be such that τ G = t and 1 τ is a successor of τ. Then [( τ, α + 1)] Der( T ). 4. Small Forcings Preserve SDHL, HL, HL tc In this section we will show that if κ is strongly inaccessible and ( σ < κ) SDHL(d, σ, κ) holds, then this still holds after performing any forcing of size < κ. The same is true if we replace SDHL with HL tc. Theorem 4.1. Let κ be strongly inaccessible. Let 1 d < ω and σ < κ. Let P be a forcing of size < κ. Assume that SDHL(d, σ P, κ) holds. Then SDHL(d, σ, κ) holds after forcing with P. Proof. Let T i : i < d be a sequence of names for regular trees in the extension. Let ċ be such that 1 ċ : T i ˇσ. i<ď We must show that 1 there is a somewhere dense level matrix X i T i : i < ď such that ċ i<ď X i = 1. We will do this by showing that for each q P, there is some q q forcing this statement. Fix q P. Consider the trees Der( T i ) for i < d. Let c : i<d Der( T i ) σ P be a coloring such that for any α < κ and t = [( τ i, α)] Der( T i ) : i < d, c ( t) = σ, p where σ and p satisfy p q and p ċ( τ i : i < d ) = ˇσ. Since SDHL(d, σ P ), κ) holds, there is a somewhere dense level matrix Y i Der( T i ) : i < d that is monocromatic with respect to c.
6 6 NATASHA DOBRINEN AND DAN HATHAWAY Let σ, q be the unique color assigned to each element of i<d Y i by c. For each i < d, let Ẋi be such that 1 Ẋi = { τ : ( α) [(ˇ τ, α)] ˇY i }. For each i < d, let ( τ i, β) be such that Y i dominates the successors of [( τ i, α)] in Der( T i ). Since Y i : i < d is somewhere dense, the same β can be chosen for each i < d. By the definition of c, we have that q ċ i<ď Ẋ i = {ˇσ }. By 4) of the lemma above, we have that 1 ( i < ď) Ẋi dominates the successors of τ i in T i. Thus, we have q Ẋi : i < ď is a somewhere dense level matrix that is monocromatic with respect to ċ. This completes the proof. We have a similar theorem for HL instead of SDHL. Instead of using the fact that HL and SDHL are equivalent, we include the following proof to illustrate how to use derived trees. Theorem 4.2. Let d, σ, κ, and P be as in the above theorem. Assume that HL(d, σ P, κ) holds. Then HL(d, σ, κ) holds after forcing with P. Proof. Let T i : i < d be a sequence of names for regular trees in the extension. Let ċ be such that 1 ċ : i<ď T i ˇσ. Fix q P. Let c : i<d Der( T i ) σ P be as in the previous theorem. Applying HL(d, σ P, κ), we get a sequence of strong subtrees S i Der( T i ) : i < d as witnessed by the same set A κ such that for each ζ A, c i<d S i (ζ) = {(σ, p)}, for some σ < σ and q q. For each i < d, let U i be such that 1 U i = { τ : ( α) [(ˇ τ, α)] Ši}.
7 FORCING AND THE HALPERN-LÄUCHLI THEOREM 7 By Lemma 3.2, 1 each U i is a strong subtree of T i as witnessed by the same set Ǎ ˇκ. Furthermore, if ζ A, then q c i<d This is what we wanted to show. U i (ζ) = {σ }. Theorem 4.3. Let d, σ, κ, and P be as in Theorem 4.1. Assume that HL tc (d, < κ, κ) holds. Then HL tc (d, < κ, κ) holds after forcing with P. Proof. The proof is similar to the above theorem. Fix q P. The sequence of colorings ċ j : j < κ induces a sequence of colorings c j : j < κ where for each j < κ, 1 ċ j : i<ď T i ˇσ j and c j : i<d Der( T i ) σ j P. We may get strong subtrees S i Der(T i ) for i < d as witnessed by the same size κ set A κ. We may find a size κ set B κ such that the colorings c j for j B all use the same condition q. This shows that the modified HL tc (d, < κ, κ) holds in the extension. By proposition 2.9, this is equivalent to the full HL tc (d, < κ, κ) holding. Remark 4.4. In [3], Zhang shows that a certain polarized partition relation follows from HL tc (d, < κ, κ). Since there is a model in which HL tc (d, < κ, κ) holds for κ strongly inaccessible, it follows that in that model, the relevant polarized partition relation cannot be forced false by any poset of size < κ. 5. Reflection First, we will show that if SDHL (equivalentely HL) holds on a stationary set below κ, then it holds at κ. We do know that ZFC does not prove the analogous result for HL tc, because otherwise we would have, by the argument in the next section, a model in which HL tc holds at a cardinal that is not weakly compact, which contradicts [3]. Proposition 5.1. Assume that SDHL(d, σ, α) holds for a stationary set S of α < κ. Then SDHL(d, σ, κ) holds. Proof. Let T i <κ κ : i < d be a sequence of regular trees and let c : i<d T i σ be a coloring. If we can find an α < κ such that each T i <α κ is an α-tree and SDHL(d, σ, α) holds, then we will be
8 8 NATASHA DOBRINEN AND DAN HATHAWAY done. An elementary argument shows that for each i < d, there is a club C i κ such that T i <α κ is an α-tree for each α C i. The set i<d C i is a club, so it must intersect S. An α < κ in the intersection is as desired. When it comes to measurable cardinals, we have an even stronger form of reflection using a normal ultrafilter. The same argument works for HL and HL tc as well. Theorem 5.2. Let κ be a measurable cardinal and U be a normal ultrafilter on κ. Then SDHL(d, σ, κ) {α < κ : SDHL(d, σ, α)} U. Proof. Let j : V M be the ultrapower embedding. Because V κ+1 M, SDHL(d, σ, κ) SDHL(d, σ, κ) M. By Los s Theorem, SDHL(d, σ, κ) M {α < κ : SDHL(d, σ, α)} U. 6. SDHL at a Cardinal That is Not Weakly Compact Theorem 6.1. Fix d ω. If GCH holds and κ is (κ + d)-strong, then there is a forcing extension in which ( σ < κ) SDHL(d, σ, κ) holds, but κ is not weakly compact. Proof. First force over V to get a model V [G 1 ] in which SDHL holds at κ, which is also measurable [1]. By a theorem of Hampkins [2], any nontrivial forcing of size < κ followed by a non-trivial <κ-closed forcing will make κ not weakly compact. Perform any non-trivial forcing of size < κ over V [G 1 ] to get V [G 1 ][G 2 ]. This will preserve SDHL at κ by the previous theorem. Since κ is measurable in V [G 1 ][G 2 ], SDHL holds on a stationary (in fact, measure one) subset of κ. Now perform any non-trivial <κ-closed forcing over V [G 1 ][G 2 ] to get V [G 1 ][G 2 ][G 3 ]. Stationary subsets of κ are preserved, so inside V [G 1 ][G 2 ][G 3 ], SDHL holds on a stationary subset of κ. Thus, SDHL holds at κ in this model. References [1] N. Dobrinen and D. Hathaway, The Halpern-Lauchi Theorem at a Measurable Cardinal. To appear in Journal of Symbolic Logic. [2] J. Hamkins Small forcing makes any cardinal superdestructible. The Journal of Symbolic Logic 63: 51-58, 1998.
9 FORCING AND THE HALPERN-LÄUCHLI THEOREM 9 [3] J. Zhang, A Tail Cone version of the Halpern-Luchli theorem at a large cardinal, eprint arxiv: , April address: Daniel.Hathaway@du.edu
Tall, Strong, and Strongly Compact Cardinals
Tall, Strong, and Strongly Compact Cardinals Arthur W. Apter Department of Mathematics Baruch College of CUNY New York, New York 10010 USA and The CUNY Graduate Center, Mathematics 365 Fifth Avenue New
More informationPERFECT TREE FORCINGS FOR SINGULAR CARDINALS
PERFECT TREE FORCINGS FOR SINGULAR CARDINALS NATASHA DOBRINEN, DAN HATHAWAY, AND KAREL PRIKRY Abstract. We investigate forcing properties of perfect tree forcings defined by Prikry to answer a question
More informationExtender based forcings, fresh sets and Aronszajn trees
Extender based forcings, fresh sets and Aronszajn trees Moti Gitik August 31, 2011 Abstract Extender based forcings are studied with respect of adding branches to Aronszajn trees. We construct a model
More informationSilver type theorems for collapses.
Silver type theorems for collapses. Moti Gitik May 19, 2014 The classical theorem of Silver states that GCH cannot break for the first time over a singular cardinal of uncountable cofinality. On the other
More informationSy D. Friedman. August 28, 2001
0 # and Inner Models Sy D. Friedman August 28, 2001 In this paper we examine the cardinal structure of inner models that satisfy GCH but do not contain 0 #. We show, assuming that 0 # exists, that such
More informationLevel by Level Inequivalence, Strong Compactness, and GCH
Level by Level Inequivalence, Strong Compactness, and GCH 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 informationarxiv: v3 [math.lo] 3 Mar 2018
THE HALPERN-LÄUCHLI THEOREM AT A MEASURABLE CARDINAL arxiv:1608.00592v3 [math.lo] 3 Mar 2018 NATASHA DOBRINEN AND DAN HATHAWAY Abstract. Several variants of the Halpern-Läuchli Theorem for trees of uncountable
More informationA HIERARCHY OF RAMSEY-LIKE CARDINALS
A HIERARCHY OF RAMSEY-LIKE CARDINALS PETER HOLY AND PHILIPP SCHLICHT Abstract. We introduce a hierarchy of large cardinals between weakly compact and measurable cardinals, that is closely related to the
More informationThe first author was supported by FWF Project P23316-N13.
The tree property at the ℵ 2n s and the failure of SCH at ℵ ω SY-DAVID FRIEDMAN and RADEK HONZIK Kurt Gödel Research Center for Mathematical Logic, Währinger Strasse 25, 1090 Vienna Austria sdf@logic.univie.ac.at
More informationStrongly compact Magidor forcing.
Strongly compact Magidor forcing. Moti Gitik June 25, 2014 Abstract We present a strongly compact version of the Supercompact Magidor forcing ([3]). A variation of it is used to show that the following
More informationLARGE CARDINALS AND L-LIKE UNIVERSES
LARGE CARDINALS AND L-LIKE UNIVERSES SY D. FRIEDMAN There are many different ways to extend the axioms of ZFC. One way is to adjoin the axiom V = L, asserting that every set is constructible. This axiom
More informationSTRONGLY UNFOLDABLE CARDINALS MADE INDESTRUCTIBLE
The Journal of Symbolic Logic Volume 73, Number 4, Dec. 2008 STRONGLY UNFOLDABLE CARDINALS MADE INDESTRUCTIBLE THOMAS A. JOHNSTONE Abstract. I provide indestructibility results for large cardinals consistent
More informationPhilipp Moritz Lücke
Σ 1 -partition properties Philipp Moritz Lücke Mathematisches Institut Rheinische Friedrich-Wilhelms-Universität Bonn http://www.math.uni-bonn.de/people/pluecke/ Logic & Set Theory Seminar Bristol, 14.02.2017
More informationbeing saturated Lemma 0.2 Suppose V = L[E]. Every Woodin cardinal is Woodin with.
On NS ω1 being saturated Ralf Schindler 1 Institut für Mathematische Logik und Grundlagenforschung, Universität Münster Einsteinstr. 62, 48149 Münster, Germany Definition 0.1 Let δ be a cardinal. We say
More informationLarge Cardinals with Few Measures
Large Cardinals with Few Measures arxiv:math/0603260v1 [math.lo] 12 Mar 2006 Arthur W. Apter Department of Mathematics Baruch College of CUNY New York, New York 10010 http://faculty.baruch.cuny.edu/apter
More informationGUESSING MODELS IMPLY THE SINGULAR CARDINAL HYPOTHESIS arxiv: v1 [math.lo] 25 Mar 2019
GUESSING MODELS IMPLY THE SINGULAR CARDINAL HYPOTHESIS arxiv:1903.10476v1 [math.lo] 25 Mar 2019 Abstract. In this article we prove three main theorems: (1) guessing models are internally unbounded, (2)
More informationContinuous images of closed sets in generalized Baire spaces ESI Workshop: Forcing and Large Cardinals
Continuous images of closed sets in generalized Baire spaces ESI Workshop: Forcing and Large Cardinals Philipp Moritz Lücke (joint work with Philipp Schlicht) Mathematisches Institut, Rheinische Friedrich-Wilhelms-Universität
More informationCharacterizing large cardinals in terms of layered partial orders
Characterizing large cardinals in terms of layered partial orders Philipp Moritz Lücke Joint work with Sean D. Cox (VCU Richmond) Mathematisches Institut Rheinische Friedrich-Wilhelms-Universität Bonn
More informationThe Semi-Weak Square Principle
The Semi-Weak Square Principle Maxwell Levine Universität Wien Kurt Gödel Research Center for Mathematical Logic Währinger Straße 25 1090 Wien Austria maxwell.levine@univie.ac.at Abstract Cummings, Foreman,
More informationGeneralising the weak compactness of ω
Generalising the weak compactness of ω Andrew Brooke-Taylor Generalised Baire Spaces Masterclass Royal Netherlands Academy of Arts and Sciences 22 August 2018 Andrew Brooke-Taylor Generalising the weak
More informationChain conditions, layered partial orders and weak compactness
Chain conditions, layered partial orders and weak compactness Philipp Moritz Lücke Joint work with Sean D. Cox (VCU Richmond) Mathematisches Institut Rheinische Friedrich-Wilhelms-Universität Bonn http://www.math.uni-bonn.de/people/pluecke/
More informationStrongly Unfoldable Cardinals Made Indestructible
Strongly Unfoldable Cardinals Made Indestructible by Thomas A. Johnstone A dissertation submitted to the Graduate Faculty in Mathematics in partial fulfillment of the requirements for the degree of Doctor
More informationJanuary 28, 2013 EASTON S THEOREM FOR RAMSEY AND STRONGLY RAMSEY CARDINALS
January 28, 2013 EASTON S THEOREM FOR RAMSEY AND STRONGLY RAMSEY CARDINALS BRENT CODY AND VICTORIA GITMAN Abstract. We show that, assuming GCH, if κ is a Ramsey or a strongly Ramsey cardinal and F is a
More informationOn the Splitting Number at Regular Cardinals
On the Splitting Number at Regular Cardinals Omer Ben-Neria and Moti Gitik January 25, 2014 Abstract Let κ,λ be regular uncountable cardinals such that κ + < λ. We construct a generic extension with s(κ)
More informationCOMBINATORICS OF REDUCTIONS BETWEEN EQUIVALENCE RELATIONS
COMBINATORICS OF REDUCTIONS BETWEEN EQUIVALENCE RELATIONS DAN HATHAWAY AND SCOTT SCHNEIDER Abstract. We discuss combinatorial conditions for the existence of various types of reductions between equivalence
More informationThe (λ, κ)-fn and the order theory of bases in boolean algebras
The (λ, κ)-fn and the order theory of bases in boolean algebras David Milovich Texas A&M International University david.milovich@tamiu.edu http://www.tamiu.edu/ dmilovich/ June 2, 2010 BLAST 1 / 22 The
More informationarxiv: v2 [math.lo] 21 Mar 2016
WEAK DISTRIBUTIVITY IMPLYING DISTRIBUTIVITY arxiv:1410.1970v2 [math.lo] 21 Mar 2016 DAN HATHAWAY Abstract. Let B be a complete Boolean algebra. We show that if λ is an infinite cardinal and B is weakly
More informationARONSZAJN TREES AND THE SUCCESSORS OF A SINGULAR CARDINAL. 1. Introduction
ARONSZAJN TREES AND THE SUCCESSORS OF A SINGULAR CARDINAL SPENCER UNGER Abstract. From large cardinals we obtain the consistency of the existence of a singular cardinal κ of cofinality ω at which the Singular
More informationTHE NUMBER OF UNARY CLONES CONTAINING THE PERMUTATIONS ON AN INFINITE SET
THE NUMBER OF UNARY CLONES CONTAINING THE PERMUTATIONS ON AN INFINITE SET MICHAEL PINSKER Abstract. We calculate the number of unary clones (submonoids of the full transformation monoid) containing the
More informationLECTURE NOTES - ADVANCED TOPICS IN MATHEMATICAL LOGIC
LECTURE NOTES - ADVANCED TOPICS IN MATHEMATICAL LOGIC PHILIPP SCHLICHT Abstract. Lecture notes from the summer 2016 in Bonn by Philipp Lücke and Philipp Schlicht. We study forcing axioms and their applications.
More informationOn the strengths and weaknesses of weak squares
On the strengths and weaknesses of weak squares Menachem Magidor and Chris Lambie-Hanson 1 Introduction The term square refers not just to one but to an entire family of combinatorial principles. The strongest
More informationAnnals of Pure and Applied Logic
Annals of Pure and Applied Logic 161 (2010) 895 915 Contents lists available at ScienceDirect Annals of Pure and Applied Logic journal homepage: www.elsevier.com/locate/apal Global singularization and
More informationThe tree property for supercompactness
(Joint work with Matteo Viale) June 6, 2010 Recall that κ is weakly compact κ is inaccessible + κ-tp holds, where κ-tp is the tree property on κ. Due to Mitchell and Silver we have V = κ is weakly compact
More informationMITCHELL S THEOREM REVISITED. Contents
MITCHELL S THEOREM REVISITED THOMAS GILTON AND JOHN KRUEGER Abstract. Mitchell s theorem on the approachability ideal states that it is consistent relative to a greatly Mahlo cardinal that there is no
More informationGlobal singularization and the failure of SCH
Global singularization and the failure of SCH Radek Honzik 1 Charles University, Department of Logic, Celetná 20, Praha 1, 116 42, Czech Republic Abstract We say that κ is µ-hypermeasurable (or µ-strong)
More informationADDING A LOT OF COHEN REALS BY ADDING A FEW II. 1. Introduction
ADDING A LOT OF COHEN REALS BY ADDING A FEW II MOTI GITIK AND MOHAMMAD GOLSHANI Abstract. We study pairs (V, V 1 ), V V 1, of models of ZF C such that adding κ many Cohen reals over V 1 adds λ many Cohen
More informationGeneralization by Collapse
Generalization by Collapse Monroe Eskew University of California, Irvine meskew@math.uci.edu March 31, 2012 Monroe Eskew (UCI) Generalization by Collapse March 31, 2012 1 / 19 Introduction Our goal is
More informationINDESTRUCTIBLE STRONG UNFOLDABILITY
INDESTRUCTIBLE STRONG UNFOLDABILITY JOEL DAVID HAMKINS AND THOMAS A. JOHNSTONE Abstract. Using the lottery preparation, we prove that any strongly unfoldable cardinal κ can be made indestructible by all
More informationNotes to The Resurrection Axioms
Notes to The Resurrection Axioms Thomas Johnstone Talk in the Logic Workshop CUNY Graduate Center September 11, 009 Abstract I will discuss a new class of forcing axioms, the Resurrection Axioms (RA),
More informationDEPTH OF BOOLEAN ALGEBRAS SHIMON GARTI AND SAHARON SHELAH
DEPTH OF BOOLEAN ALGEBRAS SHIMON GARTI AND SAHARON SHELAH Abstract. Suppose D is an ultrafilter on κ and λ κ = λ. We prove that if B i is a Boolean algebra for every i < κ and λ bounds the Depth of every
More informationON THE SINGULAR CARDINALS. A combinatorial principle of great importance in set theory is the Global principle of Jensen [6]:
ON THE SINGULAR CARDINALS JAMES CUMMINGS AND SY-DAVID FRIEDMAN Abstract. We give upper and lower bounds for the consistency strength of the failure of a combinatorial principle introduced by Jensen, Square
More informationSHORT EXTENDER FORCING
SHORT EXTENDER FORCING MOTI GITIK AND SPENCER UNGER 1. Introduction These notes are based on a lecture given by Moti Gitik at the Appalachian Set Theory workshop on April 3, 2010. Spencer Unger was the
More informationChapter 4. Cardinal Arithmetic.
Chapter 4. Cardinal Arithmetic. 4.1. Basic notions about cardinals. We are used to comparing the size of sets by seeing if there is an injection from one to the other, or a bijection between the two. Definition.
More informationUPWARD STABILITY TRANSFER FOR TAME ABSTRACT ELEMENTARY CLASSES
UPWARD STABILITY TRANSFER FOR TAME ABSTRACT ELEMENTARY CLASSES JOHN BALDWIN, DAVID KUEKER, AND MONICA VANDIEREN Abstract. Grossberg and VanDieren have started a program to develop a stability theory for
More informationA relative of the approachability ideal, diamond and non-saturation
A relative of the approachability ideal, diamond and non-saturation Boise Extravaganza in Set Theory XVIII March 09, Boise, Idaho Assaf Rinot Tel-Aviv University http://www.tau.ac.il/ rinot 1 Diamond on
More informationOn almost precipitous ideals.
On almost precipitous ideals. Asaf Ferber and Moti Gitik December 20, 2009 Abstract With less than 0 # two generic extensions of L are identified: one in which ℵ 1, and the other ℵ 2, is almost precipitous.
More informationSatisfaction in outer models
Satisfaction in outer models Radek Honzik joint with Sy Friedman Department of Logic Charles University logika.ff.cuni.cz/radek CL Hamburg September 11, 2016 Basic notions: Let M be a transitive model
More informationCovering properties of derived models
University of California, Irvine June 16, 2015 Outline Background Inaccessible limits of Woodin cardinals Weakly compact limits of Woodin cardinals Let L denote Gödel s constructible universe. Weak covering
More informationSUCCESSIVE FAILURES OF APPROACHABILITY
SUCCESSIVE FAILURES OF APPROACHABILITY SPENCER UNGER Abstract. Motivated by showing that in ZFC we cannot construct a special Aronszajn tree on some cardinal greater than ℵ 1, we produce a model in which
More informationInterpolation of κ-compactness and PCF
Comment.Math.Univ.Carolin. 50,2(2009) 315 320 315 Interpolation of κ-compactness and PCF István Juhász, Zoltán Szentmiklóssy Abstract. We call a topological space κ-compact if every subset of size κ has
More informationA precipitous club guessing ideal on ω 1
on ω 1 Tetsuya Ishiu Department of Mathematics and Statistics Miami University June, 2009 ESI workshop on large cardinals and descriptive set theory Tetsuya Ishiu (Miami University) on ω 1 ESI workshop
More informationMODIFIED EXTENDER BASED FORCING
MODIFIED EXTENDER BASED FORCING DIMA SINAPOVA AND SPENCER UNGER Abstract. We analyze the modified extender based forcing from Assaf Sharon s PhD thesis. We show there is a bad scale in the extension and
More informationHierarchies of (virtual) resurrection axioms
Hierarchies of (virtual) resurrection axioms Gunter Fuchs August 18, 2017 Abstract I analyze the hierarchies of the bounded resurrection axioms and their virtual versions, the virtual bounded resurrection
More informationAn effective perfect-set theorem
An effective perfect-set theorem David Belanger, joint with Keng Meng (Selwyn) Ng CTFM 2016 at Waseda University, Tokyo Institute for Mathematical Sciences National University of Singapore The perfect
More informationarxiv: v3 [math.lo] 23 Jul 2018
SPECTRA OF UNIFORMITY arxiv:1709.04824v3 [math.lo] 23 Jul 2018 YAIR HAYUT AND ASAF KARAGILA Abstract. We study some limitations and possible occurrences of uniform ultrafilters on ordinals without the
More informationarxiv: v2 [math.lo] 13 Feb 2014
A LOWER BOUND FOR GENERALIZED DOMINATING NUMBERS arxiv:1401.7948v2 [math.lo] 13 Feb 2014 DAN HATHAWAY Abstract. We show that when κ and λ are infinite cardinals satisfying λ κ = λ, the cofinality of the
More informationGeneric embeddings associated to an indestructibly weakly compact cardinal
Generic embeddings associated to an indestructibly weakly compact cardinal Gunter Fuchs Westfälische Wilhelms-Universität Münster gfuchs@uni-muenster.de December 4, 2008 Abstract I use generic embeddings
More informationTwo Stationary Sets with Different Gaps of the Power Function
Two Stationary Sets with Different Gaps of the Power Function Moti Gitik School of Mathematical Sciences Tel Aviv University Tel Aviv 69978, Israel gitik@post.tau.ac.il August 14, 2014 Abstract Starting
More informationLarge cardinals and the Continuum Hypothesis
Large cardinals and the Continuum Hypothesis RADEK HONZIK Charles University, Department of Logic, Celetná 20, Praha 1, 116 42, Czech Republic radek.honzik@ff.cuni.cz Abstract. This is a survey paper which
More informationThe Outer Model Programme
The Outer Model Programme Peter Holy University of Bristol presenting joint work with Sy Friedman and Philipp Lücke February 13, 2013 Peter Holy (Bristol) Outer Model Programme February 13, 2013 1 / 1
More informationCardinal characteristics at κ in a small u(κ) model
Cardinal characteristics at κ in a small u(κ) model A. D. Brooke-Taylor a, V. Fischer b,, S. D. Friedman b, D. C. Montoya b a School of Mathematics, University of Bristol, University Walk, Bristol, BS8
More informationOn Singular Stationarity I (mutual stationarity and ideal-based methods)
On Singular Stationarity I (mutual stationarity and ideal-based methods) Omer Ben-Neria Abstract We study several ideal-based constructions in the context of singular stationarity. By combining methods
More informationA Laver-like indestructibility for hypermeasurable cardinals
Radek Honzik Charles University, Department of Logic, Celetná 20, Praha 1, 116 42, Czech Republic radek.honzik@ff.cuni.cz The author was supported by FWF/GAČR grant I 1921-N25. Abstract: We show that if
More informationCardinal arithmetic: The Silver and Galvin-Hajnal Theorems
B. Zwetsloot Cardinal arithmetic: The Silver and Galvin-Hajnal Theorems Bachelor thesis 22 June 2018 Thesis supervisor: dr. K.P. Hart Leiden University Mathematical Institute Contents Introduction 1 1
More informationCOMBINATORICS AT ℵ ω
COMBINATORICS AT ℵ ω DIMA SINAPOVA AND SPENCER UNGER Abstract. We construct a model in which the singular cardinal hypothesis fails at ℵ ω. We use characterizations of genericity to show the existence
More informationarxiv: v1 [math.lo] 27 Mar 2009
arxiv:0903.4691v1 [math.lo] 27 Mar 2009 COMBINATORIAL AND MODEL-THEORETICAL PRINCIPLES RELATED TO REGULARITY OF ULTRAFILTERS AND COMPACTNESS OF TOPOLOGICAL SPACES. V. PAOLO LIPPARINI Abstract. We generalize
More informationRUDIN-KEISLER POSETS OF COMPLETE BOOLEAN ALGEBRAS
RUDIN-KEISLER POSETS OF COMPLETE BOOLEAN ALGEBRAS PETER JIPSEN, ALEXANDER PINUS, HENRY ROSE Abstract. The Rudin-Keisler ordering of ultrafilters is extended to complete Boolean algebras and characterised
More informationAxiomatization of generic extensions by homogeneous partial orderings
Axiomatization of generic extensions by homogeneous partial orderings a talk at Colloquium on Mathematical Logic (Amsterdam Utrecht) May 29, 2008 (Sakaé Fuchino) Chubu Univ., (CRM Barcelona) (2008 05 29
More informationEaston s theorem and large cardinals from the optimal hypothesis
Easton s theorem and large cardinals from the optimal hypothesis SY-DAVID FRIEDMAN and RADEK HONZIK Kurt Gödel Research Center for Mathematical Logic, Währinger Strasse 25, 1090 Vienna Austria sdf@logic.univie.ac.at
More informationDeterminacy models and good scales at singular cardinals
Determinacy models and good scales at singular cardinals University of California, Irvine Logic in Southern California University of California, Los Angeles November 15, 2014 After submitting the title
More informationLOCAL CLUB CONDENSATION AND L-LIKENESS
LOCAL CLUB CONDENSATION AND L-LIKENESS PETER HOLY, PHILIP WELCH, AND LIUZHEN WU Abstract. We present a forcing to obtain a localized version of Local Club Condensation, a generalized Condensation principle
More informationarxiv: v1 [math.lo] 26 Mar 2014
A FRAMEWORK FOR FORCING CONSTRUCTIONS AT SUCCESSORS OF SINGULAR CARDINALS arxiv:1403.6795v1 [math.lo] 26 Mar 2014 JAMES CUMMINGS, MIRNA DŽAMONJA, MENACHEM MAGIDOR, CHARLES MORGAN, AND SAHARON SHELAH Abstract.
More informationShort Extenders Forcings II
Short Extenders Forcings II Moti Gitik July 24, 2013 Abstract A model with otp(pcf(a)) = ω 1 + 1 is constructed, for countable set a of regular cardinals. 1 Preliminary Settings Let κ α α < ω 1 be an an
More informationNORMAL MEASURES ON A TALL CARDINAL. 1. Introduction We start by recalling the definitions of some large cardinal properties.
NORMAL MEASRES ON A TALL CARDINAL ARTHR. APTER AND JAMES CMMINGS Abstract. e study the number of normal measures on a tall cardinal. Our main results are that: The least tall cardinal may coincide with
More informationCONSECUTIVE SINGULAR CARDINALS AND THE CONTINUUM FUNCTION
CONSECUTIVE SINGULAR CARDINALS AND THE CONTINUUM FUNCTION ARTHUR W. APTER AND BRENT CODY Abstract. We show that from a supercompact cardinal κ, there is a forcing extension V [G] that has a symmetric inner
More informationBest response cycles in perfect information games
P. Jean-Jacques Herings, Arkadi Predtetchinski Best response cycles in perfect information games RM/15/017 Best response cycles in perfect information games P. Jean Jacques Herings and Arkadi Predtetchinski
More informationNon replication of options
Non replication of options Christos Kountzakis, Ioannis A Polyrakis and Foivos Xanthos June 30, 2008 Abstract In this paper we study the scarcity of replication of options in the two period model of financial
More information2. The ultrapower construction
2. The ultrapower construction The study of ultrapowers originates in model theory, although it has found applications both in algebra and in analysis. However, it is accurate to say that it is mainly
More informationHEIKE MILDENBERGER AND SAHARON SHELAH
A VERSION OF κ-miller FORCING HEIKE MILDENBERGER AND SAHARON SHELAH Abstract. Let κ be an uncountable cardinal such that 2 ω, 2 2
More informationOn almost precipitous ideals.
On almost precipitous ideals. Asaf Ferber and Moti Gitik July 21, 2008 Abstract We answer questions concerning an existence of almost precipitous ideals raised in [5]. It is shown that every successor
More informationANNALES ACADEMIÆ SCIENTIARUM FENNICÆ DIAMONDS ON LARGE CARDINALS
ANNALES ACADEMIÆ SCIENTIARUM FENNICÆ MATHEMATICA DISSERTATIONES 134 DIAMONDS ON LARGE CARDINALS ALEX HELLSTEN University of Helsinki, Department of Mathematics HELSINKI 2003 SUOMALAINEN TIEDEAKATEMIA Copyright
More informationarxiv:math/ v1 [math.lo] 15 Jan 1991
ON A CONJECTURE OF TARSKI ON PRODUCTS OF CARDINALS arxiv:math/9201247v1 [mathlo] 15 Jan 1991 Thomas Jech 1 and Saharon Shelah 2 Abstract 3 We look at an old conjecture of A Tarski on cardinal arithmetic
More informationFat subsets of P kappa (lambda)
Boston University OpenBU Theses & Dissertations http://open.bu.edu Boston University Theses & Dissertations 2013 Fat subsets of P kappa (lambda) Zaigralin, Ivan https://hdl.handle.net/2144/14099 Boston
More informationThe Resurrection Axioms
The Resurrection Axioms Thomas Johnstone New York City College of Technology, CUNY and Kurt Gödel Research Center, Vienna tjohnstone@citytech.cuny.edu http://www.logic.univie.ac.at/~tjohnstone/ Young Set
More information3 The Model Existence Theorem
3 The Model Existence Theorem Although we don t have compactness or a useful Completeness Theorem, Henkinstyle arguments can still be used in some contexts to build models. In this section we describe
More informationHod up to AD R + Θ is measurable
Hod up to AD R + Θ is measurable Rachid Atmai Department of Mathematics University of North Texas General Academics Building 435 1155 Union Circle #311430 Denton, TX 76203-5017 atmai.rachid@gmail.com Grigor
More informationOn Singular Stationarity II (tight stationarity and extenders-based methods)
On Singular Stationarity II (tight stationarity and extenders-based methods) Omer Ben-Neria Abstract We study the notion of tightly stationary sets which was introduced by Foreman and Magidor in [8]. We
More informationSQUARES, ASCENT PATHS, AND CHAIN CONDITIONS
SQUARES, ASCENT PATHS, AND CHAIN CONDITIONS CHRIS LAMBIE-HANSON AND PHILIPP LÜCKE Abstract. With the help of various square principles, we obtain results concerning the consistency strength of several
More informationWähringer Strasse 25, 1090 Vienna Austria
The tree property at ℵ ω+2 with a finite gap Sy-David Friedman, 1 Radek Honzik, 2 Šárka Stejskalová 2 1 Kurt Gödel Research Center for Mathematical Logic, Währinger Strasse 25, 1090 Vienna Austria sdf@logic.univie.ac.at
More informationChromatic number of infinite graphs
Chromatic number of infinite graphs Jerusalem, October 2015 Introduction [S] κ = {x S : x = κ} [S]
More informationClosed Maximality Principles: Implications, Separations and Combinations
Closed Maximality Principles: Implications, Separations and Combinations Gunter Fuchs Institut für Mathematische Logik und Grundlagenforschung Westfälische Wilhelms-Universität Münster Einsteinstr. 62
More informationTHE TREE PROPERTY UP TO ℵ ω+1
THE TREE PROPERTY UP TO ℵ ω+1 ITAY NEEMAN Abstract. Assuming ω supercompact cardinals we force to obtain a model where the tree property holds both at ℵ ω+1, and at ℵ n for all 2 n < ω. A model with the
More informationSHIMON GARTI AND SAHARON SHELAH
(κ, θ)-weak NORMALITY SHIMON GARTI AND SAHARON SHELAH Abstract. We deal with the property of weak normality (for nonprincipal ultrafilters). We characterize the situation of Q λ i/d = λ. We have an application
More informationPARTITIONS OF 2 ω AND COMPLETELY ULTRAMETRIZABLE SPACES
PARTITIONS OF 2 ω AND COMPLETELY ULTRAMETRIZABLE SPACES WILLIAM R. BRIAN AND ARNOLD W. MILLER Abstract. We prove that, for every n, the topological space ω ω n (where ω n has the discrete topology) can
More informationTABLEAU-BASED DECISION PROCEDURES FOR HYBRID LOGIC
TABLEAU-BASED DECISION PROCEDURES FOR HYBRID LOGIC THOMAS BOLANDER AND TORBEN BRAÜNER Abstract. Hybrid logics are a principled generalization of both modal logics and description logics. It is well-known
More informationTHE TREE PROPERTY AT ALL REGULAR EVEN CARDINALS
THE TREE PROPERTY AT ALL REGULAR EVEN CARDINALS MOHAMMAD GOLSHANI Abstract. Assuming the existence of a strong cardinal and a measurable cardinal above it, we construct a model of ZFC in which for every
More informationGödel algebras free over finite distributive lattices
TANCL, Oxford, August 4-9, 2007 1 Gödel algebras free over finite distributive lattices Stefano Aguzzoli Brunella Gerla Vincenzo Marra D.S.I. D.I.COM. D.I.C.O. University of Milano University of Insubria
More informationNew tools of set-theoretic homological algebra and their applications to modules
New tools of set-theoretic homological algebra and their applications to modules Jan Trlifaj Univerzita Karlova, Praha Workshop on infinite-dimensional representations of finite dimensional algebras Manchester,
More informationNotes on getting presaturation from collapsing a Woodin cardinal
Notes on getting presaturation from collapsing a Woodin cardinal Paul B. Larson November 18, 2012 1 Measurable cardinals 1.1 Definition. A filter on a set X is a set F P(X) which is closed under intersections
More informationTHE FIRST MEASURABLE CARDINAL CAN BE THE FIRST UNCOUNTABLE REGULAR CARDINAL AT ANY SUCCESSOR HEIGHT
THE FIRST MEASURABLE CARDINAL CAN BE THE FIRST UNCOUNTABLE REGULAR CARDINAL AT ANY SUCCESSOR HEIGHT ARTHUR W. APTER, IOANNA M. DIMITRÍOU, AND PETER KOEPKE Abstract. We use techniques due to Moti Gitik
More information