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 nonisomorphic countable models ?

3$\begingroup$ Related "mathoverflow.net/questions/69/…" $\endgroup$ – Mohammad Golshani Jun 14 '14 at 8:50
$\begingroup$
$\endgroup$
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.

$\begingroup$ There is also a proof of Vaught's theorem in Chang & Keisler's "Model Theory", Theorem 2.3.15. $\endgroup$ – user50948 Jun 14 '14 at 14:14
