Partial results regarding word problems and recursively enumerable degrees of unsolvability
From MaRDI portal
Publication:5729299
DOI10.1090/S0002-9904-1962-10876-3zbMath0118.25204OpenAlexW1999296887MaRDI QIDQ5729299
Publication date: 1962
Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0002-9904-1962-10876-3
Related Items (4)
The post correspondence problem ⋮ Hierarchies of Computable groups and the word problem ⋮ Some structure results for propositional calculi ⋮ Model-theoretic and algorithmic questions in group theory
This page was built for publication: Partial results regarding word problems and recursively enumerable degrees of unsolvability
