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