Infinitely generated subgroups of finitely presented groups. I-Reference-Cited by-同舟云学术

Infinitely generated subgroups of finitely presented groups. I

Published:1977-06 Issue:2 Volume:153 Page:117-134
ISSN:0025-5874
Container-title:Mathematische Zeitschrift
language:en
Short-container-title:Math Z

Author:

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

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics

Link

http://link.springer.com/content/pdf/10.1007/BF01179785.pdf

Reference19 articles.

1. Amayo, R.K., Stewart, I.: Finitely generated lie algebras. J. London math. Soc.5, 697–703 (1972)

2. Baumslag, G., Cannonito, F.: Word problems in lie algebras, in preparation

3. Boone, W.W., Higman, G.: An algebraic characterization of groups with solvable word problem. J. Australian math. Soc.15, 41–53 (1974)

4. Boone, W.W., Rogers, Jr., H.: On a problem of J.H.C. Whitehead and a problem of Alonzo Church. Math. Scandinav.19, 185–192 (1966)

5. Cannonito, F.B., Gatterdam, R.W.: The computability of group constructions, part I. In Word Problems (Irvine, California 1969) pp. 365–400. Amsterdam. North-Holland 1973

Cited by 15 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Decomposability of finitely generated torsion-free nilpotent groups;International Journal of Algebra and Computation;2016-12

2. The Compressed Word Problem;The Compressed Word Problem for Groups;2014

3. Computing presentations for subgroups of polycyclic groups and of context-free groups;Applicable Algebra in Engineering, Communication and Computing;1994-09

4. Decision Problems for Groups — Survey and Reflections;Mathematical Sciences Research Institute Publications;1992

5. The algorithmic theory of polycyclic-by-finite groups;Journal of Algebra;1991-09