Proper Forcing, Cardinal Arithmetic, and Uncountable Linear Orders

DOI10.2178/bsl/1107959499zbMath1095.03054MaRDI QIDQ3370627

Justin Tatch Moore

Publication date: 8 February 2006

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

Full work available at URL: https://doi.org/10.2178/bsl/1107959499

zbMATH Keywords

uncountable linear orders; Countryman line; Bounded Proper Forcing Axiom; consequences of the Proper Forcing Axiom; Singular Cardinals Hypothesis; well-ordering of the reals

Mathematics Subject Classification ID

03E05: Other combinatorial set theory

03E65: Other set-theoretic hypotheses and axioms

03E02: Partition relations

03E40: Other aspects of forcing and Boolean-valued models

Related Items

What do we need large cardinals for?

Cites Work

• Unnamed Item
• Isomorphism types of Aronszajn trees
• On the consistency of some partition theorems for continuous colorings, and the structure of \(\aleph _ 1\)-dense real order types
• Martin's maximum, saturated ideals, and nonregular ultrafilters. I
• Partitioning pairs of countable ordinals
• Forcing axioms and stationary sets
• Decomposing uncountable squares to countably many chains
• Bounded forcing axioms as principles of generic absoluteness
• Indexed squares
• Generic absoluteness and the continuum
• Partition Problems in Topology
• Projective Stationary Sets and a Strong Reflection Principle
• The bounded proper forcing axiom