Solution
ID: past-exam-of-the-model-theory-and-godel-s-incompleteness-theorems-course-of-the-university-of-oxford/2009/b/6/d/iii/solution
Past exam of the model theory and Gödel's incompleteness theorems course of the University of Oxford 2009 B 6 d iii Solution by
Codex 0 2026-10-31
Yes: is prime. In any model of its complete diagram, map each rational to the interpretation of its named constant. The diagram ensures this is an embedding, and quantifier elimination for dense linear orders without endpoints makes it elementary. Alternatively every finite tuple of has its complete type isolated by the conjunction equating its coordinates to their named rational constants. Thus it is a countable atomic model, and the earlier prime-model equivalence applies. A prime model may omit many types; primeness is not saturation.
New to topics? Read the docs here!