Switch to: Citations

Add references

You must login to add references.
  1. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   64 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   102 citations  
  • On the existence of large subsets of [λ] κ which contain no unbounded non-stationary subsets.Saharon Shelah - 2002 - Archive for Mathematical Logic 41 (3):207-213.
    Here we deal with some problems posed by Matet. The first section deals with the existence of stationary subsets of [λ]<κ with no unbounded subsets which are not stationary, where, of course, κ is regular uncountable ≤λ. In the second section we deal with the existence of such clubs. The proofs are easy but the result seems to be very surprising. Theorem 1.2 was proved some time ago by Baumgartner (see Theorem 2.3 of [Jo88]) and is presented here for the (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • On strong compactness and supercompactness.Telis K. Menas - 1975 - Annals of Mathematical Logic 7 (4):327.
    Download  
     
    Export citation  
     
    Bookmark   36 citations  
  • A Model in Which GCH Holds at Successors but Fails at Limits.James Cummings, Matthew Foreman & Menachem Magidor - 2002 - Bulletin of Symbolic Logic 8 (4):550-552.
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • On strong compactness and supercompactness.Telis K. Menas - 1975 - Annals of Mathematical Logic 7 (4):327-359.
    Download  
     
    Export citation  
     
    Bookmark   67 citations  
  • Canonical structure in the universe of set theory: part one.James Cummings, Matthew Foreman & Menachem Magidor - 2004 - Annals of Pure and Applied Logic 129 (1-3):211-243.
    We start by studying the relationship between two invariants isolated by Shelah, the sets of good and approachable points. As part of our study of these invariants, we prove a form of “singular cardinal compactness” for Jensen's square principle. We then study the relationship between internally approachable and tight structures, which parallels to a certain extent the relationship between good and approachable points. In particular we characterise the tight structures in terms of PCF theory and use our characterisation to prove (...)
    Download  
     
    Export citation  
     
    Bookmark   21 citations  
  • Game ideals.Pierre Matet - 2009 - Annals of Pure and Applied Logic 158 (1-2):23-39.
    We study a normal ideal on Pκ that is defined in terms of games.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Combinatorial characterization of $\Pi^11$ -indescribability in $P{\kappa}\lambda$.Yoshihiro Abe - 1998 - Archive for Mathematical Logic 37 (4):261-272.
    It is proved that $\Pi^1_1$ -indescribability in $P_{\kappa}\lambda$ can be characterized by combinatorial properties without taking care of cofinality of $\lambda$ . We extend Carr's theorem proving that the hypothesis $\kappa$ is $2^{\lambda^{<\kappa}}$ -Shelah is rather stronger than $\kappa$ is $\lambda$ -supercompact.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Weak saturation of ideals on Pκ(λ).Pierre Matet - 2011 - Mathematical Logic Quarterly 57 (2):149-165.
    We show that if κ is an infinite successor cardinal, and λ > κ a cardinal of cofinality less than κ satisfying certain conditions, then no ideal on Pκ is weakly λ+-saturated. © 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • The Magidor function and diamond.Pierre Matet - 2011 - Journal of Symbolic Logic 76 (2):405 - 417.
    Let κ be a regular uncountable cardinal and λ be a cardinal greater than κ. We show that if 2 <κ ≤ M(κ, λ), then ◇ κ,λ holds, where M(κ, λ) equals $\lambda ^{\aleph }0$ if cf(λ) ≥ κ, and $(\lambda ^{+})^{\aleph _{0}}$ otherwise.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • A Power Function with a Fixed Finite Gap Everywhere.Carmi Merimovich - 2007 - Journal of Symbolic Logic 72 (2):361 - 417.
    We give an application of the extender based Radin forcing to cardinal arithmetic. Assuming κ is a large enough cardinal we construct a model satisfying 2κ = κ⁺ⁿ together with 2λ = λ⁺ⁿ for each cardinal λ < κ, where 0 < n < ω. The cofinality of κ can be set arbitrarily or κ can remain inaccessible. When κ remains an inaccessible, Vκ is a model of ZFC satisfying 2λ = λ+n for all cardinals λ.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Bounds for Covering Numbers.Andreas Liu - 2006 - Journal of Symbolic Logic 71 (4):1303 - 1310.
    Let Λ be a singular cardinal of uncountable confinality ψ. Under various assumptions about the sizes of covering families for cardinals below Λ, we prove upper bounds for the covering number cov(Λ, Λ, v⁺, 2). This covering number is closely related to the cofinality of the partial order ([Λ]", ⊆).
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Strong Compactness and Stationary Sets.John Krueger - 2005 - Journal of Symbolic Logic 70 (3):767 - 777.
    We construct a model in which there is a strongly compact cardinal κ such that the set $S(\kappa,\kappa ^{+})=\{a\in P_{\kappa}\kappa ^{-}\colon o,t(a)=(a\cap \kappa)^{+}\})$ is non-stationary.
    Download  
     
    Export citation  
     
    Bookmark   2 citations