A characterization of countable (ω-)categorical first-order theories: for a countable language, a complete theory is ω-categorical (has a unique countable model up to isomorphism) if and only if for every natural number n it has only finitely many n‑types over the empty set; equivalently the automorphism group of its countable model is oligomorphic (has finitely many orbits on n‑tuples for each n).

Principle

Connect a syntactic finiteness of types with a permutation-group form of symmetry: finite n‑type behaviour over the empty set for each n is equivalent to strong global homogeneity of the countable model captured by oligomorphic automorphism groups.

Demonstration

The random (Rado) graph is ω-categorical: in its countable model there are finitely many n‑types over the empty set for each n, and its automorphism group acts with finitely many orbits on n‑tuples, so the theorem applies to certify countable categoricity and the tight link to permutation-group properties.

Misapplication

Assuming the theorem holds in uncountable languages or without completeness; the equivalences require a countable language and a complete theory, and the finiteness condition must be checked for all arities n over the empty set (not only for n=1).

Consequence

Ryll‑Nardzewski provides a powerful bridge between model-theoretic categoricity and permutation-group structure, enabling transfer of combinatorial and algebraic techniques (orbit analysis, enumeration of definable relations) and giving strong constraints on definable sets in countable models.

Reversal

The negation is having infinitely many n‑types for some arity n over the empty set, equivalent to the automorphism group having infinitely many orbits on n‑tuples and hence to failure of countable categoricity and greater model-theoretic complexity.

Boundary

Applies to complete first-order theories in a countable language and characterizes countable categoricity; it does not directly address uncountable categoricity or languages with higher cardinality, nor does it replace other necessary hypotheses like completeness.

Semantic Tension

The theorem balances two perspectives: a syntactic, type-counting viewpoint and a semantic, symmetry-oriented viewpoint via automorphism groups; tension arises when one attempts to generalize either side beyond the countable-language, first-order setting.

Synthesis

Ryll‑Nardzewski condenses countable categoricity into an equivalence: finiteness of n‑types over the empty set for every n, oligomorphic action of the automorphism group, and uniqueness of the countable model; this equivalence ties definability, symmetry, and counting into a single workable condition.