有可解但不一致可解的字问题的变种
A variety with solvable, but not uniformly solvable, word problem
摘要：
在文献中出现了两个概念的字问题的品种。一个簇有一个可判定的字问题，如果在该簇中的每一个子代数都有一个可判定的字问题。它有一个一致可判定的字问题，如果有一个算法，该算法给出了一个有限的介绍，产生一个算法，用于解决字问题的代数。一个品种是给了许多公理有一个可判定的，但不是一致可判定的，字问题。还给出了其他相关的例子。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
