A subset S of the domain of a structure M is definable (with parameters) if there exists a first-order formula φ(x, a) with parameters a from M such that S = { b in M : M ⊨ φ(b,a)}. If no parameters are used the set is definable without parameters (0‑definable).

Principle

The organizing idea is that a definable set is exactly the extension of a first-order predicate in the model: definability translates syntactic formulas into semantic subsets of the domain, closed under Boolean combinations and projections (existential quantification produces images).

Demonstration

Example: In the ordered field of real numbers (R,+,·,<,0,1), the positive reals {x : x>0} are definable by the quantifier‑free formula x>0; the set of squares is definable by ∃y (y^2 = x).

Misapplication

Confusing definable with algebraic, topological, or computable sets without regard for the language and parameters; assuming a subset is definable in M when its description uses external structure or higher‑order quantification not available in the signature.

Consequence

Definable sets form a Boolean algebra closed under projection by existential quantifiers; knowledge of definable sets determines types, controls interpretable structure, and is central to classification results (e.g., o‑minimality or stability) in model theory.

Reversal

A non-definable subset is one for which no first-order formula (with allowed parameters) picks out exactly that set; many naturally described collections fail definability in a given language or model.

Boundary

Definability depends on the chosen signature, the ambient model M, and whether parameters are permitted; it is a first-order notion and does not capture properties requiring higher-order logic, infinitary conjunctions, or external encodings.

Semantic Tension

Tension appears between definable, type-definable (intersection of definable sets, possibly infinite), and invariant sets: definable sets are syntactically explicit, while type‑definable sets may require infinite information and invariant sets are preserved under automorphisms but may not be definable.

Synthesis

A definable set in a structure is the semantic realization of a first-order formula (with specified parameters): it is the precise way syntax determines subsets of a model, forming the basic objects for classification and manipulation in model theory.