Switch to: References

Add citations

You must login to add citations.
  1. The downward directed grounds hypothesis and very large cardinals.Toshimichi Usuba - 2017 - Journal of Mathematical Logic 17 (2):1750009.
    A transitive model M of ZFC is called a ground if the universe V is a set forcing extension of M. We show that the grounds ofV are downward set-directed. Consequently, we establish some fundamental theorems on the forcing method and the set-theoretic geology. For instance, the mantle, the intersection of all grounds, must be a model of ZFC. V has only set many grounds if and only if the mantle is a ground. We also show that if the universe (...)
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • Set-theoretic geology.Gunter Fuchs, Joel David Hamkins & Jonas Reitz - 2015 - Annals of Pure and Applied Logic 166 (4):464-501.
    Download  
     
    Export citation  
     
    Bookmark   30 citations  
  • Strong tree properties for small cardinals.Laura Fontanella - 2013 - Journal of Symbolic Logic 78 (1):317-333.
    An inaccessible cardinal $\kappa$ is supercompact when $(\kappa, \lambda)$-ITP holds for all $\lambda\geq \kappa$. We prove that if there is a model of ZFC with infinitely many supercompact cardinals, then there is a model of ZFC where for every $n\geq 2$ and $\mu\geq \aleph_n$, we have $(\aleph_n, \mu)$-ITP.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Specialising Trees with Small Approximations I.Rahman Mohammadpour - forthcoming - Journal of Symbolic Logic:1-24.
    Assuming $\mathrm{PFA}$, we shall use internally club $\omega _1$ -guessing models as side conditions to show that for every tree T of height $\omega _2$ without cofinal branches, there is a proper and $\aleph _2$ -preserving forcing notion with finite conditions which specialises T. Moreover, the forcing has the $\omega _1$ -approximation property.
    Download  
     
    Export citation  
     
    Bookmark  
  • Characterizing large cardinals in terms of layered posets.Sean Cox & Philipp Lücke - 2017 - Annals of Pure and Applied Logic 168 (5):1112-1131.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Guessing models and the approachability ideal.Rahman Mohammadpour & Boban Veličković - 2020 - Journal of Mathematical Logic 21 (2):2150003.
    Starting with two supercompact cardinals we produce a generic extension of the universe in which a principle that we call GM+ holds. This principle implies ISP and ISP, and hence th...
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Indestructible Strong Unfoldability.Joel David Hamkins & Thomas A. Johnstone - 2010 - Notre Dame Journal of Formal Logic 51 (3):291-321.
    Using the lottery preparation, we prove that any strongly unfoldable cardinal $\kappa$ can be made indestructible by all.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Superstrong and other large cardinals are never Laver indestructible.Joan Bagaria, Joel David Hamkins, Konstantinos Tsaprounis & Toshimichi Usuba - 2016 - Archive for Mathematical Logic 55 (1-2):19-35.
    Superstrong cardinals are never Laver indestructible. Similarly, almost huge cardinals, huge cardinals, superhuge cardinals, rank-into-rank cardinals, extendible cardinals, 1-extendible cardinals, 0-extendible cardinals, weakly superstrong cardinals, uplifting cardinals, pseudo-uplifting cardinals, superstrongly unfoldable cardinals, Σn-reflecting cardinals, Σn-correct cardinals and Σn-extendible cardinals are never Laver indestructible. In fact, all these large cardinal properties are superdestructible: if κ exhibits any of them, with corresponding target θ, then in any forcing extension arising from nontrivial strategically <κ-closed forcing Q∈Vθ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • A general Mitchell style iteration.John Krueger - 2008 - Mathematical Logic Quarterly 54 (6):641-651.
    We work out the details of a schema for a mixed support forcing iteration, which generalizes the Mitchell model [7] with no Aronszajn trees on ω2.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Namba forcing, weak approximation, and guessing.Sean Cox & John Krueger - 2018 - Journal of Symbolic Logic 83 (4):1539-1565.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Fragility and indestructibility II.Spencer Unger - 2015 - Annals of Pure and Applied Logic 166 (11):1110-1122.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Borel reductions and cub games in generalised descriptive set theory.Vadim Kulikov - 2013 - Journal of Symbolic Logic 78 (2):439-458.
    It is shown that the power set of $\kappa$ ordered by the subset relation modulo various versions of the non-stationary ideal can be embedded into the partial order of Borel equivalence relations on $2^\kappa$ under Borel reducibility. Here $\kappa$ is an uncountable regular cardinal with $\kappa^{<\kappa}=\kappa$.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Quotients of strongly proper forcings and guessing models.Sean Cox & John Krueger - 2016 - Journal of Symbolic Logic 81 (1):264-283.
    Download  
     
    Export citation  
     
    Bookmark   7 citations