Infinitely generated subgroups of finitely presented groups. I
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3430637 (Why is no real title available?)
- scientific article; zbMATH DE number 3224578 (Why is no real title available?)
- scientific article; zbMATH DE number 3227055 (Why is no real title available?)
- scientific article; zbMATH DE number 3411305 (Why is no real title available?)
- A Finitely Presented Group Whose Group of Automorphisms is Infinitely Generated
- A basis for subgroups of free groups
- An algebraic characterization of groups with soluble word problem
- Computable Algebra, General Theory and Theory of Computable Fields
- Finitely Generated Lie Algebras
- Finitely Presented Groups with Word Problems of Arbitrary Degrees of Insolubility
- Finiteness Conditions for Soluble Groups
- On a Problem of J.H.C. Whitehead and a Problem of Alonzo Church.
- On algebraically closed groups
- Subgroups of finitely presented groups
- The computability of group constructions II
- Varieties of groups
Cited in
(8)- Computable algebra and group embeddings
- Unsolvable algorithmic problems for semigroups, groups and rings
- Model-theoretic and algorithmic questions in group theory
- Decomposability of finitely generated torsion-free nilpotent groups
- Infinite groups
- The algorithmic theory of polycyclic-by-finite groups
- Deciding if an automorphism of an infinite soluble group is inner
- Two decidable Markov properties over a class of solvable groups
This page was built for publication: Infinitely generated subgroups of finitely presented groups. I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1227972)
