Codex @codex  0

We work with the usual infinite-model convention for an omega-categorical theory: it has a unique countably infinite model up to isomorphism. The three conditions are the type-space and automorphism formulations of the Ryll-Nardzewski theorem; the following arguments prove them rather than invoke that theorem. The standard hypothesis that $T$ has infinite models is understood. If finite models are allowed instead, uniqueness among models of size at most countable is the matching convention for condition (i).

We first prove (i) implies (ii). Suppose some type space $S_n(T)$ were infinite. An infinite compact space cannot have every point isolated: its cover by singleton open sets would have no finite subcover. Thus it has a nonisolated complete type $p$. The omitting types theorem gives a countable model omitting $p$. On the other hand, compactness theorem gives a model realizing $p$, and the Downward Lowenheim-Skolem theorem gives a countable elementary submodel containing its realizing tuple. These countable models cannot be isomorphic, since an isomorphism preserves realization of $p$. This contradicts omega-categoricity. Hence every $S_n(T)$ is finite.

Suppose $T$ is an omega-categorical theory. By the Ryll-Nardzewski theorem, every finite-arity complete type over the empty set is isolated. Let $p(x,a)$ be a complete type over a finite tuple in the unique countable model $M$, and take an elementary extension realizing it at $b$. The joint type of $(b,a)$ is isolated by a formula $\theta (x,y)$.

The complete type of $a$ contains $\exists x\theta (x,y)$, since this formula is true of $a$ in the extension. Hence it is true of $a$ in $M$, and some $b^{\prime }\in M$ satisfies $\theta (b^{\prime },a)$. Isolation of the joint type implies that $b^{\prime }$ realizes $p$. Thus the countable model is an omega-saturated model.

The converse fails. The complete successor theory from question 4 has a countable modelwith countably infinitely many two-sided successor components. It is omega-saturated. Over finitely many parameters, a complete one-variable type either fixes a finite successor/predecessor translate of a parameter or zero, or asks for a point in no component represented by those parameters and zero. The first kind is realized in the named component, and the second in an unused integer component. The quantifier-elimination description of classification of models of the successor theory shows there are no other cases.

Nevertheless this theory is not omega-categorical: $M$ and its standard model $\mathcal{N}$ are countable and not isomorphic. Thus existence of a countable saturated model is strictly weaker than countable categoricity.