An open conjecture in model theory that every complete first‑order theory in a countable language has either countably many or continuum many nonisomorphic countable models; it rules out intermediate cardinalities for the number of countable models.

Principle

A proposed dichotomy: for complete countable first‑order theories, the set of isomorphism types of countable models should have size either ℵ0 or 2^{ℵ0}; the conjecture expresses a global restriction on how model diversity can behave in the countable realm.

Demonstration

Known cases show the dichotomy holds for many important classes: ω‑stable theories have countably many countable models, while unstable examples like the random graph produce continuum many. These examples illustrate the two permitted extremes but do not settle the general conjecture.

Misapplication

Treating the conjecture as a theorem and applying it to uncountable languages or incomplete theories, or assuming it constrains models in higher cardinalities; such uses ignore the conjecture's unresolved status and its specific hypotheses.

Consequence

If true, the conjecture imposes a strong global classification on countable theories, simplifying possibilities for model counts and guiding classification theory; a counterexample would reveal a new phenomenon of intermediate complexity.

Reversal

The negation would be the existence of a complete countable theory with strictly intermediate cardinality of nonisomorphic countable models (e.g. ℵ1 under some set‑theoretic assumption), showing that the dichotomy fails.

Boundary

Statement concerns complete first‑order theories in countable languages and the number of nonisomorphic countable models only; it does not make claims about incomplete theories, uncountable models, or other logics without further hypotheses.

Semantic Tension

Tension arises between descriptive set‑theoretic complexity of classification problems (Borel/Turbulence analyses) and model‑theoretic invariants (stability, Morley rank); the conjecture sits at the intersection and resists resolution from either perspective alone.

Synthesis

The Vaught Conjecture posits a sharp dichotomy for the number of nonisomorphic countable models of a complete countable theory — either countably many or continuum many — and encapsulates a central unresolved constraint on how richly countable models can vary.