Rule of replacement
Lua error in package.lua at line 80: module 'strict' not found.
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,[4] transposition, material implication, material equivalence, exportation, and tautology.
References
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
- ↑ Moore and Parker
- ↑ not admitted in intuitionistic logic
<templatestyles src="Asbox/styles.css"></templatestyles>
 |
This logic-related article is a stub. You can help Wikipedia by expanding it. |
