Switch to: References

Add citations

You must login to add citations.
  1. Rado’s Conjecture and its Baire version.Jing Zhang - 2019 - Journal of Mathematical Logic 20 (1):1950015.
    Rado’s Conjecture is a compactness/reflection principle that says any nonspecial tree of height ω1 has a nonspecial subtree of size ℵ1. Though incompatible with Martin’s Axiom, Rado’s Conjecture turns out to have many interesting consequences that are also implied by certain forcing axioms. In this paper, we obtain consistency results concerning Rado’s Conjecture and its Baire version. In particular, we show that a fragment of PFA, which is the forcing axiom for Baire Indestructibly Proper forcings, is compatible with the Baire (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Complicated colorings, revisited.Assaf Rinot & Jing Zhang - 2023 - Annals of Pure and Applied Logic 174 (4):103243.
    Download  
     
    Export citation  
     
    Bookmark  
  • Knaster and friends II: The C-sequence number.Chris Lambie-Hanson & Assaf Rinot - 2020 - Journal of Mathematical Logic 21 (1):2150002.
    Motivated by a characterization of weakly compact cardinals due to Todorcevic, we introduce a new cardinal characteristic, the C-sequence number, which can be seen as a measure of the compactness of a regular uncountable cardinal. We prove a number of ZFC and independence results about the C-sequence number and its relationship with large cardinals, stationary reflection, and square principles. We then introduce and study the more general C-sequence spectrum and uncover some tight connections between the C-sequence spectrum and the strong (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Aronszajn trees, square principles, and stationary reflection.Chris Lambie-Hanson - 2017 - Mathematical Logic Quarterly 63 (3-4):265-281.
    We investigate questions involving Aronszajn trees, square principles, and stationary reflection. We first consider two strengthenings of introduced by Brodsky and Rinot for the purpose of constructing κ‐Souslin trees. Answering a question of Rinot, we prove that the weaker of these strengthenings is compatible with stationary reflection at κ but the stronger is not. We then prove that, if μ is a singular cardinal, implies the existence of a special ‐tree with a cf(μ)‐ascent path, thus answering a question of Lücke.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Stationary reflection.Yair Hayut & Spencer Unger - 2020 - Journal of Symbolic Logic 85 (3):937-959.
    We improve the upper bound for the consistency strength of stationary reflection at successors of singular cardinals.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Separating diagonal stationary reflection principles.Gunter Fuchs & Chris Lambie-Hanson - 2021 - Journal of Symbolic Logic 86 (1):262-292.
    We introduce three families of diagonal reflection principles for matrices of stationary sets of ordinals. We analyze both their relationships among themselves and their relationships with other known principles of simultaneous stationary reflection, the strong reflection principle, and the existence of square sequences.
    Download  
     
    Export citation  
     
    Bookmark   3 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  
  • Hierarchies of resurrection axioms.Gunter Fuchs - 2018 - Journal of Symbolic Logic 83 (1):283-325.
    I analyze the hierarchies of the bounded resurrection axioms and their “virtual” versions, the virtual bounded resurrection axioms, for several classes of forcings. I analyze these axioms in terms of implications and consistency strengths. For the virtual hierarchies, I provide level-by-level equiconsistencies with an appropriate hierarchy of virtual partially super-extendible cardinals. I show that the boldface resurrection axioms for subcomplete or countably closed forcing imply the failure of Todorčević’s square at the appropriate level. I also establish connections between these hierarchies (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Two-Cardinal Derived Topologies, Indescribability and Ramseyness.Brent Cody, Chris Lambie-Hanson & Jing Zhang - forthcoming - Journal of Symbolic Logic:1-29.
    We introduce a natural two-cardinal version of Bagaria’s sequence of derived topologies on ordinals. We prove that for our sequence of two-cardinal derived topologies, limit points of sets can be characterized in terms of a new iterated form of pairwise simultaneous reflection of certain kinds of stationary sets, the first few instances of which are often equivalent to notions related to strong stationarity, which has been studied previously in the context of strongly normal ideals. The non-discreteness of these two-cardinal derived (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Forcing a □(κ)-like principle to hold at a weakly compact cardinal.Brent Cody, Victoria Gitman & Chris Lambie-Hanson - 2021 - Annals of Pure and Applied Logic 172 (7):102960.
    Download  
     
    Export citation  
     
    Bookmark   2 citations