Soluble groups with a finite rewriting system

DOI10.1017/S0013091500018381zbMath0806.20030MaRDI QIDQ4289419

No author found.

Publication date: 13 February 1995

Published in: Proceedings of the Edinburgh Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

finitely generated projective modules; exact sequences; rewriting systems; HNN-extensions; metabelian groups; finite extensions; amalgamated free products; constructible soluble groups; type \((FP)_ \infty\)

Mathematics Subject Classification ID

20F16: Solvable groups, supersolvable groups

20F05: Generators, relations, and presentations of groups

20J05: Homological methods in group theory

20E06: Free products of groups, free products with amalgamation, Higman-Neumann-Neumann extensions, and generalizations

20F10: Word problems, other decision problems, connections with logic and automata (group-theoretic aspects)

Related Items

Theorem proving with group presentations: Examples and questions, Homology and closure properties of autostackable groups, Algorithms and topology of Cayley graphs for groups., On properties not inherited by monoids from their Schützenberger groups., Artin groups, rewriting systems and three-manifolds, Geometry of the word problem for 3-manifold groups, On Finite Complete Presentations and Exact Decompositions of Semigroups

Cites Work

• Verifying nilpotence
• Cohomological dimension of soluble groups
• Word problems and a homological finiteness condition for monoids
• Constructable solvable groups
• Bieri-Strebel Valuations (of Finite Rank)
• On the Homology of Associative Algebras
• Unnamed Item