TY - JOUR
T1 - A Variety with Solvable, but not Uniformly Solvable, Word Problem
AU - Mekler, Alan H.
AU - Nelson, Evelyn
AU - Shelah, Saharon
PY - 1993/3
Y1 - 1993/3
N2 - In the literature two notions of the word problem for a variety occur. A variety has a decidable word problem if every finitely presented algebra in the variety has a decidable word problem. It has a uniformly decidable word problem if there is an algorithm which given a finite presentation produces an algorithm for solving the word problem of the algebra so presented. A variety is given with finitely many axioms having a decidable, but not uniformly decidable, word problem. Other related examples are given as well.
AB - In the literature two notions of the word problem for a variety occur. A variety has a decidable word problem if every finitely presented algebra in the variety has a decidable word problem. It has a uniformly decidable word problem if there is an algorithm which given a finite presentation produces an algorithm for solving the word problem of the algebra so presented. A variety is given with finitely many axioms having a decidable, but not uniformly decidable, word problem. Other related examples are given as well.
UR - https://www.scopus.com/pages/publications/84963012151
U2 - 10.1112/plms/s3-66.2.225
DO - 10.1112/plms/s3-66.2.225
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:84963012151
SN - 0024-6115
VL - s3-66
SP - 225
EP - 256
JO - Proceedings of the London Mathematical Society
JF - Proceedings of the London Mathematical Society
IS - 2
ER -