pith. sign in

arxiv: 1707.05661 · v1 · pith:4MNYP5BOnew · submitted 2017-07-18 · 🧮 math.LO

There may be no minimal non σ-scattered linear orders

classification 🧮 math.LO
keywords linearscatteredsigmaorderaronszajnconsistenteitherimplies
0
0 comments X
read the original abstract

In this paper we demonstrate that it is consistent, relative to the existence of a supercompact cardinal, that there is no linear order which is minimal with respect to being non $\sigma$-scattered. This shows that a theorem of Laver, which asserts that the class of $\sigma$-scattered linear orders is well quasi-ordered, is sharp. We also prove that PFA${}^+$ implies that every non $\sigma$-scattered linear order either contains a real type, an Aronszajn type, or a ladder system indexed by a stationary subset of $\omega_1$, equipped with either the lexicographic or reverse lexicographic order. Our work immediately implies that CH is consistent with "no Aronszajn tree has a base of cardinality $\aleph_1$." This gives an affirmative answer to a problem due to Baumgartner.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.