SettingsRewriting systems
Abstract rewriting system
In mathematical logic and theoretical computer science, an abstract rewriting system (also (abstract) reduction system or abstract rewrite system; abbreviation ARS) is a formal...
In mathematical logic and theoretical computer science, an abstract rewriting system (also (abstract) reduction system or abstract rewrite system; abbreviation ARS) is a formal...
Buchberger's algorithm
In computational algebraic geometry and computational commutative algebra, Buchberger's algorithm is a method of transforming a given set of generators for a polynomial ideal into a Gröbner basi...
In computational algebraic geometry and computational commutative algebra, Buchberger's algorithm is a method of transforming a given set of generators for a polynomial ideal into a Gröbner basi...
Church-Rosser theorem
The Church–Rosser theorem states that if there are two distinct reductions starting from the same lambda calculus term, then there exists a term that is reachable from each reduct via a (possibl...
The Church–Rosser theorem states that if there are two distinct reductions starting from the same lambda calculus term, then there exists a term that is reachable from each reduct via a (possibl...
Church–Rosser theorem
The Church–Rosser theorem states that if there are two distinct reductions starting from the same lambda calculus term, then there exists a term that is reachable from each reduct via a (possibl...
The Church–Rosser theorem states that if there are two distinct reductions starting from the same lambda calculus term, then there exists a term that is reachable from each reduct via a (possibl...
Confluence (abstract rewriting)
In computer science, confluence is a property of rewriting systems, describing that terms in this system can be rewritten in more than one way, to yield the same result.
In computer science, confluence is a property of rewriting systems, describing that terms in this system can be rewritten in more than one way, to yield the same result.
Convergence (logic)
In mathematics, computer science and logic, convergence refers to the idea that a series of transformations come to a conclusion in a finite amount of time, and that the conclusion reached is in...
In mathematics, computer science and logic, convergence refers to the idea that a series of transformations come to a conclusion in a finite amount of time, and that the conclusion reached is in...
Critical pair
The term "critical pair" has two distinct meanings in mathematics: in mathematical logic and in order theory.
The term "critical pair" has two distinct meanings in mathematics: in mathematical logic and in order theory.
Divergence (computer science)
In computer science, a computation is said to diverge if it does not terminate or terminates in an exceptional state.
In computer science, a computation is said to diverge if it does not terminate or terminates in an exceptional state.
Explicit substitution
In computer science, explicit substitution is any of several calculi based on the lambda calculus that pay special attention to the formalization of the process of substitution.
In computer science, explicit substitution is any of several calculi based on the lambda calculus that pay special attention to the formalization of the process of substitution.
Gröbner basis
In computer algebra, computational algebraic geometry, and computational commutative algebra, a Gröbner basis is a particular kind of generating subset of an ideal I in a polynomial ring '...
In computer algebra, computational algebraic geometry, and computational commutative algebra, a Gröbner basis is a particular kind of generating subset of an ideal I in a polynomial ring '...
Knuth-Bendix completion algorithm
The Knuth–Bendix completion algorithm (named after Donald Knuth and Peter Bendix) is an algorithm for transforming a set of equations (over terms) into a confluent term rewriting system.
The Knuth–Bendix completion algorithm (named after Donald Knuth and Peter Bendix) is an algorithm for transforming a set of equations (over terms) into a confluent term rewriting system.
Knuth–Bendix completion algorithm
The Knuth–Bendix completion algorithm (named after Donald Knuth and Peter Bendix) is an algorithm for transforming a set of equations (over terms) into a confluent term rewriting system.
The Knuth–Bendix completion algorithm (named after Donald Knuth and Peter Bendix) is an algorithm for transforming a set of equations (over terms) into a confluent term rewriting system.
Newman's lemma
In the theory of rewriting systems, Newman's lemma states that a terminating (or strongly normalizing) abstract rewriting system (ARS), that is, one in which there are no infinite reduction sequ...
In the theory of rewriting systems, Newman's lemma states that a terminating (or strongly normalizing) abstract rewriting system (ARS), that is, one in which there are no infinite reduction sequ...
Normal form (abstract rewriting)
In abstract rewriting, a normal form is an element of the system which cannot be rewritten any further.
In abstract rewriting, a normal form is an element of the system which cannot be rewritten any further.
Orthogonality (term rewriting)
Orthogonality as a property of term rewriting systems describes where the reduction rules of the system are all left-linear, that is each variable occurs only once on the left hand side of each ...
Orthogonality as a property of term rewriting systems describes where the reduction rules of the system are all left-linear, that is each variable occurs only once on the left hand side of each ...
Overlap (term rewriting)
In mathematics, computer science and logic, overlap, as a property of the reduction rules in term rewriting system, describes a situation where a number of different reduction rules specify pote...
In mathematics, computer science and logic, overlap, as a property of the reduction rules in term rewriting system, describes a situation where a number of different reduction rules specify pote...
Reduction strategy
In code optimization during the translation of computer programs into an executable form, and in mathematical reduction generally, a reduction strategy for a term rewriting system determines whi...
In code optimization during the translation of computer programs into an executable form, and in mathematical reduction generally, a reduction strategy for a term rewriting system determines whi...
Reflexive closure
In mathematics, the reflexive closure of a binary relation R on a set X is the smallest reflexive relation on X that contains R.
In mathematics, the reflexive closure of a binary relation R on a set X is the smallest reflexive relation on X that contains R.
Rewriting
In mathematics, computer science and logic, rewriting covers a wide range of (potentially non-deterministic) methods of replacing subterms of a formula with other terms.
In mathematics, computer science and logic, rewriting covers a wide range of (potentially non-deterministic) methods of replacing subterms of a formula with other terms.
Semi-Thue system
In theoretical computer science and mathematical logic a string rewriting system, historically called a semi-Thue system, is a rewriting system over strings from an alphabet.
In theoretical computer science and mathematical logic a string rewriting system, historically called a semi-Thue system, is a rewriting system over strings from an alphabet.
Symmetric closure
In mathematics, the symmetric closure of a binary relation R on a set X is the smallest symmetric relation on X that contains R.
In mathematics, the symmetric closure of a binary relation R on a set X is the smallest symmetric relation on X that contains R.
Term (logic)
In mathematical logic and rewriting systems, terms are expressions which can be obtained from variables and function symbols.
In mathematical logic and rewriting systems, terms are expressions which can be obtained from variables and function symbols.
Word problem (mathematics)
In mathematics and computer science, a word problem for a set S with respect to a system of finite encodings of its elements is the algorithmic problem of deciding whether two given representati...
In mathematics and computer science, a word problem for a set S with respect to a system of finite encodings of its elements is the algorithmic problem of deciding whether two given representati...