Jump to content

Rule of replacement

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Monkbot (talk | contribs) at 09:56, 18 December 2020 (Task 18 (cosmetic): eval 2 templates: del empty params (1×); del |ref=harv (1×);). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In logic, a rule of replacement[1][2][3] is a transformation rule that may be applied to only a particular segment of an expression. A logical system may be constructed so that it uses either axioms, rules of inference, or both as transformation rules for logical expressions in the system. Whereas a rule of inference is always applied to a whole logical expression, a rule of replacement may be applied to only a particular segment. Within the context of a logical proof, logically equivalent expressions may replace each other. Rules of replacement are used in propositional logic to manipulate propositions.

Common rules of replacement include de Morgan's laws, commutation, association, distribution, double negation,[a] transposition, material implication, material equivalence, exportation, and tautology.

Notes

  1. ^ not admitted in intuitionistic logic

References

  1. ^ Copi, Irving M.; Cohen, Carl (2005). Introduction to Logic. Prentice Hall.
  2. ^ Hurley, Patrick (1991). A Concise Introduction to Logic 4th edition. Wadsworth Publishing.
  3. ^ Moore and Parker [full citation needed]