An Embedding Theorem for Finitely Generated Groups
From MaRDI portal
Publication:5531016
DOI10.1112/plms/s3-17.3.419zbMath0152.00204OpenAlexW2010414076MaRDI QIDQ5531016
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
Related Items (14)
Group Embeddings with Algorithmic Properties ⋮ Embeddings in finitely presented groups which preserve the center. ⋮ 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 ⋮ The computability of group constructions II ⋮ An algebraic characterization of groups with soluble word problem ⋮ On the difficulty of presenting finitely presentable groups. ⋮ The conjugacy problem for groups, and Higman embeddings ⋮ Satisfaction of existential theories in finitely presented groups and some embedding theorems. ⋮ On decidability of amenability in computable groups ⋮ General theory of groups ⋮ Model-theoretic and algorithmic questions in group theory ⋮ Asymptotic invariants, complexity of groups and related problems
This page was built for publication: An Embedding Theorem for Finitely Generated Groups
