Term rewriting for equational theories
Summary
Term rewriting replaces the symmetric equations of an equational theory by one-way rules that rewrite terms. Two terms are equal in the theory exactly when they are connected by a chain of rule applications in either direction. When the rules are terminating and confluent, every term has a unique normal form. Then two terms are equal in the theory exactly when their normal forms coincide. This turns many word problems for free algebras into a mechanical computation, and the Knuth–Bendix procedure tries to find such rules.
Further reading
- Web https://en.wikipedia.org/wiki/Rewriting, Term rewriting systems
About this page
| Tag | A6J731Y193 |
|---|---|
| URI | m2://A6J731Y193 |
| Kind | concept |
| Writing | W0 stub |
| MSC | 68Q42, 08B05, 03B35 |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.