Computable algebra and group embeddings
DOI10.1016/0021-8693(81)90138-1zbMath0497.20023MaRDI QIDQ1170619
Frank B. Cannonito, Charles F. III Miller, Gilbert Baumslag
Publication date: 1981
Published in: Journal of Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0021-8693(81)90138-1
algorithms; polycyclic group; homology groups; finitely presented module; countable metabelian group; embedding groups in finitely presented groups; grouprings of nilpotent groups; locally abelian-by-nilpotent group
20E07: Subgroup theorems; subgroup growth
20C07: Group rings of infinite groups and their modules (group-theoretic aspects)
20F05: Generators, relations, and presentations of groups
20J05: Homological methods in group theory
20F10: Word problems, other decision problems, connections with logic and automata (group-theoretic aspects)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Infinitely generated subgroups of finitely presented groups. II
- Some algorithmic problems for solvable groups
- Infinitely generated subgroups of finitely presented groups. I
- Finite approximability of metabelian groups
- On groups satisfying Poincaré duality
- Guppen mit Poincaré-Dualität
- Constructions in Algebra
- Computable Algebra, General Theory and Theory of Computable Fields
- On the faithful representation of infinite groups by matrices
- Constructive Aspects of Noetherian Rings
- Finiteness Conditions for Soluble Groups
- On Infinite Soluble Groups (III)