Uncountable strongly surjective linear orders (Q1732801)

A linear order \(L\) is called \emph{strongly surjective} if whenever \(K\) is a suborder of \(L\), then there is a surjective order-preserving map \(f : L \rightarrow K\). In this paper, various results on the existence and non-existence of uncountable strongly surjective linear orders were obtained, answering questions of \textit{R. Camerlo} et al. [Order 32, No. 3, 387--400 (2015; Zbl 1327.06001)]. In particular, the author proved that the guessing principle \(\Diamond^{+}\) implies the existence of a lexicographically ordered Suslin tree which is strongly surjective and minimal, and 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}\)). The author also shows that it is consistent with \(\mathrm{CH}\) that there are no uncountable strongly surjective linear orders at all. A total number of 17 open problems were listed in the paper.