For groups the property of having finite derivation type is equivalent to the homological finiteness condition \(FP_ 3\)

DOI10.1006/jsco.1996.0046zbMath0874.20019OpenAlexW2035318451MaRDI QIDQ674765

Publication date: 25 September 1997

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jsco.1996.0046

zbMATH Keywords

word problem finitely presented groups conjugacy problem finite derivation type combinatorial finiteness properties of finitely presented monoids convergent string rewriting systems finite convergent presentations of groups identities among relations

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Generators, relations, and presentations of groups (20F05) Free semigroups, generators and relations, word problems (20M05) Homological methods in group theory (20J05) Grammars and rewriting systems (68Q42) Fundamental group, presentations, free differential calculus (57M05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items

THE PROPERTY FDT IS UNDECIDABLE FOR FINITELY PRESENTED MONOIDS THAT HAVE POLYNOMIAL-TIME DECIDABLE WORD PROBLEMS ⋮ SECOND ORDER DEHN FUNCTIONS OF GROUPS AND MONOIDS ⋮ ON HOMOTOPICAL AND HOMOLOGICAL FINITENESS CONDITIONS FOR FINITELY PRESENTED MONOIDS ⋮ SOME EXACT SEQUENCES FOR THE HOMOTOPY (BI-)MODULE OF A MONOID ⋮ FDT is undecidable for finitely presented monoids with solvable word problems ⋮ Constructing finitely presented monoids which have no finite complete presentation ⋮ Finite derivation type for semi-direct products of monoids ⋮ Homotopy bases and finite derivation type for subgroups of monoids. ⋮ For finitely presented monoids the homological finiteness conditions FHT and \(\text{bi-FP}_3\) coincide ⋮ The algebra of rewriting for presentations of inverse monoids ⋮ Higher-dimensional normalisation strategies for acyclicity ⋮ Homological finiteness properties of monoids, their ideals and maximal subgroups. ⋮ On some homotopical and homological properties of monoid presentations. ⋮ Algebra and geometry of rewriting ⋮ Groups acting on semimetric spaces and quasi-isometries of monoids ⋮ On properties not inherited by monoids from their Schützenberger groups. ⋮ On higher order homological finiteness of rewriting systems. ⋮ FINITENESS CONDITIONS FOR REWRITING SYSTEMS ⋮ Groupoids and the algebra of rewriting in group presentations ⋮ On Finite Complete Presentations and Exact Decompositions of Semigroups ⋮ Finite homotopy bases of one-relator monoids ⋮ Homotopy reduction systems for monoid presentations ⋮ Polygraphs of finite derivation type ⋮ Confluence of algebraic rewriting systems

This page was built for publication: For groups the property of having finite derivation type is equivalent to the homological finiteness condition \(FP_ 3\)