Many countable support iterations of proper forcings preserve Souslin trees
DOI10.1016/j.apal.2013.08.002zbMath1323.03060arXiv1309.0196OpenAlexW2963629821MaRDI QIDQ386631
Heike Mildenberger, Saharon Shelah
Publication date: 10 December 2013
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.0196
creature forcinggames played on forcing ordersnon-elementary proper forcingpreservation theorems for trees on \(\aleph_1\)
Consistency and independence results (03E35) Other combinatorial set theory (03E05) Cardinal characteristics of the continuum (03E17) Other aspects of forcing and Boolean-valued models (03E40)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reasonable ultrafilters, again
- Cardinal invariants of the continuum and combinatorics on uncountable cardinals
- Near coherence of filters. III: A simplified consistency proof
- There may be simple \(P_{\aleph _ 1}\)- and \(P_{\aleph _ 2}\)-points and the Rudin-Keisler ordering may be downward directed
- Set theory. An introduction to independence proofs
- Specialising Aronszajn trees by countable approximations
- Proper Forcing
- The club principle and the distributivity number
- A Perfectly Normal Countably Compact Scattered Space which is not Strongly Zero-Dimensional
- Norms on possibilities. I. Forcing with trees and creatures
- Properness Without Elementaricity
- Non-elementary proper forcing
- New reals: Can live with them, can live without them
- Preserving preservation
- Sur un ensemble toujours de première catégorie qui est dépourvu de la propriété λ
This page was built for publication: Many countable support iterations of proper forcings preserve Souslin trees