Morasses and finite support iterations

DOI10.1090/S0002-9939-08-09525-7zbMath1161.03027arXiv0810.5217MaRDI QIDQ3617601

Bernhard Irrgang

Publication date: 30 March 2009

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0810.5217

zbMATH Keywords

chain conditionSuslin treeccc forcingforcing along a simplified morass

Mathematics Subject Classification ID

Consistency and independence results (03E35) Other combinatorial set theory (03E05) Other aspects of forcing and Boolean-valued models (03E40)

Related Items (1)

On constructions with 2-cardinals

Cites Work

• Simplified gap-2 morasses
• Remarks on superatomic Boolean algebras
• Partitioning pairs of countable ordinals
• Set theory. An introduction to independence proofs
• Forcing axioms and stationary sets
• Fine structure and class forcing
• On strong chains of uncountable functions
• How to force a countably tight, initially \(\omega_ 1\)-compact and noncompact space?
• Morasses, square and forcing axioms
• Iterated Cohen extensions and Souslin's problem
• Free sequences
• Simplified morasses
• Directed Sets and Cofinal Types
• Gap-2 morasses of height ω
• Partition Problems in Topology
• Higher gap morasses, Ia: Gap-two morasses and condensation
• An 𝜔₂-minimal Boolean algebra
• SOUSLIN'S PROBLEM
• A consistency result on thin-very tall Boolean algebras
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Morasses and finite support iterations