The number of distinct complete n-types (over a specified parameter set, often the empty set) that are realized in models of a theory or consistent with the theory; used to quantify the diversity of complete descriptions of n-tuples up to strong equivalence.

Principle

Types partition the space of possible n-tuples by their complete first-order descriptions; counting types measures how many essentially different behaviors tuples can exhibit and is central to classification notions such as stability, superstability, and ω-stability.

Demonstration

Example: in a stable theory the number of 1-types over a countable parameter set is at most countable, while an unstable theory can have continuum many complete 1-types; finite structures realize at most as many 1-types as their cardinality.

Misapplication

Confusing the count of complete types with the count of syntactic formulas or assuming a high type count always implies algorithmic intractability; type counts depend on parameter sets and whether one counts realized versus consistent types.

Consequence

Accurate type counts enable model-theoretic classification of theories, inform the existence of prime or saturated models, and guide transfer principles between cardinalities in stability theory.

Reversal

Instead of counting realized complete types, one can count omitted types or consider the space of partial types; this reversal foregrounds independence phenomena, omissibility, and extension properties rather than realized diversity.

Boundary

Type count depends on the arity n, the choice of parameter set, and whether one counts realized versus consistent or complete versus partial types; it is a model-theoretic invariant but sensitive to context and language cardinality.

Semantic Tension

Tension exists between syntactic counts (number of formulas modulo equivalence) and semantic counts (types as maximal consistent sets), and between local counts (fixed n) and global invariants like Morley rank or spectrum functions.

Synthesis

Type count is the cardinal measure of how many distinct complete descriptions of n-tuples a theory admits in a given context; by relating these counts to stability and saturation one obtains a compact invariant that drives classification and construction results.