The Łoś–Vaught test
ProvedFamousTheorems.los_vaught_testThe Łoś–Vaught test. Let be a satisfiable theory in a language with no finite models, and let be an infinite cardinal with . If is -categorical (all models of of cardinality are isomorphic), then is complete.
This is the simplest method of proving completeness of first-order theories. It shows, for example, that the theory of dense linear orders without endpoints (-categorical) and the theory of algebraically closed fields of fixed characteristic (categorical in uncountable cardinals) are complete.
Formalization note. Mathlib's Cardinal.Categorical.isComplete. The language lives in universes u, v, the cardinal κ : Cardinal.{w} in a possibly different universe, and Cardinal.lift compares L.card with κ. "No finite models" is stated for models in universe max u v, and T.IsComplete means is satisfiable and every sentence or its negation is a consequence of .
import Mathlib
namespace FamousTheorems
universe u v w
theorem los_vaught_test {L : FirstOrder.Language.{u, v}} (κ : Cardinal.{w}) (T : L.Theory) (h : κ.Categorical T)
(h1 : Cardinal.aleph0 ≤ κ) (h2 : Cardinal.lift.{w} L.card ≤ Cardinal.lift.{max u v} κ) (hS : T.IsSatisfiable)
(hT : ∀ M : FirstOrder.Language.Theory.ModelType.{u, v, max u v} T, Infinite M) : T.IsComplete := by sorry
end FamousTheorems