pith. machine review for the scientific record. sign in

arxiv: 1706.10171 · v2 · pith:42CSYURVnew · submitted 2017-06-30 · 🧮 math.LO

Uncountable strongly surjective linear orders

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

A linear order $L$ is strongly surjective if $L$ can be mapped onto any of its suborders in an order preserving way. We prove various results on the existence and non-existence of uncountable strongly surjective linear orders answering questions of Camerlo, Carroy and Marcone. In particular, $\diamondsuit^+$ implies the existence of a lexicographically ordered Suslin-tree which is strongly surjective and minimal; every strongly surjective linear order must be an Aronszajn type under $2^{\aleph_0}<2^{\aleph_1}$ or in the Cohen and other canonical models (where $2^{\aleph_0}=2^{\aleph_1}$); finally, we prove that it is consistent with CH that there are no uncountable strongly surjective linear orders at all. We end the paper with a healthy list of open problems.

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.