Extending Partial Orders on o‐Minimal Structures to Definable Total Orders
The authors show the following: Theorem: Let \({\mathcal M} =(M,<, \dots)\) be an o-minimal structure such that \((M,<)\) is a total ordering and \(\prec\) is a definable partial order. Then \(\prec\) has an extension to a total ordering on \(M\). Further on they investigate a definable version of Ramsey's theorem. So the following is shown: Let \({\mathcal M} =(M,<, \dots)\) be an o-minimal structure with a dense linear ordering and let \(\{X_0, \dots, X_{n-1}\}\) be a partition of the two-element subsets of \(M\) into finitely many definable sets. Then there are an interval \(I\subseteq M\) and \(i<n\) such that \([I]^2 \subseteq X_i\). They show that this result cannot be generalized for partitions of three-element subsets of \(M\).
This page was built for publication: Extending Partial Orders on o‐Minimal Structures to Definable Total Orders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4366127)
