scientific article; zbMATH DE number 3439107

zbMath0279.20028MaRDI QIDQ4405083

R. W. Gatterdam, Frank B. Cannonito

Publication date: 1973

Full work available at URL: http://www.numdam.org/item?id=CM_1973__27_1_39_0

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Recursive functions and relations, subrecursive hierarchies (03D20)

Related Items

Infinite groups, Algorithmische Probleme bei Einrelatorgruppen und ihre Komplexität, Model-theoretic and algorithmic questions in group theory, Pseudo-natural algorithms for the word problem for finitely presented monoids and groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The word problem and power problem in 1-relator groups are primitive recursive
• On a problem of Philip Hall
• Word problems and recursively enumerable degrees at unsolvability. A first paper on Thue systems
• Word problems and recursively enumerable degrees of unsolvability. A sequel on finitely presented groups
• Hierarchies of Computable groups and the word problem
• Finitely Presented Groups with Word Problems of Arbitrary Degrees of Insolubility
• The computability of group constructions II