PERFECT BASES FOR EQUATIONAL THEORIES

Authors
JEZEK J MCNULTY GF
Citation
J. Jezek et Gf. Mcnulty, PERFECT BASES FOR EQUATIONAL THEORIES, Journal of symbolic computation, 19(5), 1995, pp. 489-505
Citations number
19
Categorie Soggetti
Mathematics,"Computer Sciences, Special Topics",Mathematics,"Computer Science Theory & Methods
Journal title
Journal of symbolic computation → ACNP
ISSN journal
07477171
Volume
19
Issue
5
Year of publication
1995
Pages
489 - 505
Database
ISI
SICI code
0747-7171(1995)19:5<489:PBFET>2.0.ZU;2-J
Abstract
Perfect bases for equational theories are closely related to confluent and finitely terminating term rewrite systems. The two classes have a large overlap, but neither contains the other. The class of perfect b ases is recursive. We also investigate a common generalization of both concepts; we call these more general bases normal, and touch the ques tion of their uniqueness. We also give numerous examples.