On iterating semiproper preorders
Journal of Symbolic Logic 67 (4):1431-1468 (2002)
Abstract
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 possibleDOI
10.2178/jsl/1190150293
My notes
Similar books and articles
A weak variation of Shelah's I[ω₂].William J. Mitchell - 2004 - Journal of Symbolic Logic 69 (1):94-100.
Ladder Gaps over Stationary Sets.Uri Abraham & Saharon Shelah - 2004 - Journal of Symbolic Logic 69 (2):518 - 532.
The bounded proper forcing axiom.Martin Goldstern & Saharon Shelah - 1995 - Journal of Symbolic Logic 60 (1):58-73.
Proper forcing, cardinal arithmetic, and uncountable linear orders.Justin Tatch Moore - 2005 - Bulletin of Symbolic Logic 11 (1):51-60.
Canonical seeds and Prikry trees.Joel David Hamkins - 1997 - Journal of Symbolic Logic 62 (2):373-396.
Souslin forcing.Jaime I. Ihoda & Saharon Shelah - 1988 - Journal of Symbolic Logic 53 (4):1188-1207.
Analytics
Added to PP
2009-01-28
Downloads
159 (#81,227)
6 months
1 (#455,921)
2009-01-28
Downloads
159 (#81,227)
6 months
1 (#455,921)
Historical graph of downloads
Citations of this work
Incompatible bounded category forcing axioms.David Asperó & Matteo Viale - 2022 - Journal of Mathematical Logic 22 (2).