On Proving Uniform Termination and Restricted Termination of Rewriting Systems (Q3040518)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3835346
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On Proving Uniform Termination and Restricted Termination of Rewriting Systems |
scientific article; zbMATH DE number 3835346 |
Statements
On Proving Uniform Termination and Restricted Termination of Rewriting Systems (English)
0 references
1983
0 references
uniform termination
0 references
restricted termination
0 references
global finiteness
0 references
rewrite rules
0 references
confluence
0 references
Knuth-Bendix algorithm
0 references
overlap closure
0 references
canonical
0 references
rewrite dominoes
0 references
equational axioms
0 references
term rewriting systems
0 references
