A symbol in a formal language that stands for an unspecified element of the domain and may occur free or bound within formulas.

Principle

Variables serve as placeholders that can be instantiated by domain elements or bound by quantifiers; their identity and binding structure determine scope and substitution behavior.

Demonstration

In first-order logic, x in the formula ∀x (P(x) → Q(x)) is a bound variable because the quantifier ∀x binds every occurrence; in the formula P(x) ∧ R(y) the x and y are free unless a quantifier is present.

Misapplication

Treating a bound occurrence as if it were free when performing substitution, for example substituting a term for x inside ∀x P(x), which would change the formula's meaning and may cause variable capture.

Consequence

Correct handling of variables preserves logical form under substitution and quantification, enabling valid inference, renaming (α-conversion), and model-theoretic interpretation.

Reversal

If variables were fixed names rather than placeholders, they would behave like constant symbols and could not be quantified over; this inversion removes the ability to express generality via quantifiers.

Boundary

Excludes non-symbolic metavariables used in informal schemata and distinguishes between object-language variables and metalanguage parameters; does not cover variable-binding operators themselves (quantifiers, λ).

Semantic Tension

Tension exists between 'variable as placeholder' and 'variable as an unknown to be solved' — in formal syntax a variable's role depends on its binding context, whereas in applied mathematics it often denotes an unknown value.

Synthesis

A variable is a syntactic symbol whose role — free or bound — and correct management under substitution and quantification allow formal languages to represent unspecified domain elements and general statements.