Switch to: References

Add citations

You must login to add citations.
  1. 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  
  • 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  
  • The approachability ideal without a maximal set.John Krueger - 2019 - Annals of Pure and Applied Logic 170 (3):297-382.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Club isomorphisms on higher Aronszajn trees.John Krueger - 2018 - Annals of Pure and Applied Logic 169 (10):1044-1081.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • 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.
    Download  
     
    Export citation  
     
    Bookmark  
  • Mitchell's theorem revisited.Thomas Gilton & John Krueger - 2017 - Annals of Pure and Applied Logic 168 (5):922-1016.
    Download  
     
    Export citation  
     
    Bookmark   1 citation