Switch to: Citations

Add references

You must login to add references.
  1. Sticks and clubs.Sakaé Fuchino, Saharon Shelah & Lajos Soukup - 1997 - Annals of Pure and Applied Logic 90 (1-3):57-77.
    We study combinatorial principles known as stick and club. Several variants of these principles and cardinal invariants connected to them are also considered. We introduce a new kind of side by-side product of partial orderings which we call pseudo-product. Using such products, we give several generic extensions where some of these principles hold together with ¬CH and Martin's axiom for countable p.o.-sets. An iterative version of the pseudo-product is used under an inaccessible cardinal to show the consistency of the club (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Set Theory: An Introduction to Independence Proofs.Kenneth Kunen - 1980 - North-Holland.
    Download  
     
    Export citation  
     
    Bookmark   169 citations  
  • There may be simple Pℵ1 and Pℵ2-points and the Rudin-Keisler ordering may be downward directed.Andreas Blass & Saharon Shelah - 1987 - Annals of Pure and Applied Logic 33 (C):213-243.
    Download  
     
    Export citation  
     
    Bookmark   47 citations  
  • A Δ22 well-order of the reals and incompactness of L.Uri Abraham & Saharon Shelah - 1993 - Annals of Pure and Applied Logic 59 (1):1-32.
    A forcing poset of size 221 which adds no new reals is described and shown to provide a Δ22 definable well-order of the reals . The encoding of this well-order is obtained by playing with products of Aronszajn trees: some products are special while other are Suslin trees. The paper also deals with the Magidor–Malitz logic: it is consistent that this logic is highly noncompact.
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • Proper and Improper Forcing.Péter Komjáath - 2000 - Studia Logica 64 (3):421-425.
    Download  
     
    Export citation  
     
    Bookmark   27 citations  
  • Proper and Improper Forcing.Péter Komjáath - 2000 - Bulletin of Symbolic Logic 6 (1):83-86.
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
  • Creatures on ω 1 and weak diamonds.Heike Mildenberger - 2009 - Journal of Symbolic Logic 74 (1):1-16.
    We specialise Aronszajn trees by an $\omega ^\omega $ -bounding forcing that adds reals. We work with creature forcings on uncountable spaces. As an application of these notions of forcing, we answer a question of Moore, Hrušák and Džamonja whether ◇(b) implies the existence of a Souslin tree in a negative way by showing that "◇∂ and every Aronszajn tree is special" is consistent relative to ZFC.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • 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  
  • Similar but not the same: Various versions of ♣ do not coincide.Mirna Džamonja & Saharon Shelah - 1999 - Journal of Symbolic Logic 64 (1):180 - 198.
    We consider various versions of the ♣ principle. This principle is a known consequence of $\lozenge$ . It is well known that $\lozenge$ is not sensitive to minor changes in its definition, e.g., changing the guessing requirement form "guessing exactly" to "guessing modulo a finite set". We show however, that this is not true for ♣. We consider some other variants of ♣ as well.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Set Theory: On the Structure of the Real Line.T. Bartoszyński & H. Judah - 1999 - Studia Logica 62 (3):444-445.
    Download  
     
    Export citation  
     
    Bookmark   88 citations  
  • Near coherence of filters. III. A simplified consistency proof.Andreas Blass & Saharon Shelah - 1989 - Notre Dame Journal of Formal Logic 30 (4):530-538.
    Download  
     
    Export citation  
     
    Bookmark   14 citations