Bounding the consistency strength of a five element linear basis

DOI10.1007/s11856-008-0018-1zbMath1143.03025OpenAlexW1974650377MaRDI QIDQ940736

Justin Tatch Moore, Bernhard König, Paul B. Larson, Boban Velickovic

Publication date: 3 September 2008

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11856-008-0018-1

zbMATH Keywords

consistency strengthAronszajn treefive-element basisProper Forcing Axiomuncountable linear orders

Mathematics Subject Classification ID

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

Related Items (2)

A direct proof of the five element basis theorem ⋮ CHAIN CONDITIONS OF PRODUCTS, AND WEAKLY COMPACT CARDINALS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A five element basis for the uncountable linear orders
• Isomorphism types of Aronszajn trees
• Bases for Aronszajn trees
• Martin's maximum, saturated ideals, and nonregular ultrafilters. I
• Topics in set theory. Lebesgue measurability, large cardinals, forcing axioms, rho-functions
• Decomposing uncountable squares to countably many chains
• A new class of order types
• The bounded proper forcing axiom
• LIPSCHITZ MAPS ON TREES
• SET MAPPING REFLECTION

This page was built for publication: Bounding the consistency strength of a five element linear basis