On higher order homological finiteness of rewriting systems.
DOI10.1016/J.JPAA.2004.12.035zbMATH Open1074.20035OpenAlexW1992331355MaRDI QIDQ557065FDOQ557065
Authors: Stephen J. Pride, Friedrich Otto 
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
Recommendations
- FOR REWRITING SYSTEMS THE TOPOLOGICAL FINITENESS CONDITIONS FDT AND FHT ARE NOT EQUIVALENT
- scientific article; zbMATH DE number 1419256
- A new finiteness condition for monoids presented by complete rewriting systems (after Craig C. Squier)
- FINITENESS CONDITIONS FOR REWRITING SYSTEMS
- scientific article; zbMATH DE number 5218144
word problemfinitely presented groupsfinite derivation typefinitely presented monoidsfinite homological typefinite rewriting systems
Generators, relations, and presentations of groups (20F05) 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) Free semigroups, generators and relations, word problems (20M05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Finitely Generated Infinite Simple Group
- HNN extensions of inverse semigroups and groupoids.
- EMBEDDING THEOREMS FOR SEMIGROUPS
- Morse theory and finiteness properties of groups
- Title not available (Why is that?)
- A finiteness condition for rewriting systems
- Homological Finiteness Conditions for Groups, Monoids, and Algebras
- SECOND ORDER DEHN FUNCTIONS OF GROUPS AND MONOIDS
- FOR REWRITING SYSTEMS THE TOPOLOGICAL FINITENESS CONDITIONS FDT AND FHT ARE NOT EQUIVALENT
- For groups the property of having finite derivation type is equivalent to the homological finiteness condition \(FP_ 3\)
- For finitely presented monoids the homological finiteness conditions FHT and \(\text{bi-FP}_3\) coincide
- FINITENESS CONDITIONS FOR REWRITING SYSTEMS
- The topology of discrete groups
- Graph groups are biautomatic
Cited In (9)
- Homological finiteness properties of monoids, their ideals and maximal subgroups.
- For groups the property of having finite derivation type is equivalent to the homological finiteness condition \(FP_ 3\)
- On some homotopical and homological properties of monoid presentations.
- A finiteness condition for rewriting systems
- Relative rewriting systems.
- Low dimensional homotopy for monoids II: groups
- Topological finiteness properties of monoids. I: Foundations
- ON HOMOTOPICAL AND HOMOLOGICAL FINITENESS CONDITIONS FOR FINITELY PRESENTED MONOIDS
- FOR REWRITING SYSTEMS THE TOPOLOGICAL FINITENESS CONDITIONS FDT AND FHT ARE NOT EQUIVALENT
This page was built for publication: On higher order homological finiteness of rewriting systems.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q557065)
