Decomposing uncountable squares to countably many chains

DOI10.1016/0097-3165(76)90053-4zbMath0366.04009OpenAlexW2063598253WikidataQ29305744 ScholiaQ29305744MaRDI QIDQ1241443

Saharon Shelah

Publication date: 1976

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(76)90053-4

Mathematics Subject Classification ID

Other combinatorial set theory (03E05)

Related Items

Remarks in abstract model theory, Decomposing Aronszajn lines, Was Sierpinski right? I, Partitioning pairs of countable ordinals, What makes the continuum ℵ₂, A direct proof of the five element basis theorem, On minimal non-\(\sigma\)-scattered linear orders, The embedding structure for linearly ordered topological spaces, On the consistency strength of the proper forcing axiom, Developments from Ernst Specker's work in set theory, On uniquely homogeneous spaces, I, Bounding the consistency strength of a five element linear basis, \(\omega_1\) and \(-\omega_1\) may be the only minimal uncountable linear orders, Coherent trees that are not Countryman, A construction scheme for non-separable structures, On the homogeneity property for certain quantifier logics, Category forcings, 𝑀𝑀⁺⁺⁺, and generic absoluteness for the theory of strong forcing axioms, Aronszajn lines and the club filter, Proper Forcing, Cardinal Arithmetic, and Uncountable Linear Orders, Isomorphism types of Aronszajn trees, A method for constructing ordered continua

Cites Work

• Unnamed Item
• Model theory
• One hundred and two problems in mathematical logic
• Trees
• The fine structure of the constructible hierarchy