Switch to: Citations

Add references

You must login to add references.
  1. On the Hamkins approximation property.William J. Mitchell - 2006 - Annals of Pure and Applied Logic 144 (1-3):126-129.
    We give a short proof of a lemma which generalizes both the main lemma from the original construction in the author’s thesis of a model with no ω2-Aronszajn trees, and also the “Key Lemma” in Hamkins’ gap forcing theorems. The new lemma directly yields Hamkins’ newer lemma stating that certain forcing notions have the approximation property.
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • Forcing closed unbounded sets.Uri Abraham & Saharon Shelah - 1983 - Journal of Symbolic Logic 48 (3):643-657.
    We discuss the problem of finding forcing posets which introduce closed unbounded subsets to a given stationary set.
    Download  
     
    Export citation  
     
    Bookmark   30 citations  
  • Aronszajn trees and the independence of the transfer property.William Mitchell - 1972 - Annals of Mathematical Logic 5 (1):21.
    Download  
     
    Export citation  
     
    Bookmark   94 citations  
  • Large cardinals and definable counterexamples to the continuum hypothesis.Matthew Foreman & Menachem Magidor - 1995 - Annals of Pure and Applied Logic 76 (1):47-97.
    In this paper we consider whether L(R) has “enough information” to contain a counterexample to the continuum hypothesis. We believe this question provides deep insight into the difficulties surrounding the continuum hypothesis. We show sufficient conditions for L(R) not to contain such a counterexample. Along the way we establish many results about nonstationary towers, non-reflecting stationary sets, generalizations of proper and semiproper forcing and Chang's conjecture.
    Download  
     
    Export citation  
     
    Bookmark   41 citations  
  • Some applications of mixed support iterations.John Krueger - 2009 - Annals of Pure and Applied Logic 158 (1-2):40-57.
    We give some applications of mixed support forcing iterations to the topics of disjoint stationary sequences and internally approachable sets. In the first half of the paper we study the combinatorial content of the idea of a disjoint stationary sequence, including its relation to adding clubs by forcing, the approachability ideal, canonical structure, the proper forcing axiom, and properties related to internal approachability. In the second half of the paper we present some consistency results related to these ideas. We construct (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations