Simplified morasses with linear limits

DOI10.2307/2274257zbMath0575.03036OpenAlexW2084316293MaRDI QIDQ3693525

Dan Velleman

Publication date: 1984

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2274257

zbMATH Keywords

combinatorial structuremorassKurepa treerelative consistencyAronszajn subtreesCantor subtreesweak Rebholz's principle

Mathematics Subject Classification ID

Consistency and independence results (03E35) Other combinatorial set theory (03E05)

Related Items (11)

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)] ⋮ Semimorasses and nonreflection at singular cardinals ⋮ Strong coding ⋮ MITCHELL-INSPIRED FORCING, WITH SMALL WORKING PARTS AND COLLECTIONS OF MODELS OF UNIFORM SIZE AS SIDE CONDITIONS, AND GAP-ONE SIMPLIFIED MORASSES ⋮ Lindelöf models of the reals: solution to a problem of Sikorski ⋮ Morasses, square and forcing axioms ⋮ The short extenders gap three forcing using a morass ⋮ 2007 European Summer Meeting of the Association for Symbolic Logic: Logic Colloquium '07 ⋮ A theorem and some consistency results in partition calculus ⋮ Partition relations for successor cardinals ⋮ Simplified gap-2 morasses

Cites Work

• Generalized Martin's axiom and Souslin's hypothesis for higher cardinals
• Making the supercompactness of \(\nu\) indestructible under \(\nu\)-directed closed forcing
• On a generalization of Jensen's □_κ, and strategic closure of partial orders
• Trees, subtrees and order types
• A new class of order types
• Consistency proofs in model theory: A contribution to Jensenlehre
• Unnamed Item

This page was built for publication: Simplified morasses with linear limits