S-forcing. I: a black-box theorem for morasses, with applications to super-Souslin trees
Publication:1050337
DOI10.1007/BF02761942zbMath0513.03023OpenAlexW2003575709MaRDI QIDQ1050337
Saharon Shelah, Lee J. Stanley
Publication date: 1982
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02761942
treeforcingmorasscombinatorial set theoryconsistentcombinatorial principlesconstructible universeSouslin subtreessuper-Souslin tree
Consistency and independence results (03E35) Inner models, including constructibility, ordinal definability, and core models (03E45) Other combinatorial set theory (03E05) Other aspects of forcing and Boolean-valued models (03E40)
Related Items (18)
Cites Work
- Unnamed Item
- Models with second order properties. IV. A general method and eliminating diamonds
- Generalized Martin's axiom and Souslin's hypothesis for higher cardinals
- Aspects of constructibility
- Making the supercompactness of \(\nu\) indestructible under \(\nu\)-directed closed forcing
- The ℵ 2 \1-Souslin Hypothesis
- Higher Souslin trees and the generalized continuum hypothesis
- Consistency proofs in model theory: A contribution to Jensenlehre
- The fine structure of the constructible hierarchy
This page was built for publication: S-forcing. I: a black-box theorem for morasses, with applications to super-Souslin trees