# The number of countable models [duplicate]

Let $\mathcal{L}$ be a countable first order language. For a natural number n, can we find a complete $\mathcal{L}$-Theory $T$ which has exactly n non-isomorphic countable models ?

No, not for $n=2$. A theorem of Vaught says that a complete theory cannot have exactly two nonisomorphic models. A proof of this can be found in Shawn Hedman's "A First Course in Logic", for example.

• There is also a proof of Vaught's theorem in Chang & Keisler's "Model Theory", Theorem 2.3.15. – user50948 Jun 14 '14 at 14:14
• On the other hand, yes for $n\not=2$. – Noah Schweber Jun 14 '14 at 17:23