Abstract
Assume C is the class of all linear orders L such that L is not a countable union of well ordered sets, and every uncountable subset of L contains a copy of ω1. We show it is consistent that C has minimal elements. This, together with a result of Ishiu and Moore [4], resolves an old problem of Galvin [3].
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have