A complete proof of correctness of the Knuth-Bendix completion algorithm (Q1154801)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A complete proof of correctness of the Knuth-Bendix completion algorithm |
scientific article; zbMATH DE number 3729441
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A complete proof of correctness of the Knuth-Bendix completion algorithm |
scientific article; zbMATH DE number 3729441 |
Statements
A complete proof of correctness of the Knuth-Bendix completion algorithm (English)
0 references
1981
0 references
semidecision algorithm
0 references
validity problem in equational theories
0 references
decision procedure
0 references
term rewriting
0 references
