A model-theoretic property of a structure asserting that every type (set of formulas) with parameters from any subset of size less than a given cardinal κ that is finitely satisfiable in the structure is realized in the structure; equivalently, all consistent types over small parameter sets are realized.

Principle

κ-saturation enforces that local, finitely consistent constraints over parameter sets of size < κ actually have witnesses in the model, producing a richness of realizations that aligns the model's expressive capacity with the cardinal κ and prevents omission of small types.

Demonstration

An ℵ0-saturated (countably saturated) model realizes every type over finite parameter sets that is finitely satisfiable; for example, a saturated algebraically closed field of uncountable transcendence degree realizes all 1-types over countable sets, ensuring the existence of elements with prescribed algebraic relations relative to those parameters.

Misapplication

Confusing saturation with model-completeness or completeness of a theory: a theory can be complete without its models being κ-saturated, and a κ-saturated model need not make the theory decidable; misreading saturation as a syntactic property of the theory rather than a semantic property of models leads to incorrect conclusions about realizability in arbitrary models.

Consequence

A κ-saturated model is highly homogeneous and flexible: types over small sets are realized, enabling back-and-forth constructions for isomorphisms, transfer of indiscernible sequences, and strong control of automorphism groups; saturated models often serve as canonical large models in classification theory.

Reversal

The negation—a model that is not κ-saturated—omits some finitely satisfiable type over a parameter set of size < κ; such omission can indicate rigidity, gaps in realization, or the presence of 'small' incomplete behaviour that obstructs back-and-forth arguments.

Boundary

Saturation is a semantic property of individual models relative to a cardinal κ and depends on the language's size; it is meaningful for first-order theories and requires attention to cardinal arithmetic (e.g., existence of κ-saturated models may need large cardinalities or additional set-theoretic hypotheses); it does not automatically transfer between models of different cardinalities.

Semantic Tension

Tension exists between saturation and related notions: saturation vs compactness (compactness ensures finite satisfiability of sets of sentences, while saturation requires realization of types), and saturation vs model-completeness or categoricity; these notions overlap but are logically distinct and can pull applications in different directions.

Synthesis

κ-saturation packages the idea that a model is as realizationally complete as allowed by the cardinal κ: every small finitely satisfiable constraint has a witness, producing models that are rich, homogeneous, and indispensable for classification and structural transfer, while remaining sensitive to language size and cardinal arithmetic.