Perfect bases for equational theories
Journal of Symbolic Computation(1995)
摘要
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 bases is recursive. We also investigate a common generalization of both concepts; we call these more general bases normal, and touch the question of their uniqueness. We also give numerous examples.
更多查看译文
关键词
equational theory,perfect base
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要