Math 2.0

Computer science Concept

Term rewriting for equational theories

Summary

Term rewriting replaces the symmetric equations of an equational theory by one-way rules l→rl \to r 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

  1. Web https://en.wikipedia.org/wiki/Rewriting, Term rewriting systems
About this page
TagA6J731Y193
URIm2://A6J731Y193
Kindconcept
WritingW0 stub
MSC68Q42, 08B05, 03B35
Changed2 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.

What links here

Definitions