About the rewriting systems produced by the Knuth-Bendix completion algorithm
type: Item
instance of: scholarly article
title: About the rewriting systems produced by the Knuth-Bendix completion algorithm
zbMATH Open document ID: 0506.68032
DOI: 10.1016/0020-0190(83)90009-1
published in: Information Processing Letters
publication date: 1983-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q65
zbMATH DE Number: 3799009
zbMATH Keywords: congruence
zbMATH Keywords: free F-algebra
zbMATH Keywords: complete rewriting system
author: Yves Métivier
MaRDI profile type: Publication
full work available at URL: 0020-0190(83)90009-1
OpenAlex ID: W2093318042
cites work: Q3659160
cites work: A complete proof of correctness of the Knuth-Bendix completion algorithm
cites work: Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
cites work: Q5581665
description: scientific article; zbMATH DE number 3799009