Decomposing uncountable squares to countably many chains
From MaRDI portal
Cites work
Cited in
(26)- Isomorphism types of Aronszajn trees
- A method for constructing ordered continua
- Remarks in abstract model theory
- Was Sierpinski right? I
- Partitioning pairs of countable ordinals
- On the homogeneity property for certain quantifier logics
- \(\omega_1\) and \(-\omega_1\) may be the only minimal uncountable linear orders
- Category forcings, \(\mathsf{MM}^{+++}\), and generic absoluteness for the theory of strong forcing axioms
- Proper Forcing, Cardinal Arithmetic, and Uncountable Linear Orders
- Aronszajn lines and the club filter
- The embedding structure for linearly ordered topological spaces
- Developments from Ernst Specker's work in set theory
- On uniquely homogeneous spaces, I
- A direct proof of the five element basis theorem
- Coherent trees that are not Countryman
- A construction scheme for non-separable structures
- What makes the continuum ℵ₂
- Decomposing Aronszajn lines
- On minimal non--scattered linear orders
- On the consistency strength of the proper forcing axiom
- More minimal non-\(\sigma\)-scattered linear orders
- Construction schemes: transferring structures from to _1
- Weakly and strongly reversible spaces
- Set theory. Abstracts from the workshop held January 12--17, 2025
- Partial orders of bijectively related or homeomorphic topologies
- Bounding the consistency strength of a five element linear basis
This page was built for publication: Decomposing uncountable squares to countably many chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1241443)
