On iterating semiproper preorders

Journal of Symbolic Logic 67 (4):1431-1468 (2002)
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
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2178/jsl/1190150293
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 24,392
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA
Chaz Schlindwein (1993). Simplified RCS Iterations. Archive for Mathematical Logic 32 (5):341-349.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

138 ( #31,422 of 1,924,703 )

Recent downloads (6 months)

1 ( #417,761 of 1,924,703 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.