Homotopy reduction systems for monoid presentations
DOI10.1016/S0022-4049(97)00095-9zbMath0932.20053OpenAlexW2006848143MaRDI QIDQ1295568
Publication date: 11 January 2000
Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0022-4049(97)00095-9
graphsmonoid presentationshomological finiteness conditionshomotopy reduction systemshomotopy theory for monoids
Geometric group theory (20F65) Free semigroups, generators and relations, word problems (20M05) Homotopy groups, general; sets of homotopy classes (55Q05) Homotopy theory (55P99) Connections of semigroups with homological algebra and category theory (20M50)
Related Items (5)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- For groups the property of having finite derivation type is equivalent to the homological finiteness condition \(FP_ 3\)
- Higher-dimensional word problems with applications to equational logic
- Complete rewriting systems and homology of monoid algebras
- Word problems and a homological finiteness condition for monoids
- On the geometry of semigroup presentations
- Transformations of words in a semigroup presented by a system of defining relations
- A finiteness condition for rewriting systems
- Finite derivation type implies the homological finiteness condition \(FP_ 3\)
- Constructing finitely presented monoids which have no finite complete presentation
- A new finiteness condition for monoids presented by complete rewriting systems (after Craig C. Squier)
- Über Identitäten zwischen Relationen
- RELATION MODULES AND RELATION BIMODULES OF GROUPS, SEMIGROUPS AND ASSOCIATIVE ALGEBRAS
- The Knuth-Bendix Completion Procedure and Thue Systems
- The word problem for one-relator semigroups
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- ON SEMIGROUPS WITH ONE RELATION AND SEMIGROUPS WITHOUT CYCLES
- LOW-DIMENSIONAL HOMOTOPY THEORY FOR MONOIDS
This page was built for publication: Homotopy reduction systems for monoid presentations