Morasses, square and forcing axioms

DOI10.1016/0168-0072(95)00060-7zbMath0869.03026OpenAlexW2017466879WikidataQ114684037 ScholiaQ114684037MaRDI QIDQ1923568

Yanyan Li

Publication date: 24 August 1997

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(95)00060-7

zbMATH Keywords

squareforcing axiomsmorassesTodorcevic function

Mathematics Subject Classification ID

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 (7)

MITCHELL-INSPIRED FORCING, WITH SMALL WORKING PARTS AND COLLECTIONS OF MODELS OF UNIFORM SIZE AS SIDE CONDITIONS, AND GAP-ONE SIMPLIFIED MORASSES ⋮ On constructions with 2-cardinals ⋮ A Gap Cohomology Group ⋮ On $\mathbb R$-embeddability of almost disjoint families and Akemann–Doner C$^*$-algebras ⋮ Morasses and finite support iterations ⋮ Forcings constructed along morasses ⋮ On the existence of strong chains in ℘(ω₁)/Fin

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A theorem and some consistency results in partition calculus
• Simplified gap-2 morasses
• Models with second order properties. V: A general principle
• S-forcing. I: a black-box theorem for morasses, with applications to super-Souslin trees
• Aronszajn trees and partitions
• Remarks on superatomic Boolean algebras
• Partitioning pairs of countable ordinals
• Forcing axioms and stationary sets
• Initial segments of the degrees of size \(\aleph _ 1\)
• A Remark on the Homogeneity of infinite Permutation Groups
• Universal structures in power ℵ₁
• Simplified morasses
• Simplified morasses with linear limits
• On the number of nonisomorphic models of an infinitary theory which has the infinitary order property. Part A
• On a combinatorial principle of Hajnal and Komjáth
• Trees, subtrees and order types
• Higher gap morasses, Ia: Gap-two morasses and condensation
• Partitioning pairs of countable sets of ordinals
• ω 3 ω 1 →(ω 3 ω 1 , 3) 2 Requires an Inaccessible

This page was built for publication: Morasses, square and forcing axioms