Switch to: References

Add citations

You must login to add citations.
  1. Small universal families for graphs omitting cliques without GCH.Katherine Thompson - 2010 - Archive for Mathematical Logic 49 (7-8):799-811.
    When no single universal model for a set of structures exists at a given cardinal, then one may ask in which models of set theory does there exist a small family which embeds the rest. We show that for λ+-graphs (λ regular) omitting cliques of some finite or uncountable cardinality, it is consistent that there are small universal families and 2λ > λ+. In particular, we get such a result for triangle-free graphs.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  • Perfect subsets of generalized baire spaces and long games.Philipp Schlicht - 2017 - Journal of Symbolic Logic 82 (4):1317-1355.
    We extend Solovay’s theorem about definable subsets of the Baire space to the generalized Baire spaceλλ, whereλis an uncountable cardinal withλ<λ= λ. In the first main theorem, we show that the perfect set property for all subsets ofλλthat are definable from elements ofλOrd is consistent relative to the existence of an inaccessible cardinal aboveλ. In the second main theorem, we introduce a Banach–Mazur type game of lengthλand show that the determinacy of this game, for all subsets ofλλthat are definable from (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • More about λ-support iterations of (<λ)-complete forcing notions.Andrzej Rosłanowski & Saharon Shelah - 2013 - Archive for Mathematical Logic 52 (5-6):603-629.
    This article continues Rosłanowski and Shelah (Int J Math Math Sci 28:63–82, 2001; Quaderni di Matematica 17:195–239, 2006; Israel J Math 159:109–174, 2007; 2011; Notre Dame J Formal Logic 52:113–147, 2011) and we introduce here a new property of (<λ)-strategically complete forcing notions which implies that their λ-support iterations do not collapse λ + (for a strongly inaccessible cardinal λ).
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  • Higher Miller forcing may collapse cardinals.Heike Mildenberger & Saharon Shelah - 2021 - Journal of Symbolic Logic 86 (4):1721-1744.
    We show that it is independent whether club $\kappa $ -Miller forcing preserves $\kappa ^{++}$. We show that under $\kappa ^{ \kappa $, club $\kappa $ -Miller forcing collapses $\kappa ^{<\kappa }$ to $\kappa $. Answering a question by Brendle, Brooke-Taylor, Friedman and Montoya, we show that the iteration of ultrafilter $\kappa $ -Miller forcing does not have the Laver property.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Baire numbers, uncountable Cohen sets and perfect-set forcing.Avner Landver - 1992 - Journal of Symbolic Logic 57 (3):1086-1107.
  • Independence of Boolean algebras and forcing.Miloš S. Kurilić - 2003 - Annals of Pure and Applied Logic 124 (1-3):179-191.
    If κω is a cardinal, a complete Boolean algebra is called κ-dependent if for each sequence bβ: β<κ of elements of there exists a partition of the unity, P, such that each pP extends bβ or bβ′, for κ-many βκ. The connection of this property with cardinal functions, distributivity laws, forcing and collapsing of cardinals is considered.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • Definable minimal collapse functions at arbitrary projective levels.Vladimir Kanovei & Vassily Lyubetsky - 2019 - Journal of Symbolic Logic 84 (1):266-289.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • Indestructibility of some compactness principles over models of PFA.Radek Honzik, Chris Lambie-Hanson & Šárka Stejskalová - 2024 - Annals of Pure and Applied Logic 175 (1):103359.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Global singularization and the failure of SCH.Radek Honzik - 2010 - Annals of Pure and Applied Logic 161 (7):895-915.
    We say that κ is μ-hypermeasurable for a cardinal μ≥κ+ if there is an embedding j:V→M with critical point κ such that HV is included in M and j>μ. Such a j is called a witnessing embedding.Building on the results in [7], we will show that if V satisfies GCH and F is an Easton function from the regular cardinals into cardinals satisfying some mild restrictions, then there exists a cardinal-preserving forcing extension V* where F is realised on all V-regular (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • A Lifting Argument for the Generalized Grigorieff Forcing.Radek Honzík & Jonathan Verner - 2016 - Notre Dame Journal of Formal Logic 57 (2):221-231.
    In this short paper, we describe another class of forcing notions which preserve measurability of a large cardinal $\kappa$ from the optimal hypothesis, while adding new unbounded subsets to $\kappa$. In some ways these forcings are closer to the Cohen-type forcings—we show that they are not minimal—but, they share some properties with treelike forcings. We show that they admit fusion-type arguments which allow for a uniform lifting argument.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • A Laver-like indestructibility for hypermeasurable cardinals.Radek Honzik - 2019 - Archive for Mathematical Logic 58 (3-4):275-287.
    We show that if \ is \\)-hypermeasurable for some cardinal \ with \ \le \mu \) and GCH holds, then we can extend the universe by a cofinality-preserving forcing to obtain a model \ in which the \\)-hypermeasurability of \ is indestructible by the Cohen forcing at \ of any length up to \ is \\)-hypermeasurable in \). The preservation of hypermeasurability is useful for subsequent arguments. The construction of \ is based on the ideas of Woodin and Cummings :1–39, (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • The tree property at the ℵ 2 n 's and the failure of SCH at ℵ ω.Sy-David Friedman & Radek Honzik - 2015 - Annals of Pure and Applied Logic 166 (4):526-552.
  • The tree property at א ω+2.Sy-David Friedman & Ajdin Halilović - 2011 - Journal of Symbolic Logic 76 (2):477 - 490.
    Assuming the existence of a weakly compact hypermeasurable cardinal we prove that in some forcing extension א ω is a strong limit cardinal and א ω+2 has the tree property. This improves a result of Matthew Foreman (see [2]).
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  • Some recent developments in higher recursion theory.Sy D. Friedman - 1983 - Journal of Symbolic Logic 48 (3):629-642.
    In recent years higher recursion theory has experienced a deep interaction with other areas of logic, particularly set theory (fine structure, forcing, and combinatorics) and infinitary model theory. In this paper we wish to illustrate this interaction by surveying the progress that has been made in two areas: the global theory of the κ-degrees and the study of closure ordinals.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • Regularity properties on the generalized reals.Sy David Friedman, Yurii Khomskii & Vadim Kulikov - 2016 - Annals of Pure and Applied Logic 167 (4):408-430.
  • Perfect trees and elementary embeddings.Sy-David Friedman & Katherine Thompson - 2008 - Journal of Symbolic Logic 73 (3):906-918.
    An important technique in large cardinal set theory is that of extending an elementary embedding j: M → N between inner models to an elementary embedding j*: M[G] → N[G*] between generic extensions of them. This technique is crucial both in the study of large cardinal preservation and of internal consistency. In easy cases, such as when forcing to make the GCH hold while preserving a measurable cardinal (via a reverse Easton iteration of α-Cohen forcing for successor cardinals α), the (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  • Fusion and large cardinal preservation.Sy-David Friedman, Radek Honzik & Lyubomyr Zdomskyy - 2013 - Annals of Pure and Applied Logic 164 (12):1247-1273.
    In this paper we introduce some fusion properties of forcing notions which guarantee that an iteration with supports of size ⩽κ not only does not collapse κ+ but also preserves the strength of κ. This provides a general theory covering the known cases of tree iterations which preserve large cardinals [3], Friedman and Halilović [5], Friedman and Honzik [6], Friedman and Magidor [8], Friedman and Zdomskyy [10], Honzik [12]).
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  • Eastonʼs theorem and large cardinals from the optimal hypothesis.Sy-David Friedman & Radek Honzik - 2012 - Annals of Pure and Applied Logic 163 (12):1738-1747.
    The equiconsistency of a measurable cardinal with Mitchell order o=κ++ with a measurable cardinal such that 2κ=κ++ follows from the results by W. Mitchell [13] and M. Gitik [7]. These results were later generalized to measurable cardinals with 2κ larger than κ++ .In Friedman and Honzik [5], we formulated and proved Eastonʼs theorem [4] in a large cardinal setting, using slightly stronger hypotheses than the lower bounds identified by Mitchell and Gitik , for a suitable μ, instead of the cardinals (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  • Easton’s theorem and large cardinals.Sy-David Friedman & Radek Honzik - 2008 - Annals of Pure and Applied Logic 154 (3):191-208.
    The continuum function αmaps to2α on regular cardinals is known to have great freedom. Let us say that F is an Easton function iff for regular cardinals α and β, image and α<β→F≤F. The classic example of an Easton function is the continuum function αmaps to2α on regular cardinals. If GCH holds then any Easton function is the continuum function on regular cardinals of some cofinality-preserving extension V[G]; we say that F is realised in V[G]. However if we also wish (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  • An inner model for global domination.Sy-David Friedman & Katherine Thompson - 2009 - Journal of Symbolic Logic 74 (1):251-264.
    In this paper it is shown that the global statement that the dominating number for k is less than $2^k $ for all regular k, is internally consistent, given the existence of $0^\# $ . The possible range of values for the dominating number for k and $2^k $ which may be simultaneously true in an inner model is also explored.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • κ-Stationary Subsets of Pκ+Λ, Infinitary Games, and Distributive Laws in Boolean Algebras.Natasha Dobrinen - 2008 - Journal of Symbolic Logic 73 (1):238 - 260.
    We characterize the (κ, Λ, < μ)-distributive law in Boolean algebras in terms of cut and choose games $\scr{G}_{<\mu}^{\kappa}(\lambda)$ , when μ ≤ κ ≤ Λ and κ<κ = κ. This builds on previous work to yield game-theoretic characterizations of distributive laws for almost all triples of cardinals κ, Λ, μ with μ ≤ Λ, under GCH. In the case when μ ≤ κ ≤ Λ and κ<κ = κ, we show that it is necessary to consider whether the κ-stationarity (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  • Perfect tree forcings for singular cardinals.Natasha Dobrinen, Dan Hathaway & Karel Prikry - 2020 - Annals of Pure and Applied Logic 171 (9):102827.
  • Layered Posets and Kunen’s Universal Collapse.Sean Cox - 2019 - Notre Dame Journal of Formal Logic 60 (1):27-60.
    We develop the theory of layered posets and use the notion of layering to prove a new iteration theorem is κ-cc, as long as direct limits are used sufficiently often. This iteration theorem simplifies and generalizes the various chain condition arguments for universal Kunen iterations in the literature on saturated ideals, especially in situations where finite support iterations are not possible. We also provide two applications:1 For any n≥1, a wide variety of <ωn−1-closed, ωn+1-cc posets of size ωn+1 can consistently (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • Easton’s theorem in the presence of Woodin cardinals.Brent Cody - 2013 - Archive for Mathematical Logic 52 (5-6):569-591.
    Under the assumption that δ is a Woodin cardinal and GCH holds, I show that if F is any class function from the regular cardinals to the cardinals such that (1) ${\kappa < {\rm cf}(F(\kappa))}$ , (2) ${\kappa < \lambda}$ implies ${F(\kappa) \leq F(\lambda)}$ , and (3) δ is closed under F, then there is a cofinality-preserving forcing extension in which 2 γ = F(γ) for each regular cardinal γ < δ, and in which δ remains Woodin. Unlike the analogous (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  • Strong Measure Zero Sets on for Inaccessible.Nick Steven Chapman & Johannes Philipp Schürz - forthcoming - Journal of Symbolic Logic:1-31.
    We investigate the notion of strong measure zero sets in the context of the higher Cantor space $2^\kappa $ for $\kappa $ at least inaccessible. Using an iteration of perfect tree forcings, we give two proofs of the relative consistency of $$\begin{align*}|2^\kappa| = \kappa^{++} + \forall X \subseteq 2^\kappa:\ X \textrm{ is strong measure zero if and only if } |X| \leq \kappa^+. \end{align*}$$ Furthermore, we also investigate the stronger notion of stationary strong measure zero and show that the equivalence (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark