A realization of a type p(x) in a model M is an element or tuple a of M such that every formula in p(x) is true of a in M; equivalently, a realizes p if M ⊨ φ(a) for every φ(x) ∈ p.

Principle

Realization ties the syntactic description given by a type to a concrete semantic object in a model; whether a type is realized depends on the model's properties (size, saturation) and on the type itself.

Demonstration

A transcendence type over Q is realized in any extension of Q that contains a transcendental element; in a κ-saturated algebraically closed field, every type over a parameter set of size < κ is realized by some element of the field.

Misapplication

Assuming every consistent (or complete) type is realized in every model: realization can fail in small or unsaturated models, and omission of types is an important phenomenon with consequences for constructions.

Consequence

When types are realized one obtains concrete witnesses for abstract descriptions, enabling explicit construction of elements with prescribed behavior and linking types to orbit and independence calculations.

Reversal

The inverse concept is omission: a type may be omitted by a model (no element realizes it), which is central to the Omitting Types Theorem and to building models with controlled properties.

Boundary

Realization is model-relative: the same type may be realized in some models and omitted in others; realization concerns first-order truth in a given structure and does not address higher-order or infinitary realizations.

Semantic Tension

Realization can be conflated with satisfiability of a formula: satisfiability is about existence of some model and element making a formula true, whereas realization fixes both the type and the ambient model where every formula in the type holds.

Synthesis

A realization is the concrete witness in a model that makes every formula of a given type true; the pattern of which types are realized across models encodes deep structural information about the theory and its models.