Switch to: References

Add citations

You must login to add citations.
  1. Shelah's work on non-semi-proper iterations, II.Chaz Schlindwein - 2001 - Journal of Symbolic Logic 66 (4):1865-1883.
  • Consistency of suslin's hypothesis, a nonspecial Aronszajn tree, and GCH.Chaz Schlindwein - 1994 - Journal of Symbolic Logic 59 (1):1-29.
  • On iterating semiproper preorders.Tadatoshi Miyamoto - 2002 - Journal of Symbolic Logic 67 (4):1431-1468.
    Let T be an $\omega_{1}-Souslin$ tree. We show the property of forcing notions; "is $\lbrace\omega_{1}\rbrace-semi-proper$ and preserves T" is preserved by a new kind of revised countable support iteration of arbitrary length. As an application we have a forcing axiom which is compatible with the existence of an $\omega_{1}-Souslin$ tree for preorders as wide as possible.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   2 citations