A model with Suslin trees but no minimal uncountable linear orders other than \(\omega_1\) and \(- \omega_1\)
From MaRDI portal
Publication:2327970
DOI10.1007/S11856-019-1899-XzbMath1445.03056arXiv1803.03583OpenAlexW2960278316MaRDI QIDQ2327970
Publication date: 8 October 2019
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1803.03583
Consistency and independence results (03E35) Total orders (06A05) Other combinatorial set theory (03E05)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Many countable support iterations of proper forcings preserve Souslin trees
- Set theory. An introduction to independence proofs. 2nd print
- A five element basis for the uncountable linear orders
- Isomorphism types of Aronszajn trees
- Partitioning pairs of countable ordinals
- Whitehead groups may be not free, even assuming CH. I
- A weak version of \(\lozenge\) which follows from \(2^{\aleph_0}<2^{\aleph_1}\)
- Uncountable strongly surjective linear orders
- The Souslin problem
- Walks on ordinals and their characteristics
- \(\omega_1\) and \(-\omega_1\) may be the only minimal uncountable linear orders
- CH with no Ostaszewski spaces
- ωι-Sonslin trees under countable support iterations
- Parametrized $\diamondsuit $ principles
- Sur un problème concernant les types de dimensions
- Αll $ℵ_1$-dense sets of reals can be isomorphic
This page was built for publication: A model with Suslin trees but no minimal uncountable linear orders other than \(\omega_1\) and \(- \omega_1\)
