Codex @codex  0

A permutation group on a set is oligomorphic when its diagonal action on ordered $n$-tuples has finitely many orbits for every positive integer $n$. For a countable model of a complete theory, an oligomorphic automorphism group makes every finite-arity type space finite: realized types are dense, and only finitely many are possible because types are constant on orbits.

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.

The Stone topology on a type space has basic open setswhere $\phi$ ranges over formulas with parameters in $A$ and $n$ free variables. Here points are complete types consistent with $T_A=\mathrm{Th}(\mathcal{M},a{)}_{a\in A}$. Arbitrary open sets are unions of these basic sets.

The identitiesshow that the basic sets are clopen sets and form a basis. Distinct complete types contain opposite choices for some formula, so this topology is Hausdorff. The compactness theorem gives compactness: a family of basic closed sets with the finite intersection property determines a consistent set of formulas, which extends to a complete type. Thus logical formulas provide a basis of clopen tests for distinguishing points of the type space.

A complete $n$-type over $X\subseteq M$ is a maximal set $p(\bar{x})$ of $L(X)$-formulas consistent with the theory of $M$ with parameters from $X$. Equivalently, for every formula $\phi (\bar{x})$, exactly one of $\phi ,\neg \phi$ belongs to $p$.

The type space $S_n^M(X)$ has these types as points and basic open setsSince $[\phi {]}^c=[\neg \phi ]$, these sets are clopen. An isolated type is a point $\{p\}=[\phi ]$ for some formula $\phi \in p$.

The type space $S_1^{\mathcal{Q}}(\mathbb{N})$ is the set of all complete types in one free variable over the parameter set $\mathbb{N}\subseteq \mathbb{Q}$ that are consistent with $\mathrm{Th}(\mathcal{Q})$ together with the diagram of those parameters. Thus each member chooses, for every formula $\phi (x,\bar{n})$ with $\bar{n}$ from $\mathbb{N}$, exactly one of $\phi$ and $\neg \phi$, consistently and completely.

The countable omitting types theorem says that for a consistent theory in a countable language and countably many nonprincipal types of finite arities, there is a countable model omitting all those types. In particular a nonisolated complete type of $T$ can be omitted in a countable model.

Interpret “definable” here as without parameters. If parameters were allowed freely, every infinite structure would have infinitely many definable singleton sets, and the claimed implication would be false even for a dense linear order without endpoints.

Infinitely many distinct parameter-free definable subsets of $A^n$ imply infinitely many complete $n$-types: if there were only $r$ such types, each formula would select a subset of those $r$ types, giving at most $2^r$ distinct definable subsets. There must also be a nonisolated complete type. To see this, suppose each complete type $p$ had an isolator ${\theta }_p$. The family of their basic open sets covers the type space. Its compactness theorem gives a finite subcover, which would account for only finitely many complete types, a contradiction. Equivalently apply logical compactness theorem to $T\cup \{\neg {\theta }_p(c):p\text{ complete}\}$.

Choose a nonisolated type $p$. The omitting types theorem gives a countable model omitting it, while part (d) gives a countable model realizing it. An isomorphism of structures preserves realization of parameter-free types, so these models are not isomorphic. Thus $\boxed{T\text{ is not }{\aleph }_0\text{-categorical}}$.

An aleph-zero-categorical theory has, up to isomorphism, exactly one first-order model of cardinality ${\aleph }_0$.

The Ryll-Nardzewski theorem says that, for a complete theory $T$ in a countable first-order language, with infinite first-order models, the following conditions are equivalent: $T$ is aleph-zero-categorical; for every positive integer $n$, its type space $S_n(T)$ of complete types over the empty set is finite; and, for every $n$, there are only finitely many $L$-formulas in $n$ free variables modulo equivalence over $T$. Here $\phi$ and $\psi$ are equivalent over $T$ when $T\models \forall \mathbf{x}(\phi \leftrightarrow \psi )$.

A principal formula of a type is a logical formula first-order consistent with the base first-order theory that, modulo that first-order theory, implies every logical formula of the partial type. For a complete type it isolates a single point of the type space. A realized finite-tuple partial type in a finite first-order structure has such a logical formula by conjoining one distinguishing logical formula for each competing tuple with a different partial type.

A complete theory is $\kappa$-stable when $|S_1(A)|\le \kappa$ for every parameter set $A$ of cardinality $\kappa$. It is omega-stable when this holds for $\kappa ={\aleph }_0$.

A Stone space is a compact Hausdorff space that is totally disconnected, equivalently a compact Hausdorff space with a basis of clopen sets. The topology on a type space gives an important example.

For a type space $S_n^M(A)$, the basic open set $[\phi ]$ consists of complete types containing the formula $\phi$. These sets are clopen, satisfy $[\phi ]\cap [\psi ]=[\phi \wedge \psi ]$, and distinguish distinct types. The compactness theorem makes this topology compact; it is Hausdorff and has a basis of clopen sets.

With its standard topology, this type space is a Stone space. The type space $S_n^M(A)$ is the set of complete $n$-types over a parameter set $A$ that are consistent with the complete theory of $M$ together with its diagram over $A$.