Many countable support iterations of proper forcings preserve Souslin trees

Heike Mildenberger*, Saharon Shelah

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

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 languageEnglish
Pages (from-to)573-608
Number of pages36
JournalAnnals of Pure and Applied Logic
Volume165
Issue number2
DOIs
StatePublished - Feb 2014
Externally publishedYes

Keywords

  • Creature forcing
  • Games played on forcing orders
  • Non-elementary proper forcing
  • Preservation theorems for trees on א

Fingerprint

Dive into the research topics of 'Many countable support iterations of proper forcings preserve Souslin trees'. Together they form a unique fingerprint.

Cite this