Finding non-trivial elements and splittings in groups.

DOI10.1016/j.jalgebra.2010.12.013zbMath1244.20034arXiv1002.2786OpenAlexW2126719858MaRDI QIDQ716463

Maurice Chiodo

Publication date: 22 September 2011

Published in: Journal of Algebra (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1002.2786

zbMATH Keywords

finitely presented groupsrecursion theoryalgorithms in groupsdecision problems in groupsfinite presentations of groupspartial algorithmsrecursively unsolvable problems

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) Applications of computability and recursion theory (03D80)

Related Items (3)

FINITELY ANNIHILATED GROUPS ⋮ Torsion, torsion length and finitely presented groups ⋮ THE SUBGROUP IDENTIFICATION PROBLEM FOR FINITELY PRESENTED GROUPS

Cites Work

• Recursive unsolvability of group theoretic problems
• Irreducible Outer Automorphisms of a Free Group
• Recursive Unsolvability of a problem of Thue
• On a Problem of J.H.C. Whitehead and a Problem of Alonzo Church.
• The word problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Finding non-trivial elements and splittings in groups.