A complete type (also called a complete n-type) is a maximal consistent set of first-order formulas with parameters in a given structure or over a parameter set, in a fixed tuple of free variables; it assigns, for every formula in those variables, either the formula or its negation, thereby describing all first-order properties that a tuple can satisfy relative to the parameter set.

Principle

Maximal consistency: a complete type is consistent and contains, for each formula in the relevant variables with parameters from the base, a decision (the formula or its negation). Maximality ensures the type cannot be extended without contradiction, making it syntactically precise about the tuple's first-order behavior.

Demonstration

In an algebraically closed field K, the complete 1-type over the empty set of a transcendental element contains formulas expressing 'x is transcendental over the prime field' and, for each nonzero polynomial p, the formula 'p(x) ≠ 0'; this set is maximal and consistent and characterizes the transcendental element among realizations.

Misapplication

Treating a consistent but non-maximal collection of formulas as a complete type (confusing a partial description with completeness), or assuming a complete type must be isolated/realized in every model even when it may be omitted in some models.

Consequence

Complete types correspond to points in the space of types (Stone space); whether they are realized in a model controls model-theoretic phenomena like saturation, omitting types, and classification properties of theories.

Reversal

A partial type is a non-maximal consistent set of formulas that leaves some formulas undecided; reversing maximality yields multiple compatible extensions instead of a single deciding collection.

Boundary

Limited to first-order formulas in a fixed language and chosen tuple of variables; completeness refers to syntactic maximality over a specified parameter set and does not by itself assert realizability in a given model or extend to higher-order logics.

Semantic Tension

Tension between syntactic maximality (the set decides every formula) and semantic realization (whether some model contains a tuple realizing that set); a syntactically complete type may or may not be realized in particular structures.

Synthesis

A complete type is the maximal syntactic description of a potential tuple's first-order properties over a parameter set: it is the unique maximal consistent decision about every formula in the chosen variables, and its interplay with realization and topology underlies many model-theoretic constructions.