Switch to: Citations

Add references

You must login to add references.
  1. Forcing with Sequences of Models of Two Types.Itay Neeman - 2014 - Notre Dame Journal of Formal Logic 55 (2):265-298.
    We present an approach to forcing with finite sequences of models that uses models of two types. This approach builds on earlier work of Friedman and Mitchell on forcing to add clubs in cardinals larger than $\aleph_{1}$, with finite conditions. We use the two-type approach to give a new proof of the consistency of the proper forcing axiom. The new proof uses a finite support forcing, as opposed to the countable support iteration in the standard proof. The distinction is important (...)
    Download  
     
    Export citation  
     
    Bookmark   24 citations  
  • (2 other versions)Set theory.Thomas Jech - 1981 - Journal of Symbolic Logic.
    Download  
     
    Export citation  
     
    Bookmark   120 citations  
  • (2 other versions)Set Theory.Thomas Jech - 1999 - Studia Logica 63 (2):300-300.
    Download  
     
    Export citation  
     
    Bookmark   329 citations  
  • Analytic ideals and their applications.Sławomir Solecki - 1999 - Annals of Pure and Applied Logic 99 (1-3):51-72.
    We study the structure of analytic ideals of subsets of the natural numbers. For example, we prove that for an analytic ideal I, either the ideal {X (Ω × Ω: En X ({0, 1,…,n} × Ω } is Rudin-Keisler below I, or I is very simply induced by a lower semicontinuous submeasure. Also, we show that the class of ideals induced in this manner by lsc submeasures coincides with Polishable ideals as well as analytic P-ideals. We study this class of (...)
    Download  
     
    Export citation  
     
    Bookmark   34 citations  
  • Adding Closed Unbounded Subsets of ω₂ with Finite Forcing.William J. Mitchell - 2005 - Notre Dame Journal of Formal Logic 46 (3):357-371.
    An outline is given of the proof that the consistency of a κ⁺-Mahlo cardinal implies that of the statement that I[ω₂] does not include any stationary subsets of Cof(ω₁). An additional discussion of the techniques of this proof includes their use to obtain a model with no ω₂-Aronszajn tree and to add an ω₂-Souslin tree with finite conditions.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Combinatorial dichotomies in set theory.Stevo Todorcevic - 2011 - Bulletin of Symbolic Logic 17 (1):1-72.
    We give an overview of a research line concentrated on finding to which extent compactness fails at the level of first uncountable cardinal and to which extent it could be recovered on some other perhaps not so large cardinal. While this is of great interest to set theorists, one of the main motivations behind this line of research is in its applicability to other areas of mathematics. We give some details about this and we expose some possible directions for further (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations