For groups the property of having finite derivation type is equivalent to the homological finiteness condition FP_ 3
For groups the property of having finite derivation type is equivalent to the homological finiteness condition \(FP 3\)
conjugacy problemword problemfinitely presented groupsfinite derivation typecombinatorial finiteness properties of finitely presented monoidsconvergent string rewriting systemsfinite convergent presentations of groupsidentities among relations
Symbolic computation and algebraic computation (68W30) Generators, relations, and presentations of groups (20F05) Homological methods in group theory (20J05) Fundamental group, presentations, free differential calculus (57M05) Grammars and rewriting systems (68Q42) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Free semigroups, generators and relations, word problems (20M05)
- FINITENESS CONDITIONS FOR REWRITING SYSTEMS
- Low dimensional homotopy for monoids II: groups
- Finite derivation type implies the homological finiteness condition \(FP_ 3\)
- A finiteness condition for rewriting systems
- Finite derivation type for semi-direct products of monoids
- On higher order homological finiteness of rewriting systems.
- Higher-dimensional normalisation strategies for acyclicity
- scientific article; zbMATH DE number 5218144
- Finite derivation type property on the Chinese monoid.
- A new finiteness condition for monoids presented by complete rewriting systems (after Craig C. Squier)
- Homotopy bases and finite derivation type for subgroups of monoids.
- Homological finiteness properties of monoids, their ideals and maximal subgroups.
- On some homotopical and homological properties of monoid presentations.
- Finite derivation type for semi-direct products of monoids
- On higher order homological finiteness of rewriting systems.
- Finite derivation type implies the homological finiteness condition \(FP_ 3\)
- Finite derivation type property on the Chinese monoid.
- The algebra of rewriting for presentations of inverse monoids
- Relative rewriting systems.
- Finite homotopy bases of one-relator monoids
- FINITENESS CONDITIONS FOR REWRITING SYSTEMS
- On properties not inherited by monoids from their Schützenberger groups.
- Homotopy reduction systems for monoid presentations
- Constructing finitely presented monoids which have no finite complete presentation
- Higher-dimensional normalisation strategies for acyclicity
- Groups acting on semimetric spaces and quasi-isometries of monoids.
- Algebra and geometry of rewriting
- SOME EXACT SEQUENCES FOR THE HOMOTOPY (BI-)MODULE OF A MONOID
- Confluence of algebraic rewriting systems
- On Finite Complete Presentations and Exact Decompositions of Semigroups
- For finitely presented monoids the homological finiteness conditions FHT and \(\text{bi-FP}_3\) coincide
- Low dimensional homotopy for monoids II: groups
- THE PROPERTY FDT IS UNDECIDABLE FOR FINITELY PRESENTED MONOIDS THAT HAVE POLYNOMIAL-TIME DECIDABLE WORD PROBLEMS
- Groupoids and the algebra of rewriting in group presentations
- FDT is undecidable for finitely presented monoids with solvable word problems
- Polygraphs of finite derivation type
- ON HOMOTOPICAL AND HOMOLOGICAL FINITENESS CONDITIONS FOR FINITELY PRESENTED MONOIDS
- SECOND ORDER DEHN FUNCTIONS OF GROUPS AND MONOIDS
This page was built for publication: For groups the property of having finite derivation type is equivalent to the homological finiteness condition \(FP_ 3\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q674765)
