Definable set¶

A subset or relation in a mathematical structure consisting exactly of tuples satisfying a first-order formula, with or without named parameters.

Version: v2 · 2026-09-19 · History
Domain-specific #: 4079
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomain: Model Theory → Mathematics

Core Idea¶

A definable set turns logical syntax into a semantic subset of a structure. An assignment of parameters fixes the formula's constants, and the satisfaction relation selects precisely those tuples making the formula true. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

The load-bearing residual is not the broad topic of model theory. It is A subset or relation in a mathematical structure consisting exactly of tuples satisfying a first-order formula, with or without named parameters.

How would you explain it like I'm…

Groups Picked by a Rule

Imagine a game where you may only describe numbers using a few allowed words, like 'plus' and 'is equal to.' With those words you can say 'a number that equals some number plus itself,' and that picks out exactly the even numbers. A collection you can pick out exactly with a sentence made from the allowed words is a definable set.

Sets Picked Out by Formulas

In math logic, you study a structure: a collection of things plus some basic relations, like the whole numbers with adding and multiplying. You can write formulas using only the structure's allowed symbols and logic words like and, or, not, for all, and there exists. A definable set is a set that is exactly the things making one such formula true. For example, in the whole numbers with addition, the even numbers are definable, because a number is even exactly when there is some number that, added to itself, gives it. Sometimes the formula is also allowed to mention particular chosen things from the structure, called parameters, and you have to say whether that is allowed.

First-Order Definable Set

In model theory, a definable set is a subset, or a relation made of tuples, of a mathematical structure consisting of exactly those elements or tuples that satisfy a particular first-order formula. The formula is a piece of syntax; the satisfaction relation of the structure turns it into a set, which is the semantic meaning of the formula in that structure. Formulas may be allowed to use parameters, specific elements of the structure plugged in as constants, and a set may be definable with parameters but not without them, so you must state which is meant. Definability depends on the structure and its language: the same set can be definable in one structure and not in another. The test is that membership in the set is equivalent to satisfying one declared formula in the specified structure.

Given a structure M in a first-order language L, a set X ⊆ Mⁿ is definable (with parameters from A ⊆ M) if there is a first-order L-formula φ(x₁, …, xₙ, y₁, …, yₖ) and parameters a ∈ Aᵏ such that X = {b ∈ Mⁿ : M ⊨ φ(b, a)}. Definable sets thus turn logical syntax into semantic subsets of a structure: the assignment of parameters fixes the formula's constants, and the satisfaction relation selects exactly the tuples that make the formula true. Definability is relative to the structure, the language, and the parameter set; in particular, ∅-definable (parameter-free) and definable with parameters are distinct notions, so parameter use must be declared. The constitutive test is that membership is equivalent to satisfaction of one declared formula in the specified structure; a set merely describable in informal language, or in a stronger logic, is not thereby first-order definable.

Scope of Application¶

Definable set belongs to model theory and is useful where the analyst can specify a first-order language, structure M, formula, free variables, parameter tuple and satisfaction relation, then evaluate membership is equivalent to satisfaction of one declared formula in the specified structure, with parameter use stated. The scope is broad within that domain but bounded by the need for membership is equivalent to satisfaction of one declared formula in the specified structure, with parameter use stated. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.

Clarity¶

The abstraction clarifies a crowded vocabulary by making membership is equivalent to satisfaction of one declared formula in the specified structure, with parameter use stated the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because the name Definable set can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated.

Manages Complexity¶

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Definable set. Definable set compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

Abstract Reasoning¶

Identify the carrier. State what the elements, states, objects, or observations are: a first-order language, structure M, formula, free variables, parameter tuple and satisfaction relation. Reject examples whose alleged carrier belongs to a different problem.
Lock the constitutive rule. Express membership is equivalent to satisfaction of one declared formula in the specified structure, with parameter use stated independently of one notation or implementation.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of model theory because they reuse a first-order language, structure M, formula, free variables, parameter tuple and satisfaction relation, An assignment of parameters fixes the formula's constants, and the satisfaction relation selects precisely those tuples making the formula true., and type the carrier, state every parameter and convention in the definition, test that membership is equivalent to satisfaction of one declared formula in the specified structure, with parameter use stated, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Definable set Domain-specific

Parents (1) — outgoing typed relations

Definable set is a kind of Representation Prime

What makes it its own entry: A subset or relation in a mathematical structure consisting exactly of tuples satisfying a first-order formula, with or without named parameters.

Hierarchy path (1) — routes to 1 parentless root

Definable set → is a kind of Representation → presupposes Abstraction

Neighborhood in Abstraction Space¶

Definable set sits in a crowded region of the domain-specific corpus (21^st percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Boolean & Formal Logic Structures (29 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25