Infinitely generated subgroups of finitely presented groups. I

DOI10.1007/BF01179785zbMath0332.20009OpenAlexW4251896156MaRDI QIDQ1227972

Frank B. Cannonito, Gilbert Baumslag, Charles F. III Miller

Publication date: 1977

Published in: Mathematische Zeitschrift (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/172485

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Automorphisms of infinite groups (20E36) Free nonabelian groups (20E05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Local properties of groups (20E25)

Related Items (8)

Unsolvable algorithmic problems for semigroups, groups and rings ⋮ Deciding if an automorphism of an infinite soluble group is inner ⋮ Decomposability of finitely generated torsion-free nilpotent groups ⋮ Two decidable Markov properties over a class of solvable groups ⋮ Infinite groups ⋮ Computable algebra and group embeddings ⋮ The algorithmic theory of polycyclic-by-finite groups ⋮ Model-theoretic and algorithmic questions in group theory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On algebraically closed groups
• Subgroups of finitely presented groups
• An algebraic characterization of groups with soluble word problem
• Varieties of groups
• A Finitely Presented Group Whose Group of Automorphisms is Infinitely Generated
• Computable Algebra, General Theory and Theory of Computable Fields
• On a Problem of J.H.C. Whitehead and a Problem of Alonzo Church.
• Finitely Presented Groups with Word Problems of Arbitrary Degrees of Insolubility
• The computability of group constructions II
• Finitely Generated Lie Algebras
• Finiteness Conditions for Soluble Groups
• A basis for subgroups of free groups

This page was built for publication: Infinitely generated subgroups of finitely presented groups. I