9 found
Order:
  1. Shelah's Work on Non-Semi-Proper Iterations, II.Chaz Schlindwein - 2001 - Journal of Symbolic Logic 66 (4):1865-1883.
  2.  6
    A Short Proof of the Preservation of the Ωω‐Bounding Property.Chaz Schlindwein - 2004 - Mathematical Logic Quarterly 50 (1):29-32.
    There are two versions of the Proper Iteration Lemma. The stronger version can be used to give simpler proofs of iteration theorems . In this paper we give another demonstration of the fecundity of the stronger version by giving a short proof of Shelah's theorem on the preservation of the ωω-bounding property.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  3.  12
    Shelah’s Work on Non-Semi-Proper Iterations, I.Chaz Schlindwein - 2008 - Archive for Mathematical Logic 47 (6):579-606.
    In this paper, we give details of results of Shelah concerning iterated Namba forcing over a ground model of CH and iteration of P[W] where W is a stationary subset of ω 2 concentrating on points of countable cofinality.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  4.  46
    Consistency of Suslin's Hypothesis, a Nonspecial Aronszajn Tree, and GCH.Chaz Schlindwein - 1994 - Journal of Symbolic Logic 59 (1):1-29.
  5.  21
    Simplified RCS Iterations.Chaz Schlindwein - 1993 - Archive for Mathematical Logic 32 (5):341-349.
    We give a simplified treatment of revised countable support (RCS) forcing iterations, previously considered by Shelah (see [Sh, Chap. X]). In particular we prove the fundamental theorem of semi-proper forcing, which is due to Shelah: any RCS iteration of semi-proper posets is semi-proper.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  6.  20
    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 (7 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  7.  9
    Suslin's Hypothesis Does Not Imply Stationary Antichains.Chaz Schlindwein - 1993 - Annals of Pure and Applied Logic 64 (2):153-167.
    Schlindwein, C., Suslin's hypothesis does not imply stationary antichains, Annals of Pure and Applied Logic 64 153–167. Shelah has shown that Suslin's hypothesis does not imply every Aronszajn tree is special. We improve this result by constructing a model of Suslin's hypothesis in which some Aronszajn tree has no antichain whose levels constitute a stationary set. The main point is a new preservation theorem, the proof of which illustrates the usefulness of certain ideas in [8, Section 1].
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  8.  7
    SH Plus CH Does Not Imply Stationary Antichains.Chaz Schlindwein - 2003 - Annals of Pure and Applied Logic 124 (1-3):233-265.
    We build a model in which the continuum hypothesis and Suslin's hypothesis are true, yet there is an Aronszajn tree with no stationary antichain.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  9.  8
    Understanding Preservation Theorems: Chapter VI of Proper and Improper Forcing, I.Chaz Schlindwein - 2014 - Archive for Mathematical Logic 53 (1-2):171-202.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark