A variety with locally solvable but globally unsolvable word problem
From MaRDI portal
Publication:1918965
DOI10.1007/BF01197182zbMath0856.08003MaRDI QIDQ1918965
Publication date: 23 July 1996
Published in: Algebra Universalis (Search for Journal in Brave)
03D35: Undecidability and degrees of sets of sentences
08B05: Equational logic, Mal'tsev conditions
03D40: Word problems, etc. in computability and recursion theory
08A50: Word problems (aspects of algebraic structures)
Related Items
A finitely axiomatizable undecidable equational theory with recursively solvable word problems, Applying, extending, and specializing pseudorecursiveness, PSEUDORECURSIVE VARIETIES OF SEMIGROUPS — II
Cites Work