Soluble groups with a finite rewriting system

DOI10.1017/S0013091500018381zbMath0806.20030OpenAlexW1988325211MaRDI QIDQ4289419

No author found.

Publication date: 13 February 1995

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

Full work available at URL: https://doi.org/10.1017/s0013091500018381

zbMATH Keywords

finitely generated projective modulesexact sequencesrewriting systemsHNN-extensionsmetabelian groupsfinite extensionsamalgamated free productsconstructible soluble groupstype \((FP)_ \infty\)

Mathematics Subject Classification ID

Solvable groups, supersolvable groups (20F16) Generators, relations, and presentations of groups (20F05) Homological methods in group theory (20J05) Free products of groups, free products with amalgamation, Higman-Neumann-Neumann extensions, and generalizations (20E06) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items

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

Cites Work

• Unnamed Item
• 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