English

Uncountable strongly surjective linear orders

Logic 2018-01-31 v2

Abstract

A linear order LL is strongly surjective if LL 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 20<212^{\aleph_0}<2^{\aleph_1} or in the Cohen and other canonical models (where 20=212^{\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.

Cite

@article{arxiv.1706.10171,
  title  = {Uncountable strongly surjective linear orders},
  author = {Dániel T. Soukup},
  journal= {arXiv preprint arXiv:1706.10171},
  year   = {2018}
}

Comments

21 pages, revised version; to appear in Order; comments are very welcome

R2 v1 2026-06-22T20:34:30.687Z