Switch to: Citations

Add references

You must login to add references.
  1. The fine structure of the constructible hierarchy.R. Björn Jensen - 1972 - Annals of Mathematical Logic 4 (3):229.
    Download  
     
    Export citation  
     
    Bookmark   269 citations  
  • Aronszajn trees and the independence of the transfer property.William Mitchell - 1972 - Annals of Mathematical Logic 5 (1):21.
    Download  
     
    Export citation  
     
    Bookmark   93 citations  
  • On the Consistency of Some Partition Theorems for Continuous Colorings, and the Structure of ℵ 1 -Dense Real Order Types.J. Steprans, Uri Abraham, Matatyahu Rubin & Saharon Shelah - 2002 - Bulletin of Symbolic Logic 8 (2):303.
    We present some techniques in c.c.c. forcing, and apply them to prove consistency results concerning the isomorphism and embeddability relations on the family of ℵ 1 -dense sets of real numbers. In this direction we continue the work of Baumgartner [2] who proved the axiom BA stating that every two ℵ 1 -dense subsets of R are isomorphic, is consistent. We e.g. prove Con). Let K H , be the set of order types of ℵ 1 -dense homogeneous subsets of (...)
    Download  
     
    Export citation  
     
    Bookmark   33 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   33 citations  
  • Saturated ideals.Kenneth Kunen - 1978 - Journal of Symbolic Logic 43 (1):65-76.
    Download  
     
    Export citation  
     
    Bookmark   43 citations  
  • On the History of Souslin's Problem.Carlos Alvarez - 1999 - Archive for History of Exact Sciences 54 (3):181-242.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • A new class of order types.James E. Baumgartner - 1976 - Annals of Mathematical Logic 9 (3):187-222.
    Download  
     
    Export citation  
     
    Bookmark   32 citations  
  • Colouring and non-productivity of ℵ2-C.C.Saharon Shelah - 1997 - Annals of Pure and Applied Logic 84 (2):153-174.
    We prove that colouring of pairs from 2 with strong properties exists. The easiest to state problem it solves is: there are two topological spaces with cellularity 1 whose product has cellularity 2; equivalently, we can speak of cellularity of Boolean algebras or of Boolean algebras satisfying the 2-c.c. whose product fails the 2-c.c. We also deal more with guessing of clubs.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Club-guessing, stationary reflection, and coloring theorems.Todd Eisworth - 2010 - Annals of Pure and Applied Logic 161 (10):1216-1243.
    We obtain very strong coloring theorems at successors of singular cardinals from failures of certain instances of simultaneous reflection of stationary sets. In particular, the simplest of our results establishes that if μ is singular and , then there is a regular cardinal θ<μ such that any fewer than cf stationary subsets of must reflect simultaneously.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • μ-complete Souslin trees on μ+.Menachem Kojman & Saharon Shelah - 1993 - Archive for Mathematical Logic 32 (3):195-201.
    We prove thatµ=µ <µ , 2 µ =µ + and “there is a non-reflecting stationary subset ofµ + composed of ordinals of cofinality <μ” imply that there is a μ-complete Souslin tree onµ +.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Narrow boolean algebras.Robert Bonnet & Saharon Shelah - 1985 - Annals of Pure and Applied Logic 28 (1):1-12.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Colouring and non-productivity of ℵ2-cc.Saharon Shelah - 1997 - Annals of Pure and Applied Logic 84 (2):153-174.
    We prove that colouring of pairs from 2 with strong properties exists. The easiest to state problem it solves is: there are two topological spaces with cellularity 1 whose product has cellularity 2; equivalently, we can speak of cellularity of Boolean algebras or of Boolean algebras satisfying the 2-c.c. whose product fails the 2-c.c. We also deal more with guessing of clubs.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Getting more colors II.Todd Eisworth - 2013 - Journal of Symbolic Logic 78 (1):17-38.
    We formulate and prove (in ZFC) a strong coloring theorem which holds at successors of singular cardinals, and use it to answer several questions concerning Shelah's principle $Pr_1(\mu^+,\mu^+,\mu^+,cf(\mu))$ for singular $\mu$.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Jensen's □ principles and the Novak number of partially ordered sets.Boban Veličković - 1986 - Journal of Symbolic Logic 51 (1):47-58.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Strong negative partition above the continuum.Saharon Shelah - 1990 - Journal of Symbolic Logic 55 (1):21-31.
    Download  
     
    Export citation  
     
    Bookmark   1 citation