scientific article; zbMATH DE number 3439107

MaRDI QIDQ4405083zbMATH OpenFDO

Authors 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, https://eudml.org/doc/89177

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)

Cites work

• scientific article; zbMATH DE number 3430637 (Why is no real title available?)
• scientific article; zbMATH DE number 3216237 (Why is no real title available?)
• scientific article; zbMATH DE number 3414284 (Why is no real title available?)
• scientific article; zbMATH DE number 3073037 (Why is no real title available?)
• Finitely Presented Groups with Word Problems of Arbitrary Degrees of Insolubility
• Hierarchies of Computable groups and the word problem
• On a problem of Philip Hall
• The computability of group constructions II
• The word problem and power problem in 1-relator groups are primitive recursive
• 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

Cited in

(4)

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

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4405083)