Mathematical logic and foundations Definition
O-minimal theory
Definition
Let be a first-order language that contains a binary relation symbol . Let be an -structure in which is interpreted as a total order. The structure is o-minimal if every subset of definable with parameters is a finite union of points and open intervals. Here the endpoints of an interval lie in . An -theory is o-minimal if every model of is o-minimal.
Remarks
Example: the ordered field is o-minimal. By the Tarski–Seidenberg theorem it has quantifier elimination, so a definable subset of is a Boolean combination of sets and with a polynomial with real coefficients. Each such set is a finite union of points and open intervals, because a nonzero polynomial has finitely many roots.
Non-example: the structure is not o-minimal. The formula defines the set of even integers, which is not a finite union of points and intervals.
By a theorem of Knight, Pillay and Steinhorn, if a structure is o-minimal then its complete theory is o-minimal. Dense linear orders without endpoints and real closed fields give o-minimal theories.
Reading path
To understand this page from the ground up, read these 6 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Definable set concept
- Interval concept
- Structure concept
- Theory concept
- Total order concept
- O-minimal theory definition
Further reading
About this page
| Tag | 1XZJCGJ8B5 |
|---|---|
| URI | m2://1XZJCGJ8B5 |
| Kind | definition |
| Writing | W0 stub |
| MSC | 03C64 |
| Defines | O-minimal theory |
| Uses | Structure, Total order, Interval, Definable set, Theory |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.