Hierarchies of Computable groups and the word problem
From MaRDI portal
Publication:5567869
DOI10.2307/2270453zbMath0178.32502MaRDI QIDQ5567869
Publication date: 1966
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2270453
Related Items
Unnamed Item, Time-Complexity of the Word Problem for Semigroups and the Higman Embedding Theorem, Complexity, combinatorial group theory and the language of palutators, Straight-line program length as a parameter for complexity analysis, Searching for applicable versions of computable structures, Compression techniques in group theory, On the complexity of the identity problem for finitely defined groups, Groups Presented by Finite Two-Monadic Church-Rosser Thue Systems
Cites Work
- Das Identitätsproblem für Gruppen mit einer definierenden Relation
- Subgroups of finitely presented groups
- Enumeration and the Grzegorczyk Hierarchy
- Partial results regarding word problems and recursively enumerable degrees of unsolvability
- An Unsolvable Problem of Elementary Number Theory
- The word problem