THE WORD PROBLEM OF ACD-GROUND THEORIES IS UNDECIDABLE
- 1 March 1992
- journal article
- Published by World Scientific Pub Co Pte Ltd in International Journal of Foundations of Computer Science
- Vol. 3 (1) , 81-92
- https://doi.org/10.1142/s0129054192000085
Abstract
We prove that there exists an ACD-ground theory, i.e., an equational theory defined by a set of ground equations plus the associativity and commutativity of two binary symbols * and +, and the distributivity of * over +, for which the word problem is undecidable.Keywords
This publication has 0 references indexed in Scilit: