Switch to: Citations

Add references

You must login to add references.
  1. Large cardinals and definable counterexamples to the continuum hypothesis.Matthew Foreman & Menachem Magidor - 1995 - Annals of Pure and Applied Logic 76 (1):47-97.
    In this paper we consider whether L(R) has “enough information” to contain a counterexample to the continuum hypothesis. We believe this question provides deep insight into the difficulties surrounding the continuum hypothesis. We show sufficient conditions for L(R) not to contain such a counterexample. Along the way we establish many results about nonstationary towers, non-reflecting stationary sets, generalizations of proper and semiproper forcing and Chang's conjecture.
    Download  
     
    Export citation  
     
    Bookmark   41 citations  
  • Aronszajn trees and the independence of the transfer property.William Mitchell - 1972 - Annals of Mathematical Logic 5 (1):21.
    Download  
     
    Export citation  
     
    Bookmark   94 citations  
  • Aronszajn trees on ℵ2 and ℵ3.Uri Abraham - 1983 - Annals of Mathematical Logic 24 (3):213-230.
    Assuming the existence of a supercompact cardinal and a weakly compact cardinal above it, we provide a generic extension where there are no Aronszajn trees of height ω 2 or ω 3 . On the other hand we show that some large cardinal assumptions are necessary for such a consistency result.
    Download  
     
    Export citation  
     
    Bookmark   37 citations  
  • Aronszajn trees and the successors of a singular cardinal.Spencer Unger - 2013 - Archive for Mathematical Logic 52 (5-6):483-496.
    From large cardinals we obtain the consistency of the existence of a singular cardinal κ of cofinality ω at which the Singular Cardinals Hypothesis fails, there is a bad scale at κ and κ ++ has the tree property. In particular this model has no special κ +-trees.
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • The tree property at successors of singular cardinals.Menachem Magidor & Saharon Shelah - 1996 - Archive for Mathematical Logic 35 (5-6):385-404.
    Assuming some large cardinals, a model of ZFC is obtained in which $\aleph_{\omega+1}$ carries no Aronszajn trees. It is also shown that if $\lambda$ is a singular limit of strongly compact cardinals, then $\lambda^+$ carries no Aronszajn trees.
    Download  
     
    Export citation  
     
    Bookmark   38 citations  
  • Saharon Shelah, Cardinal Arithmetic. [REVIEW]Saharon Shelah - 1998 - Studia Logica 60 (3):443-448.
    Download  
     
    Export citation  
     
    Bookmark   59 citations  
  • The fine structure of the constructible hierarchy.R. Björn Jensen - 1972 - Annals of Mathematical Logic 4 (3):229.
    Download  
     
    Export citation  
     
    Bookmark   270 citations  
  • Notes on Singular Cardinal Combinatorics.James Cummings - 2005 - Notre Dame Journal of Formal Logic 46 (3):251-282.
    We present a survey of combinatorial set theory relevant to the study of singular cardinals and their successors. The topics covered include diamonds, squares, club guessing, forcing axioms, and PCF theory.
    Download  
     
    Export citation  
     
    Bookmark   23 citations  
  • Some exact equiconsistency results in set theory.Leo Harrington & Saharon Shelah - 1985 - Notre Dame Journal of Formal Logic 26 (2):178-188.
    Download  
     
    Export citation  
     
    Bookmark   44 citations  
  • Reflecting stationary sets and successors of singular cardinals.Saharon Shelah - 1991 - Archive for Mathematical Logic 31 (1):25-53.
    REF is the statement that every stationary subset of a cardinal reflects, unless it fails to do so for a trivial reason. The main theorem, presented in Sect. 0, is that under suitable assumptions it is consistent that REF and there is a κ which is κ+n -supercompact. The main concepts defined in Sect. 1 are PT, which is a certain statement about the existence of transversals, and the “bad” stationary set. It is shown that supercompactness (and even the failure (...)
    Download  
     
    Export citation  
     
    Bookmark   41 citations  
  • (1 other version)A new class of order types.James E. Baumgartner - 1976 - Annals of Mathematical Logic 9 (3):187-222.
    Download  
     
    Export citation  
     
    Bookmark   32 citations  
  • Aronszajn trees on [aleph]2 and [aleph]3.Uri Abraham - 1983 - Annals of Mathematical Logic 24 (3):213.
    Download  
     
    Export citation  
     
    Bookmark   34 citations