Hierarchies of Computable groups and the word problem

DOI10.2307/2270453zbMath0178.32502OpenAlexW2158086683MaRDI QIDQ5567869

Frank B. Cannonito

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

zbMATH Keywords

recursion theory, constructive mathematics

Related Items

Unnamed Item, Complexity, combinatorial group theory and the language of palutators, Straight-line program length as a parameter for complexity analysis, Time-Complexity of the Word Problem for Semigroups and the Higman Embedding Theorem, Groups Presented by Finite Two-Monadic Church-Rosser Thue Systems, On the complexity of the identity problem for finitely defined groups, Searching for applicable versions of computable structures, Compression techniques in group theory

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