S-forcing. I: a black-box theorem for morasses, with applications to super-Souslin trees

DOI10.1007/BF02761942zbMath0513.03023MaRDI QIDQ1050337

Saharon Shelah, Lee J. Stanley

Publication date: 1982

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

tree; forcing; morass; combinatorial set theory; consistent; combinatorial principles; constructible universe; Souslin subtrees; super-Souslin tree

Mathematics Subject Classification ID

03E35: Consistency and independence results

03E45: Inner models, including constructibility, ordinal definability, and core models

03E05: Other combinatorial set theory

03E40: Other aspects of forcing and Boolean-valued models

Related Items

On the cardinality of Lindelöf spaces with points \(G_ \delta\), Morasses, square and forcing axioms, On the existence of strong chains in ℘(ω₁)/Fin