Rule of replacement¶

Rewrite a designated subformula with a logically equivalent expression inside a larger propositional formula while preserving the whole formula's truth conditions.

Version: v1 · 2026-08-30 · History
Domain-specific #: 2699
Origin domain: logic
Subdomain: natural deduction
Aliases: Replacement rule, Rule of equivalence replacement

Core Idea¶

In a propositional proof system, a rule of replacement licenses replacing a selected occurrence of a subformula by another formula that is logically equivalent under an admitted equivalence schema. If \(A\leftrightarrow B\) is a tautological equivalence of the system, an occurrence of \(A\) inside a larger context \(C[\,]\) can be rewritten as \(B\), yielding \(C[B]\) from \(C[A]\). The defining privilege is locality: the rule can operate within a formula rather than requiring the entire proof line to match the premise pattern of an inference rule.

Scope of Application¶

The abstraction is literal wherever practitioners can identify the same constitutive roles, apply the same boundary tests, and obtain the same kind of output. The following habitats are uses of Rule of replacement itself, not metaphors based only on resemblance.

Propositional natural deduction. Transforming a subformula so a whole-line inference rule can apply.
Equivalence proofs. Chaining admitted biconditional laws to normalize a formula.
Normal-form conversion. Rewriting conditionals, negations, conjunctions, and disjunctions under controlled laws.
Proof checking. Verifying that a local transformation preserves the admitted semantics.
Logic instruction. Separating equivalence-preserving local moves from consequence-preserving whole-line moves.
Automated deduction interfaces. Representing certified propositional simplification steps with explicit occurrence information.

Clarity¶

A clear account of Rule of replacement must preserve the recognition invariant stated in the Core Idea rather than rely on the title alone. Name the host logic and the exact equivalence schema rather than saying only ‘by replacement.’ Identify the occurrence changed and the direction in which the equivalence was used. Distinguish the meta-level replacement permission from an object-language biconditional written as a formula.

Manages Complexity¶

Rule of replacement manages complexity by replacing a diffuse field of observations or possible operations with a bounded role structure: host formula supplies a well-formed propositional expression contains the occurrence to be changed.; selected occurrence supplies one subformula position is identified without silently changing other occurrences.; equivalence schema supplies an admitted bidirectional law relates the old and new subformulas.; context boundary supplies the surrounding connectives remain fixed while the local expression changes.; substitution step supplies the new equivalent expression is inserted at the selected position..

Abstract Reasoning¶

Locate the exact subformula that blocks the next intended proof step. 2. Choose an equivalence schema admitted by the current formal system. 3. Match the schema variables to the selected occurrence without crossing a scope boundary. 4. Rewrite in the direction that exposes the desired connective or normal form. 5. Verify the resulting expression is well formed and only the intended occurrence changed. 6.

Knowledge Transfer¶

The strict upward abstraction is Equivalence Preserving Rewriting. Rule of Replacement instantiates Equivalence-Preserving Rewriting because it changes operational form inside a declared context while preserving logical meaning under an explicit equivalence relation. Within natural deduction, the full mechanism transfers literally when the same roles and boundary tests recur. Beyond that domain, only the parent-level skeleton should travel. Reusing the label Rule of replacement after removing its constitutive vocabulary would hide a change of mechanism behind an analogy. The honest transfer rule is therefore two-stage: recognize the domain-specific pattern first, then lift only the parent relation that remains invariant under a substrate change.

Relationships to Other Abstractions¶

Current abstraction Rule of replacement Domain-specific

Parents (1) — more general patterns this builds on

Rule of replacement is a kind of Equivalence-Preserving Rewriting Prime

Rule of Replacement instantiates Equivalence-Preserving Rewriting because it changes operational form inside a declared context while preserving logical meaning under an explicit equivalence relation.

Hierarchy paths (2) — routes to 2 parentless roots

Rule of replacement → Equivalence-Preserving Rewriting → Transformation → Function (Mapping)

Show alternative path (1)

Neighborhood in Abstraction Space¶

Rule of replacement sits in a sparse region of the domain-specific corpus (87^th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Unclustered & Miscellaneous (1565 abstractions)

Nearest neighbors

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