Switch to: References

Add citations

You must login to add citations.
  1. Equivalence of generics.Iian B. Smythe - 2022 - Archive for Mathematical Logic 61 (5):795-812.
    Given a countable transitive model of set theory and a partial order contained in it, there is a natural countable Borel equivalence relation on generic filters over the model; two are equivalent if they yield the same generic extension. We examine the complexity of this equivalence relation for various partial orders, focusing on Cohen and random forcing. We prove, among other results, that the former is an increasing union of countably many hyperfinite Borel equivalence relations, and hence is amenable, while (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Large cardinals beyond choice.Joan Bagaria, Peter Koellner & W. Hugh Woodin - 2019 - Bulletin of Symbolic Logic 25 (3):283-318.
    The HOD Dichotomy Theorem states that if there is an extendible cardinal, δ, then either HOD is “close” to V or HOD is “far” from V. The question is whether the future will lead to the first or the second side of the dichotomy. Is HOD “close” to V, or “far” from V? There is a program aimed at establishing the first alternative—the “close” side of the HOD Dichotomy. This is the program of inner model theory. In recent years the (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Hierarchies of forcing axioms, the continuum hypothesis and square principles.Gunter Fuchs - 2018 - Journal of Symbolic Logic 83 (1):256-282.
    I analyze the hierarchies of the bounded and the weak bounded forcing axioms, with a focus on their versions for the class of subcomplete forcings, in terms of implications and consistency strengths. For the weak hierarchy, I provide level-by-level equiconsistencies with an appropriate hierarchy of partially remarkable cardinals. I also show that the subcomplete forcing axiom implies Larson’s ordinal reflection principle atω2, and that its effect on the failure of weak squares is very similar to that of Martin’s Maximum.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • The subcompleteness of Magidor forcing.Gunter Fuchs - 2018 - Archive for Mathematical Logic 57 (3-4):273-284.
    It is shown that the Magidor forcing to collapse the cofinality of a measurable cardinal that carries a length \ sequence of normal ultrafilters, increasing in the Mitchell order, to \, is subcomplete.
    Download  
     
    Export citation  
     
    Bookmark   5 citations