The computability of group constructions II

DOI10.1017/S0004972700045469zbMath0243.02036OpenAlexW2167631302MaRDI QIDQ5654034

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

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

Related Items (4)

Unnamed Item ⋮ Infinite groups ⋮ Infinitely generated subgroups of finitely presented groups. I ⋮ Subrekursive Komplexität bei Gruppen. II: Der Einbettungssatz von Higman für entscheidbare Gruppen

Cites Work

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

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