Equational logic

First-order equational logic consists of quantifier-free terms of ordinary first-order logic, with equality as the only predicate symbol.

Version

v1 · 2026-09-28 · History

Domain-specific #

9290

Domain group

Formal Sciences

Origin domain

Mathematics

Subdomains

Mathematical Logic, Universal Algebra → Mathematics

Core Idea

Equational logic is treated here as the recurring mathematicslogicstatistics identity summarized by this source-grounded definition: First-order equational logic consists of quantifier-free terms of ordinary first-order logic, with equality as the only predicate symbol. First-order equational logic consists of quantifier-free terms of ordinary first-order logic, with equality as the only predicate symbol. The model theory of this logic was developed into universal algebra by Birkhoff, Grätzer, and Cohn. It was later made into a branch of category theory by Lawvere ("algebraic theories").

Scope of Application

• Proof. We explain how the four inference rules are used in proofs, using the proof of .

• Proof. The "hint" on line (1) is supposed to give a premise of Leibniz, showing what substitution of equals for equals is being used.

• Proof. This shows how inference rule Substitution is used within hints.

• Documented setting. The terms of equational logic are built up from variables and constants using function symbols (or operations).

• Syllogism. P[x := E] denotes textual substitution of expression E for variable x in expression P .

Clarity

A clear use of Equational logic names the carrier, the operative relation, and the conditions under which the source treats the identity as present. The minimal definition is First-order equational logic consists of quantifier-free terms of ordinary first-order logic, with equality as the only predicate symbol.

Manages Complexity

Equational logic compresses multiple mathematicslogicstatistics details into a stable diagnostic relation. The source shows both the central mechanism—finally, note that line (4) , \lnot \top \equiv \bot , is a theorem, as indicated by the hint to its right.—and the practical consequence—it was later made into a branch of category theory by Lawvere ("algebraic theories"). This compression makes cases comparable while leaving parameters, conventions, exceptions, and evidential quality explicit.

Abstract Reasoning

1. Type the carrier. Identify the mathematicslogicstatistics entities to which the claim applies.
2. State the relation. Use the source-grounded identity: First-order equational logic consists of quantifier-free terms of ordinary first-order logic, with equality as the only predicate symbol.
3. Check operation and conditions. Hence, by inference rule Equanimity, we conclude that line (0) is also a theorem.
4. Demand recognition evidence. First-order equational logic consists of quantifier-free terms of ordinary first-order logic, with equality as the only predicate symbol.
5. Test variation.

Knowledge Transfer

Within the home domain. Knowledge about Equational logic transfers literally when a new case preserves the same carrier type, relation, and recognition test. We explain how the four inference rules are used in proofs, using the proof of . The "hint" on line (1) is supposed to give a premise of Leibniz, showing what substitution of equals for equals is being used. Beyond the home domain. No canonical parent is asserted for Equational logic.

Relationships to Other Abstractions

Current abstraction Equational logic Domain-specific

Parents (1) — more general patterns this builds on

• Equational logic is a kind of Formal System Prime

  Equational logic is a formal symbolic system with formation and inference rules; it is not a specialization of Omega-logic.

Hierarchy paths (2) — routes to 2 parentless roots

• Equational logic → Formal System → Formalization → Representation → Abstraction

Show alternative path (1)

Neighborhood in Abstraction Space

Equational logic sits in a moderately populated region (52^nd percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.

Family — Formal Logic & Language Constructs (20 abstractions)

Nearest neighbors

• Gödel–Dummett Logic — 0.86
• Existential Instantiation — 0.86
• Predicate abstraction — 0.86
• Two-Element Boolean Algebra — 0.86
• Valuation (logic) — 0.86

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