A κ-saturated (saturated) structure is a model M such that for every parameter set A ⊆ M with |A| < κ, every consistent type over A (in finitely many variables) is realized inside M; saturation expresses that M is rich enough to contain realizations of all small consistent descriptions.

Principle

Realization of small types: saturation is a cardinal-dependent completeness property asserting that no consistent constraint over a small parameter set fails to be realized, linking combinatorial size conditions to model-theoretic fullness and often used to build monster models or canonical ambient universes.

Demonstration

If κ is an uncountable strong limit cardinal greater than the language size, a κ-saturated model of a complete theory T of cardinality κ realizes every type over sets of size < κ; in stable theories, saturated models of a given uncountable cardinality are unique up to isomorphism, serving as canonical large models.

Misapplication

Confusing saturation with homogeneity (saturation implies some homogeneity but they are distinct) or assuming countable saturation without checking cardinal bounds; also assuming every theory has saturated models in every cardinality without regard to set-theoretic or stability constraints.

Consequence

Saturated structures are highly homogeneous, realize many types, simplify classification and independence arguments, and often serve as ambient 'monster' models in which one studies types, automorphisms, and forking calculus.

Reversal

Non-saturated or prime/atomic models omit some consistent small types; reversing saturation yields models that are minimal, atomic, or rigid and that may not realize the full supply of small types.

Boundary

Depends on the cardinal κ and on the language/theory; saturation concerns first-order types over parameter sets of size below κ and does not automatically provide realizations for types over larger sets or in logics beyond first order.

Semantic Tension

Tension between the desire for a richly realized model (saturation) and limitations from cardinal arithmetic, stability, or the absence of models in certain sizes; saturation trades off model size and combinatorial constraints against expressive completeness.

Synthesis

A κ-saturated structure is a model that, relative to the threshold κ, realizes every consistent first-order description over small parameter sets; it formalizes the idea of a maximally rich model under cardinal constraints and underpins many global model-theoretic arguments.