A categorical critical-pair completion algorithm (Q1300576)
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 categorical critical-pair completion algorithm |
scientific article; zbMATH DE number 1330687
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A categorical critical-pair completion algorithm |
scientific article; zbMATH DE number 1330687 |
Statements
A categorical critical-pair completion algorithm (English)
0 references
8 March 2000
0 references
A general categorical critical-pair completion algorithm is proposed; it covers Knuth-Bendix procedure for term rewriting systems, Gröbner basis algorithm and the resolution procedure.
0 references
critical-pair completion algorithm
0 references
Knuth-Bendix procedure
0 references
Gröbner basis
0 references
resolution
0 references
0 references
