Switch to: Citations

Add references

You must login to add references.
  1. Class forcing, the forcing theorem and Boolean completions.Peter Holy, Regula Krapf, Philipp Lücke, Ana Njegomir & Philipp Schlicht - 2016 - Journal of Symbolic Logic 81 (4):1500-1530.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Long projective wellorderings.Leo Harrington - 1977 - Annals of Mathematical Logic 12 (1):1.
    Download  
     
    Export citation  
     
    Bookmark   30 citations  
  • Coding the Universe.A. Beller, R. Jensen & P. Welch - 1982 - Cambridge University Press.
    Axiomatic set theory is the concern of this book. More particularly, the authors prove results about the coding of models M, of Zermelo-Fraenkel set theory together with the Generalized Continuum Hypothesis by using a class 'forcing' construction. By this method they extend M to another model L[a] with the same properties. L[a] is Gödels universe of 'constructible' sets L, together with a set of integers a which code all the cardinality and cofinality structure of M. Some applications are also considered. (...)
    Download  
     
    Export citation  
     
    Bookmark   13 citations