Uncountable strongly surjective linear orders

DOI10.1007/S11083-018-9454-7MaRDI QIDQ1732801zbMATH OpenOpenAlexFDO

Authors Dániel T. Soukup

Publication date 25 March 2019

Published in Order (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1706.10171

zbMATH Keywords

minimalitylinear orderuniformizationweak diamondSuslin tree\(\aleph_{1}\)-densestrongly surjective linear order

Mathematics Subject Classification ID

Other combinatorial set theory (03E05) Consistency and independence results (03E35) Total orders (06A05) Ordered sets and their cofinalities; pcf theory (03E04)

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, $diamondsui{t}^{+}$ 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^{alep{h}_0}<2^{alep{h}_1}$ or in the Cohen and other canonical models (where $2^{alep{h}_0}=2^{alep{h}_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.

Recommendations

• Linear orders: when embeddability and epimorphism agree
• A model with Suslin trees but no minimal uncountable linear orders other than \(\omega_1\) and \(- \omega_1\)
• A strongly non-Ramsey order type
• \(\omega_1\) and \(-\omega_1\) may be the only minimal uncountable linear orders
• scientific article; zbMATH DE number 3888510

Cites work

• scientific article; zbMATH DE number 3888510 (Why is no real title available?)
• scientific article; zbMATH DE number 15666 (Why is no real title available?)
• scientific article; zbMATH DE number 3797750 (Why is no real title available?)
• A five element basis for the uncountable linear orders
• A weak version of \(\lozenge\) which follows from \(2^{\aleph_0}<2^{\aleph_1}\)
• Epimorphisms between linear orders.
• Martin's axiom does not imply that every two \(chi_ 1-\)dense sets of reals are isomorphic
• On the consistency of some partition theorems for continuous colorings, and the structure of \(\aleph _ 1\)-dense real order types
• Parametrized $\diamondsuit $ principles
• Set Theory
• Walks on ordinals and their characteristics
• \(\omega_1\) and \(-\omega_1\) may be the only minimal uncountable linear orders
• Αll $ℵ_1$-dense sets of reals can be isomorphic

Cited in

(7)

• Linear orders: when embeddability and epimorphism agree
• \(\omega_1\) and \(-\omega_1\) may be the only minimal uncountable linear orders
• Epimorphisms between linear orders.
• On minimal non-\(\sigma\)-scattered linear orders
• Countable linear orders with disjoint infinite intervals are mutually orthogonal
• More minimal non-\(\sigma\)-scattered linear orders
• A model with Suslin trees but no minimal uncountable linear orders other than \(\omega_1\) and \(- \omega_1\)

This page was built for publication: Uncountable strongly surjective linear orders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1732801)