A Variety with Solvable, but not Uniformly Solvable, Word Problem
From MaRDI portal
Publication:4290004
DOI10.1112/plms/s3-66.2.225zbMath0796.08006arXivmath/9301203WikidataQ64357047 ScholiaQ64357047MaRDI QIDQ4290004
Saharon Shelah, Evelyn Nelson, Alan H. Mekler
Publication date: 28 September 1994
Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/9301203
halting problem; universal Turing machine; infinite type; solvable word problem; finitely based variety of finite type; recursively based variety of finite type; uniformly solvable word problem
03D40: Word problems, etc. in computability and recursion theory
08B99: Varieties
08A50: Word problems (aspects of algebraic structures)
Related Items
A finitely axiomatizable undecidable equational theory with recursively solvable word problems, A field guide to equational logic, On dynamic algebras, A variety with locally solvable but globally unsolvable word problem