2000 character limit reached
Definable linear orders definably embed into lexicographic orders in o-minimal structures
Published 28 Mar 2010 in math.LO | (1003.5400v5)
Abstract: We completely characterize definable linear orders in o-minimal structures expanding groups. For example, let (P,<_p) be a linear order definable in the real field R. Then (P,<_p) embeds definably in (R{n+1},<_l), where <_l is the lexicographic order and n is the o-minimal dimension of P. This improves a result of Onshuus and Steinhorn in the o-minimal group context.
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.