A note on a theorem of Vaught

Abstract

In [2] Vaught showed that if T is a complete theory formalized in the first-order predicate calculus, then it is not possible for T to have exactly (up to isomorphism) two countable models. In this note we extend his methods to obtain a theorem which implies the above.First some definitions. We define Fn(T) to be the set of well-formed formulas (wffs) in the language of T whose free variables are among x1 x2, …, xn. An n-type of T is a maximal consistent set of wffs of Fn(T); equivalently, a subset P of Fn(T) is an n-type of T if there is a model M of T and elements a1, a2, …, an of M such that M ⊧ ϕ(a1, a2, …, an) for every ϕ ∈ P. In the latter case we say that 〈a1, a2, …, an〉 ony realizes P in M. Every set of wffs of Fn(T) which is consistent with T can be extended to an n-type of T.