Algebra and geometry of rewriting

DOI10.1007/S10485-007-9083-6MaRDI QIDQ2463397zbMATH OpenOpenAlexFDO

Authors Yves Lafont

Publication date 6 December 2007

Published in Applied Categorical Structures (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10485-007-9083-6

zbMATH Keywords

HomologyResolutionTerminationHomotopyRewritingConfluenceGenerators and relationsPolygraph

Mathematics Subject Classification ID

Syzygies, resolutions, complexes in associative algebras (16E05) (Co)homology of rings and associative algebras (e.g., Hochschild, cyclic, dihedral, etc.) (16E40) Homological methods in group theory (20J05) Grammars and rewriting systems (68Q42) Finite generation, finite presentability, normal forms (diamond lemma, term-rewriting) (16S15) Free semigroups, generators and relations, word problems (20M05)

Recommendations

• scientific article; zbMATH DE number 1924513
• Convergent presentations and polygraphic resolutions of associative algebras
• Towards 3-dimensional rewriting theory
• Homological computations for term rewriting systems
• Shuffle polygraphic resolutions for operads

Cites work

• scientific article; zbMATH DE number 3935317 (Why is no real title available?)
• scientific article; zbMATH DE number 19499 (Why is no real title available?)
• scientific article; zbMATH DE number 1924513 (Why is no real title available?)
• scientific article; zbMATH DE number 3235051 (Why is no real title available?)
• A finite Thue system with decidable word problem and without equivalent finite canonical system
• A finiteness condition for rewriting systems
• A new finiteness condition for monoids presented by complete rewriting systems (after Craig C. Squier)
• Church-Rooser property and homology of monoids
• Complete rewriting systems and homology of monoid algebras
• Constructing finitely presented monoids which have no finite complete presentation
• Finite derivation type implies the homological finiteness condition \(FP_ 3\)
• 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
• Homology of Gaussian groups.
• Termination orders for three-dimensional rewriting
• The Knuth-Bendix Completion Procedure and Thue Systems
• The algebra of oriented simplexes
• Towards an algebraic theory of Boolean circuits.
• Word problems and a homological finiteness condition for monoids

Cited in

(15)

• A topological perspective on interacting algebraic theories
• A folk model structure on omega-cat
• Polygraphic resolutions and homology of monoids
• scientific article; zbMATH DE number 67429 (Why is no real title available?)
• Rewriting modulo isotopies in Khovanov-Lauda-Rouquier's categorification of quantum groups
• Rewriting with Frobenius
• Directed algebraic topology, categories and higher categories
• A combinatorial-topological shape category for polygraphs
• Computing critical pairs in 2-dimensional rewriting systems
• Geodesic rewriting systems and pregroups
• Polygraphs of finite derivation type
• scientific article; zbMATH DE number 431767 (Why is no real title available?)
• Termination orders for three-dimensional rewriting
• Homological computations for term rewriting systems
• scientific article; zbMATH DE number 1924513 (Why is no real title available?)

This page was built for publication: Algebra and geometry of rewriting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2463397)