Abstract
We show that many countable support iterations of proper forcings preserve Souslin trees. We establish sufficient conditions in terms of games and we draw connections to other preservation properties. We present a proof of preservation properties in countable support iterations in the so-called Case A that does not need a division into forcings that add reals and those who do not.
| Original language | English |
|---|---|
| Pages (from-to) | 573-608 |
| Number of pages | 36 |
| Journal | Annals of Pure and Applied Logic |
| Volume | 165 |
| Issue number | 2 |
| DOIs | |
| State | Published - Feb 2014 |
| Externally published | Yes |
Keywords
- Creature forcing
- Games played on forcing orders
- Non-elementary proper forcing
- Preservation theorems for trees on א