Switch to: Citations

Add references

You must login to add references.
  1. Conjectures of Rado and Chang and special Aronszajn trees.Stevo Todorčević & Víctor Torres Pérez - 2012 - Mathematical Logic Quarterly 58 (4-5):342-347.
    We show that both Rado's Conjecture and strong Chang's Conjecture imply that there are no special ℵ2-Aronszajn trees if the Continuum Hypothesis fails. We give similar result for trees of higher heights and we also investigate the influence of Rado's Conjecture on square sequences.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  • Conjectures of Rado and Chang and special Aronszajn trees.Stevo Todorčević & Víctor Torres Pérez - 2012 - Mathematical Logic Quarterly 58 (4):342-347.
    We show that both Rado's Conjecture and strong Chang's Conjecture imply that there are no special ℵ2-Aronszajn trees if the Continuum Hypothesis fails. We give similar result for trees of higher heights and we also investigate the influence of Rado's Conjecture on square sequences.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  • Fresh subsets of ultrapowers.Assaf Shani - 2016 - Archive for Mathematical Logic 55 (5-6):835-845.
    Shelah and Stanley :887–897, 1988) constructed a κ+\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\kappa ^+$$\end{document}-Aronszjan tree with an ascent path using □κ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\square _{\kappa }$$\end{document}. We show that □κ,2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\square _{\kappa,2}$$\end{document} does not imply the existence of Aronszajn trees with ascent paths. The proof goes through an intermediate combinatorial principle, which we investigate further.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  • Combinatorial principles in the core model for one Woodin cardinal.Ernest Schimmerling - 1995 - Annals of Pure and Applied Logic 74 (2):153-201.
    We study the fine structure of the core model for one Woodin cardinal, building of the work of Mitchell and Steel on inner models of the form . We generalize to some combinatorial principles that were shown by Jensen to hold in L. We show that satisfies the statement: “□κ holds whenever κ the least measurable cardinal λ of order λ++”. We introduce a hierarchy of combinatorial principles □κ, λ for 1 λ κ such that □κ□κ, 1 □κ, λ □κ, (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   48 citations  
  • Chang’s Conjecture and weak square.Hiroshi Sakai - 2013 - Archive for Mathematical Logic 52 (1-2):29-45.
    We investigate how weak square principles are denied by Chang’s Conjecture and its generalizations. Among other things we prove that Chang’s Conjecture does not imply the failure of \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}, i.e. Chang’s Conjecture is consistent with \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}.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  • A relative of the approachability ideal, diamond and non-saturation.Assaf Rinot - 2010 - Journal of Symbolic Logic 75 (3):1035-1065.
    Let λ denote a singular cardinal. Zeman, improving a previous result of Shelah, proved that $\square _{\lambda}^{\ast}$ together with 2 λ = λ⁺ implies $\lozenge _{S}$ for every S ⊆ λ⁺ that reflects stationarily often. In this paper, for a set S ⊆ λ⁺, a normal subideal of the weak approachability ideal is introduced, and denoted by I[S; λ]. We say that the ideal is fat if it contains a stationary set. It is proved: 1. if I[S; λ] is fat, (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  • The Proper Forcing Axiom and the Singular Cardinal Hypothesis.Matteo Viale - 2006 - Journal of Symbolic Logic 71 (2):473 - 479.
    We show that the Proper Forcing Axiom implies the Singular Cardinal Hypothesis. The proof uses the reflection principle MRP introduced by Moore in [11].
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  • Reflecting stationary sets.Menachem Magidor - 1982 - Journal of Symbolic Logic 47 (4):755-771.
    We prove that the statement "For every pair A, B, stationary subsets of ω 2 , composed of points of cofinality ω, there exists an ordinal α such that both A ∩ α and $B \bigcap \alpha$ are stationary subsets of α" is equiconsistent with the existence of weakly compact cardinal. (This completes results of Baumgartner and Harrington and Shelah.) We also prove, assuming the existence of infinitely many supercompact cardinals, the statement "Every stationary subset of ω ω + 1 (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   33 citations  
  • Squares and covering matrices.Chris Lambie-Hanson - 2014 - Annals of Pure and Applied Logic 165 (2):673-694.
    Viale introduced covering matrices in his proof that SCH follows from PFA. In the course of the proof and subsequent work with Sharon, he isolated two reflection principles, CP and S, which, under certain circumstances, are satisfied by all covering matrices of a certain shape. Using square sequences, we construct covering matrices for which CP and S fail. This leads naturally to an investigation of square principles intermediate between □κ and □ for a regular cardinal κ. We provide a detailed (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  • Set Theory.Keith J. Devlin - 1981 - Journal of Symbolic Logic 46 (4):876-877.
    Direct download  
     
    Export citation  
     
    Bookmark   163 citations  
  • Simultaneous stationary reflection and square sequences.Yair Hayut & Chris Lambie-Hanson - 2017 - Journal of Mathematical Logic 17 (2):1750010.
    We investigate the relationship between weak square principles and simultaneous reflection of stationary sets.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  • Squares, scales and stationary reflection.James Cummings, Matthew Foreman & Menachem Magidor - 2001 - Journal of Mathematical Logic 1 (01):35-98.
    Since the work of Gödel and Cohen, which showed that Hilbert's First Problem was independent of the usual assumptions of mathematics, there have been a myriad of independence results in many areas of mathematics. These results have led to the systematic study of several combinatorial principles that have proven effective at settling many of the important independent statements. Among the most prominent of these are the principles diamond and square discovered by Jensen. Simultaneously, attempts have been made to find suitable (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   101 citations  
  • Scales, squares and reflection.James Cummings, Matthew Foreman & Menachem Magidor - 2001 - Journal of Mathematical Logic 1 (1):35-98.
    Since the work of Gödel and Cohen, which showed that Hilbert's First Problem was independent of the usual assumptions of mathematics, there have been a myriad of independence results in many areas of mathematics. These results have led to the systematic study of several combinatorial principles that have proven effective at settling many of the important independent statements. Among the most prominent of these are the principles diamond and square discovered by Jensen. Simultaneously, attempts have been made to find suitable (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   63 citations  
  • Set Theory.Thomas Jech - 1999 - Studia Logica 63 (2):300-300.
     
    Export citation  
     
    Bookmark   322 citations