S-forcing. I: a black-box theorem for morasses, with applications to super-Souslin trees
DOI10.1007/BF02761942zbMATH Open0513.03023OpenAlexW2003575709MaRDI QIDQ1050337FDOQ1050337
Authors: S. 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
treeforcingconsistentcombinatorial principlesmorassconstructible universecombinatorial set theorySouslin subtreessuper-Souslin tree
Other combinatorial set theory (03E05) Consistency and independence results (03E35) Other aspects of forcing and Boolean-valued models (03E40) Inner models, including constructibility, ordinal definability, and core models (03E45)
Cites Work
- The fine structure of the constructible hierarchy
- Making the supercompactness of \(\nu\) indestructible under \(\nu\)-directed closed forcing
- Title not available (Why is that?)
- Aspects of constructibility
- Consistency proofs in model theory: A contribution to Jensenlehre
- Higher Souslin trees and the generalized continuum hypothesis
- Generalized Martin's axiom and Souslin's hypothesis for higher cardinals
- The ℵ 2 \1-Souslin Hypothesis
- Models with second order properties. IV. A general method and eliminating diamonds
Cited In (18)
- Morasses, semimorasses and supercompact ultrafilters
- Models with second order properties. IV. A general method and eliminating diamonds
- Generalized Martin's axiom and Souslin's hypothesis for higher cardinals
- On constructions with 2-cardinals
- Corrigendum to ``Generalized Martin's axiom and Souslin's hypothesis for higher cardinals
- A Forcing Axiom Deciding the Generalized Souslin Hypothesis
- On the cardinality of Lindelöf spaces with points \(G_ \delta\)
- A theorem and some consistency results in partition calculus
- On the existence of strong chains in ℘(ω1)/Fin
- S-forcing. IIa: Adding diamonds and more applications: Coding sets, Arhangel'skii's problem and \({\mathcal L}[Q_ 1^{<\omega},Q^ 1_ 2]\). (With an appendix by John P. Burgess)
- Some results on higher Suslin trees
- Morasses, square and forcing axioms
- On a generalization of Jensen's □κ, and strategic closure of partial orders
- Higher Souslin trees and the GCH, revisited
- Partition relations for successor cardinals
- Laver and set theory
- Weakly Compact Cardinals and Nonspecial Aronszajn Trees
- Simplified morasses
This page was built for publication: S-forcing. I: a black-box theorem for morasses, with applications to super-Souslin trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1050337)
