Switch to: References

Add citations

You must login to add citations.
  1. Understanding preservation theorems, II.Chaz Schlindwein - 2010 - Mathematical Logic Quarterly 56 (5):549-560.
    We present an exposition of much of Sections VI.3 and XVIII.3 from Shelah's book Proper and Improper Forcing. This covers numerous preservation theorems for countable support iterations of proper forcing, including preservation of the property “no new random reals over V ”, the property “reals of the ground model form a non-meager set”, the property “every dense open set contains a dense open set of the ground model”, and preservation theorems related to the weak bounding property, the weak ωω -bounding (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Understanding preservation theorems: chapter VI of Proper and Improper Forcing, I.Chaz Schlindwein - 2014 - Archive for Mathematical Logic 53 (1-2):171-202.
    We present an exposition of Section VI.1 and most of Section VI.2 from Shelah’s book Proper and Improper Forcing. These sections offer proofs of the preservation under countable support iteration of proper forcing of various properties, including proofs that ωω\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\omega^\omega}$$\end{document} -bounding, the Sacks property, the Laver property, and the P-point property are preserved by countable support iteration of proper forcing.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Many countable support iterations of proper forcings preserve Souslin trees.Heike Mildenberger & Saharon Shelah - 2014 - Annals of Pure and Applied Logic 165 (2):573-608.
    We show that many countable support iterations of proper forcings preserve Souslin trees. We establish sufficient conditions in terms of games and we draw connections to other preservation properties. We present a proof of preservation properties in countable support iterations in the so-called Case A that does not need a division into forcings that add reals and those who do not.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  • A Sacks real out of nowhere.Jakob Kellner & Saharon Shelah - 2010 - Journal of Symbolic Logic 75 (1):51-76.
    There is a proper countable support iteration of length ω adding no new reals at finite stages and adding a Sacks real in the limit.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark