The computability of group constructions II

DOI10.1017/S0004972700045469MaRDI QIDQ5654034zbMATH OpenOpenAlexFDO

Authors R. W. Gatterdam

Publication date 1973

Published in Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0004972700045469

Mathematics Subject Classification ID

Word problems, etc. in computability and recursion theory (03D40) Hierarchies of computability and definability (03D55) Free products of groups, free products with amalgamation, Higman-Neumann-Neumann extensions, and generalizations (20E06) Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Cites work

• An Embedding Theorem for Finitely Generated Groups
• Finitely Presented Groups with Word Problems of Arbitrary Degrees of Insolubility

Cited in

(4)

• Infinite groups
• Infinitely generated subgroups of finitely presented groups. I
• Subrekursive Komplexität bei Gruppen. II: Der Einbettungssatz von Higman für entscheidbare Gruppen
• scientific article; zbMATH DE number 3439107 (Why is no real title available?)

This page was built for publication: The computability of group constructions II

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