Galvin's Question on non-$\sigma$-Well Ordered Linear Orders
Logic
2020-10-29 v2
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.
Keywords
Cite
@article{arxiv.2009.08601,
title = {Galvin's Question on non-$\sigma$-Well Ordered Linear Orders},
author = {Hossein Lamei Ramandi},
journal= {arXiv preprint arXiv:2009.08601},
year = {2020}
}
Comments
15 pages