A completeness/complexity property of a first-order theory: the theory is ω-stable if for every countable parameter set A the space of complete 1-types (or n-types for each fixed n) over A is countable; informally, there are only countably many non-equivalent ways an element can behave over a countable base.

Principle

Control the proliferation of types by bounding them over countable sets: ω-stability prevents uncountably many distinct complete types over a countable parameter set, yielding tameness for classification and model construction.

Demonstration

The theory of algebraically closed fields of a fixed characteristic is ω-stable: over any countable set of parameters, there are only countably many distinct 1-types because algebraic dependence and transcendence degree constrain realizations and types can be described by polynomial relations and transcendence information.

Misapplication

Confusing ω-stability with ω-categoricity (countable categoricity) or assuming ω-stability guarantees countable models are unique; they are related but distinct notions and one does not imply the other without further hypotheses.

Consequence

ω-stability implies many structural regularities: existence of prime models over countable sets, well-behaved notions of rank (Morley rank) and dimension, and amenability to classification theory techniques such as isolation of types and decomposition into minimal components.

Reversal

The negation is instability at the countable level: a theory that admits continuumly many distinct complete types over some countable parameter set, which typically signals wild combinatorial behavior and failure of classification tools.

Boundary

Applies to complete first-order theories and concerns types over countable parameter sets; it is silent about uncountable parameter sets and needs the ambient language and completeness hypothesis to be meaningful.

Semantic Tension

ω-stability sits between mere stability and stronger notions like superstability or categorical theories: it tames types by countability but still allows complexities disallowed by stronger properties, so it competes with both local geometric notions (strong minimality) and global categoricity statements.

Synthesis

ω-stability is a counting restriction on types: by ensuring only countably many distinct complete types over any countable base, it produces a controlled context for ranks, prime models, and decomposition into well-understood minimal constituents, forming a bridge between raw stability and full classification.