2000 character limit reached
Linear orders: when embeddability and epimorphism agree
Published 8 Jan 2017 in math.LO | (1701.02020v2)
Abstract: When a linear order has an order preserving surjection onto each of its suborders we say that it is strongly surjective. We prove that the set of countable strongly surjective linear orders is complete for the class of sets which are the union of an analytic and a coanalytic set. Using hypotheses beyond ZFC, we prove the existence of uncountable strongly surjective orders.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.