Article contents
On iterating semiproper preorders
Published online by Cambridge University Press: 12 March 2014
Abstract
Let T be an ω1-Souslin tree. We show the property of forcing notions; “is {ω1}-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 ω1 -Souslin tree for preorders as wide as possible.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 2002
References
REFERENCES
- 4
- Cited by