An Embedding Theorem for Finitely Generated Groups

DOI10.1112/PLMS/S3-17.3.419MaRDI QIDQ5531016zbMATH OpenOpenAlexFDO

Authors C. R. J. Clapham

Publication date 1967

Published in Proceedings of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1112/plms/s3-17.3.419

zbMATH Keywords

group theory

Cited in

(15)

• Model-theoretic and algorithmic questions in group theory
• Unsolvable algorithmic problems for semigroups, groups and rings
• Decision problems in classes of group presentations with uniformly solvable word problem
• Algebraic equivalents of the solvability of group-theoretic algorithmic problems
• General theory of groups
• On decidability of amenability in computable groups
• Satisfaction of existential theories in finitely presented groups and some embedding theorems.
• Asymptotic invariants, complexity of groups and related problems.
• Group Embeddings with Algorithmic Properties
• An algebraic characterization of groups with soluble word problem
• The conjugacy problem for groups, and Higman embeddings
• The computability of group constructions II
• On the difficulty of presenting finitely presentable groups.
• Hyperbolic groups satisfy the Boone-Higman conjecture
• Embeddings in finitely presented groups which preserve the center.

This page was built for publication: An Embedding Theorem for Finitely Generated Groups

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