Switch to: References

Add citations

You must login to add citations.
  1. Chang’s Conjecture with $$square {omega 1, 2}$$ □ ω 1, 2 from an $$omega _1$$ ω 1 -Erdős cardinal.Itay Neeman & John Susice - 2020 - Archive for Mathematical Logic 59 (7-8):893-904.
    Answering a question of Sakai :29–45, 2013), we show that the existence of an ω1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\omega _1$$\end{document}-Erdős cardinal suffices to obtain the consistency of Chang’s Conjecture with □ω1,2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\square _{\omega _1, 2}$$\end{document}. By a result of Donder, volume 872 of lecture notes in mathematics. Springer, Berlin, pp 55–97, 1981) this is best possible. We also give an answer to another question of Sakai relating to (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • A variant of Shelah's characterization of Strong Chang's Conjecture.Sean Cox & Hiroshi Sakai - 2019 - Mathematical Logic Quarterly 65 (2):251-257.
    Download  
     
    Export citation  
     
    Bookmark  
  • Two Upper Bounds on Consistency Strength of $negsquare{aleph{omega}}$ and Stationary Set Reflection at Two Successive $aleph_{n}$.Martin Zeman - 2017 - Notre Dame Journal of Formal Logic 58 (3):409-432.
    We give modest upper bounds for consistency strengths for two well-studied combinatorial principles. These bounds range at the level of subcompact cardinals, which is significantly below a κ+-supercompact cardinal. All previously known upper bounds on these principles ranged at the level of some degree of supercompactness. We show that by using any of the standard modified Prikry forcings it is possible to turn a measurable subcompact cardinal into ℵω and make the principle □ℵω,<ω fail in the generic extension. We also (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • The ⁎-variation of the Banach–Mazur game and forcing axioms.Yasuo Yoshinobu - 2017 - Annals of Pure and Applied Logic 168 (6):1335-1359.
    Download  
     
    Export citation  
     
    Bookmark  
  • 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  
  • Two applications of finite side conditions at omega _2.Itay Neeman - 2017 - Archive for Mathematical Logic 56 (7-8):983-1036.
    We present two applications of forcing with finite sequences of models as side conditions, adding objects of size \. The first involves adding a \ sequence and variants of such sequences. The second involves adding partial weak specializing functions for trees of height \.
    Download  
     
    Export citation  
     
    Bookmark   4 citations