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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Foundations of Computer Science
Paper Title
Journal
Date
