Switch to: Citations

Add references

You must login to add references.
  1. Canonical models for ℵ1-combinatorics.Saharon Shelah & Jindr̆ich Zapletal - 1999 - Annals of Pure and Applied Logic 98 (1-3):217-259.
    We define the property of Π2-compactness of a statement Φ of set theory, meaning roughly that the hard core of the impact of Φ on combinatorics of 1 can be isolated in a canonical model for the statement Φ. We show that the following statements are Π2-compact: “dominating NUMBER = 1,” “cofinality of the meager IDEAL = 1”, “cofinality of the null IDEAL = 1”, “bounding NUMBER = 1”, existence of various types of Souslin trees and variations on uniformity of (...)
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Homogeneous Boolean algebras with very nonsymmetric subalgebras.Sabine Koppelberg & J. Donald Monk - 1983 - Notre Dame Journal of Formal Logic 24 (3):353-356.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Degrees of rigidity for Souslin trees.Gunter Fuchs & Joel David Hamkins - 2009 - Journal of Symbolic Logic 74 (2):423-454.
    We investigate various strong notions of rigidity for Souslin trees, separating them under ♢ into a hierarchy. Applying our methods to the automorphism tower problem in group theory, we show under ♢ that there is a group whose automorphism tower is highly malleable by forcing.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • (1 other version)An variation for one souslin tree.Paul Larson - 1999 - Journal of Symbolic Logic 64 (1):81-98.
    We present a variation of the forcing S max as presented in Woodin [4]. Our forcing is a P max -style construction where each model condition selects one Souslin tree. In the extension there is a Souslin tree T G which is the direct limit of the selected Souslin trees in the models of the generic. In some sense, the generic extension is a maximal model of "there exists a minimal Souslin tree," with T G being this minimal tree. In (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Chain homogeneous Souslin algebras.Gido Scharfenberger-Fabian - 2011 - Mathematical Logic Quarterly 57 (6):591-610.
    Assuming Jensen's principle ◊+ we construct Souslin algebras all of whose maximal chains are pairwise isomorphic as total orders, thereby answering questions of Koppelberg and Todorčević.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • (1 other version)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