Category
page 1Rewriting systems
term
mathematical expression that may form a separable part of an equation, a series, or another expression; used in in mathematical logic, universal algebra, and rewriting systems
unification
algorithmic process of solving equations between symbolic expressions
rewriting
In mathematics, linguistics, computer science, and logic, rewriting covers a wide range of methods of replacing subterms of a formula with other terms. Such methods may be achieved by rewriting systems (also known as rewrite systems, rewrite engines, or reduction systems). In their most basic form, they consist of a set of objects, plus relations on how to transform those objects.
Gröbner basis
particular generating subset of an ideal in a polynomial ring

Markov algorithm
string rewriting system that uses grammar-like rules to operate on strings of symbols
reflexive closure
operation on binary relations
Church–Rosser theorem
theorem that, when applying reduction rules to terms in some variants of the lambda calculus, the ordering in which the reductions are chosen does not make a difference to the eventual result
confluence
property of abstract rewriting systems
symmetric closure
operation on binary relations
Semi-Thue system
rewriting system over strings from an alphabet
abstract rewriting system
formal system for transcribing expressions into equivalent terms
Newman's lemma
lemma
normal form
an object that cannot be rewritten further
Buchberger's algorithm
algorithm