The theory of dense linear orders without endpoints is complete
ProvedFamousTheorems.dlo_theory_complete_7aThe theory of dense linear orders without endpoints is complete. The first-order theory DLO of dense linear orders without endpoints, in the language with one binary relation , is complete: for every sentence , either DLO or DLO .
The proof uses Cantor's back-and-forth theorem that all countable models are isomorphic to , together with the Łoś–Vaught test. It follows that and satisfy the same first-order sentences, and that DLO is decidable. It is a standard first example of an -categorical theory.
Formalization note. Mathlib's FirstOrder.Language.dlo_isComplete. Language.order.dlo is the theory of dense linear orders without endpoints in the language of orders. Theory.IsComplete means that the theory is satisfiable and that every sentence or its negation is a semantic consequence of it.
import Mathlib
namespace FamousTheorems theorem dlo_theory_complete_7a : FirstOrder.Language.order.dlo.IsComplete := by sorry end FamousTheorems