The Boone-Higman theorem and the conjugacy problem

DOI10.1016/0021-8693(77)90281-2zbMath0401.20030OpenAlexW2013455429MaRDI QIDQ1255094

George S. Sacerdote

Publication date: 1977

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

Full work available at URL: https://doi.org/10.1016/0021-8693(77)90281-2

zbMATH Keywords

Algebraic CharacterizationBoone-Higman TheoremFinitely Generated Groups with Solvable Conjugacy ProblemFinitely Generated Simple Subgroup of a Finitely Presented GroupFree ProductMagnus ProblemOrder ProblemPower Problem

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items (4)

Unsolvable algorithmic problems for semigroups, groups and rings ⋮ Algebraic equivalents of the solvability of group-theoretic algorithmic problems ⋮ A characterization of the subgroups of finitely presented groups ⋮ Model-theoretic and algorithmic questions in group theory

Cites Work

• Unnamed Item
• Unnamed Item
• On Dehn's algorithm
• On Dehn's algorithm and the conjugacy problem
• Recursively enumerable degress and the conjugacy problem
• Subgroups of finitely presented groups
• An algebraic characterization of groups with soluble word problem
• Some Undecidable Problems in Group Theory

This page was built for publication: The Boone-Higman theorem and the conjugacy problem