Switch to: References

Add citations

You must login to add citations.
  1. Squares, ascent paths, and chain conditions.Chris Lambie-Hanson & Philipp Lücke - 2018 - Journal of Symbolic Logic 83 (4):1512-1538.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  • Knaster and Friends III: Subadditive Colorings.Chris Lambie-Hanson & Assaf Rinot - 2023 - Journal of Symbolic Logic 88 (3):1230-1280.
    We continue our study of strongly unbounded colorings, this time focusing on subadditive maps. In Part I of this series, we showed that, for many pairs of infinite cardinals $\theta < \kappa $, the existence of a strongly unbounded coloring $c:[\kappa ]^2 \rightarrow \theta $ is a theorem of $\textsf{ZFC}$. Adding the requirement of subadditivity to a strongly unbounded coloring is a significant strengthening, though, and here we see that in many cases the existence of a subadditive strongly unbounded coloring (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Local saturation and square everywhere.Monroe Eskew - 2020 - Journal of Mathematical Logic 20 (3):2050019.
    We show that it is consistent relative to a huge cardinal that for all infinite cardinals [Formula: see text], [Formula: see text] holds and there is a stationary [Formula: see text] such that [Formula: see text] is [Formula: see text]-saturated.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • More Notions of Forcing Add a Souslin Tree.Ari Meir Brodsky & Assaf Rinot - 2019 - Notre Dame Journal of Formal Logic 60 (3):437-455.
    An ℵ1-Souslin tree is a complicated combinatorial object whose existence cannot be decided on the grounds of ZFC alone. But fifteen years after Tennenbaum and Jech independently devised notions of forcing for introducing such a tree, Shelah proved that already the simplest forcing notion—Cohen forcing—adds an ℵ1-Souslin tree. In this article, we identify a rather large class of notions of forcing that, assuming a GCH-type hypothesis, add a λ+-Souslin tree. This class includes Prikry, Magidor, and Radin forcing.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • A microscopic approach to Souslin-tree constructions, Part I.Ari Meir Brodsky & Assaf Rinot - 2017 - Annals of Pure and Applied Logic 168 (11):1949-2007.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  • A microscopic approach to Souslin-tree construction, Part II.Ari Meir Brodsky & Assaf Rinot - 2021 - Annals of Pure and Applied Logic 172 (5):102904.
    In Part I of this series, we presented the microscopic approach to Souslin-tree constructions, and argued that all known ⋄-based constructions of Souslin trees with various additional properties may be rendered as applications of our approach. In this paper, we show that constructions following the same approach may be carried out even in the absence of ⋄. In particular, we obtain a new weak sufficient condition for the existence of Souslin trees at the level of a strongly inaccessible cardinal. We (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations