On higher order homological finiteness of rewriting systems.
DOI10.1016/J.JPAA.2004.12.035zbMath1074.20035OpenAlexW1992331355MaRDI QIDQ557065
Friedrich Otto, Stephen J. Pride
Publication date: 23 June 2005
Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jpaa.2004.12.035
word problemfinitely presented groupsfinitely presented monoidsfinite derivation typefinite homological typefinite rewriting systems
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) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Connections of semigroups with homological algebra and category theory (20M50)
Related Items (3)
Cites Work
- For groups the property of having finite derivation type is equivalent to the homological finiteness condition \(FP_ 3\)
- The topology of discrete groups
- Graph groups are biautomatic
- A finiteness condition for rewriting systems
- Morse theory and finiteness properties of groups
- For finitely presented monoids the homological finiteness conditions FHT and \(\text{bi-FP}_3\) coincide
- HNN extensions of inverse semigroups and groupoids.
- Homological Finiteness Conditions for Groups, Monoids, and Algebras
- FINITENESS CONDITIONS FOR REWRITING SYSTEMS
- SECOND ORDER DEHN FUNCTIONS OF GROUPS AND MONOIDS
- FOR REWRITING SYSTEMS THE TOPOLOGICAL FINITENESS CONDITIONS FDT AND FHT ARE NOT EQUIVALENT
- EMBEDDING THEOREMS FOR SEMIGROUPS
- A Finitely Generated Infinite Simple Group
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On higher order homological finiteness of rewriting systems.
