Soluble groups with a finite rewriting system
amalgamated free productsconstructible soluble groupsexact sequencesfinite extensionsfinitely generated projective modulesHNN-extensionsmetabelian groupsrewriting systemstype \((FP)_ \infty\)
Free products of groups, free products with amalgamation, Higman-Neumann-Neumann extensions, and generalizations (20E06) Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Solvable groups, supersolvable groups (20F16) Homological methods in group theory (20J05)
- Bieri-Strebel Valuations (of Finite Rank)
- Cohomological dimension of soluble groups
- Constructable solvable groups
- scientific article; zbMATH DE number 67429 (Why is no real title available?)
- On the Homology of Associative Algebras
- Verifying nilpotence
- Word problems and a homological finiteness condition for monoids
- Artin groups, rewriting systems and three-manifolds
- Geometry of the word problem for 3-manifold groups
- Finite REA-groups are solvable
- On Finite Complete Presentations and Exact Decompositions of Semigroups
- scientific article; zbMATH DE number 5778575 (Why is no real title available?)
- Algorithms and topology of Cayley graphs for groups.
- Theorem proving with group presentations: examples and questions
- scientific article; zbMATH DE number 848081 (Why is no real title available?)
- On properties not inherited by monoids from their Schützenberger groups.
- Homology and closure properties of autostackable groups
This page was built for publication: Soluble groups with a finite rewriting system
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4289419)
