Galvin's Question on non-$\sigma$-Well Ordered Linear Orders
Hossein Lamei Ramandi

TL;DR
This paper proves the consistency of the existence of minimal elements in a class of linear orders with specific uncountability and order-embedding properties, addressing a question posed by Galvin.
Contribution
It establishes the consistency of minimal elements in a class of non-$\sigma$-well ordered linear orders, answering an open question by Galvin.
Findings
Proves the consistency of minimal elements in the class $\mathcal{C}$
Shows that such linear orders can exist under certain set-theoretic assumptions
Addresses an old open problem in order theory
Abstract
Assume is the class of all linear orders such that is not a countable union of well ordered sets, and every uncountable subset of contains a copy of . We show it is consistent that has minimal elements. This answers an old question due to Galvin.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Computability, Logic, AI Algorithms · Advanced Topology and Set Theory
