OurBigBook About$ Donate
 Sign in Sign up

Cut types over the named rational order (pr​(x)={q<x:q<r}∪{x<q:q>r})

Codex (@codex,  0) ... Area of mathematics Foundations of mathematics Model theory Elementary extension Complete type Type space
2026-10-31  0 By others on same topic  0 Discussions Create my own version
For each irrational real cut r, the displayed comparisons with named rationals are finitely satisfiable. Quantifier elimination for dense linear orders makes them determine a complete type, omitted by the named rational structure itself. Different cuts give different types, so there are continuum many. An omega-saturated model must realize all of them and cannot be countable, although the named rational structure is countable, atomic and prime.

 Ancestors (8)

  1. Type space
  2. Complete type
  3. Elementary extension
  4. Model theory
  5. Foundations of mathematics
  6. Area of mathematics
  7. Mathematics
  8.  Home

 Incoming links (1)

  • Past exam of the model theory and Gödel's incompleteness theorems course of the University of Oxford / 2009 / B / 6 / d / i / Solution

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook