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

DOI10.1007/BF02761942zbMath0513.03023OpenAlexW2003575709MaRDI QIDQ1050337

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Corrigendum to ``Generalized Martin's axiom and Souslin's hypothesis for higher cardinals, 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)], On the cardinality of Lindelöf spaces with points \(G_ \delta\), Weakly Compact Cardinals and Nonspecial Aronszajn Trees, Some results on higher Suslin trees, Higher Souslin trees and the GCH, revisited, On constructions with 2-cardinals, Morasses, square and forcing axioms, A Forcing Axiom Deciding the Generalized Souslin Hypothesis, Morasses, semimorasses and supercompact ultrafilters, On a generalization of Jensen's □_κ, and strategic closure of partial orders, A theorem and some consistency results in partition calculus, Partition relations for successor cardinals, Laver and set theory, Models with second order properties. IV. A general method and eliminating diamonds, Generalized Martin's axiom and Souslin's hypothesis for higher cardinals, On the existence of strong chains in ℘(ω₁)/Fin, Simplified morasses

Cites Work