A first‑order theory whose axioms are exclusively equations between terms over a signature; its models are precisely the algebras in which the stated identities hold universally.

Principle

Use equational axioms (identities) as the sole form of assertion so that derivations rely on substitution, reflexivity, symmetry, transitivity, and congruence rules for terms; equational theories correspond to classes closed under the equational closure operators of universal algebra.

Demonstration

The equational theory of semigroups is the set of all identities in the binary operation that are true in every semigroup (for example, associativity as a basic axiom); checking whether a given identity follows from the theory can be reduced to manipulations in free term algebras or by using word‑rewriting techniques adapted to the signature.

Misapplication

Expecting equational theories to capture properties requiring existential quantifiers (such as 'there exists an idempotent element' unless idempotents are introduced as functionally definable) or ordering relations; attempting to axiomatize such properties solely by identities often fails or forces unnatural encodings.

Consequence

Equational theories yield robust algebraic consequences: they guarantee the existence of free algebras, allow algorithmic term rewriting and unification methods, and produce congruence and quotient constructions governed by syntactic equations.

Reversal

Replacing equational axioms by arbitrary first‑order sentences increases expressive power (can state existence and order properties) but loses many equational conveniences like straightforward free constructions and purely syntactic equational deduction.

Boundary

Applies strictly to axioms that are universally quantified equations over terms in a fixed signature; excludes Horn implications that are not equivalent to sets of identities, existential assertions, and properties essentially second‑order or involving non‑functional relations unless encoded as operations.

Semantic Tension

There is tension between the decidable, syntactic nature of equational consequence and the richer semantics of full first‑order theories: some natural algebraic phenomena are not equationally expressible, forcing a trade‑off between expressivity and algebraic closure simplicity.

Synthesis

An equational theory consists of identities that uniformly constrain term operations in a signature; its models form an equationally closed class with free objects and algorithmic syntactic methods for deriving identities, anchoring much of universal algebraic reasoning.