A model M is κ‑saturated (for a cardinal κ) if every consistent type over any parameter set of size less than κ is realized in M; informally, M is as rich as possible relative to its size in that it realizes all small types.

Principle

Realization completeness relative to cardinality: saturation measures the ability of a structure to realize all potential descriptions (types) over small parameter sets, turning syntactic consistency into actual elements of the model.

Demonstration

For a countable complete theory, an ω‑saturated (countably saturated) model realizes every type over finite or countable parameter sets; in stable theories one often constructs saturated models of arbitrarily large cardinalities, e.g., saturated algebraically closed fields of high transcendence degree realize all algebraic and nonalgebraic types over small sets.

Misapplication

Confusing saturation with mere homogeneity or with being 'big' by cardinality alone; a large cardinality model need not be saturated, and homogeneity (automorphism-based extendability) is related but not identical to saturation.

Consequence

Saturated models are central tools for classification: they are often unique up to isomorphism in a given cardinality under stability assumptions, facilitate back-and-forth constructions, and make type-space analysis concrete by providing realizations for all small types.

Reversal

An unsaturated model omits some consistent small types; such omissions can witness independence, produce nonisomorphic extensions, and obstruct canonical back-and-forth arguments that rely on realizing types.

Boundary

Saturation is cardinal-dependent and meaningful only in first-order contexts with a fixed language and cardinal arithmetic considerations; existence and uniqueness require hypotheses (e.g., stability or set-theoretic assumptions) and do not automatically hold for arbitrary theories or cardinals.

Semantic Tension

Tension with homogeneity and atomicity: saturation is about realizing all small types, while homogeneity requires extending partial isomorphisms and atomicity requires types to be isolated—these notions overlap but differ in strength and applicability.

Synthesis

A saturated model is a maximally type-realizing structure at a given size: it converts all syntactically consistent small specifications into actual elements, serving as a canonical, well-behaved environment for analyzing types and independence.