Algebra and geometry of rewriting

DOI10.1007/s10485-007-9083-6zbMath1132.68036MaRDI QIDQ2463397

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

Termination; Resolution; Homology; Homotopy; Rewriting; Confluence; Generators and relations; Polygraph

Mathematics Subject Classification ID

16E40: (Co)homology of rings and associative algebras (e.g., Hochschild, cyclic, dihedral, etc.)

16S15: Finite generation, finite presentability, normal forms (diamond lemma, term-rewriting)

20M05: Free semigroups, generators and relations, word problems

20J05: Homological methods in group theory

68Q42: Grammars and rewriting systems

16E05: Syzygies, resolutions, complexes in associative algebras

Related Items

A Topological Perspective on Interacting Algebraic Theories, A folk model structure on omega-cat, Polygraphic resolutions and homology of monoids, A combinatorial-topological shape category for polygraphs, Rewriting modulo isotopies in Khovanov-Lauda-Rouquier's categorification of quantum groups, Directed algebraic topology, categories and higher categories, Polygraphs of finite derivation type

Cites Work

• 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
• A finite Thue system with decidable word problem and without equivalent finite canonical system
• Word problems and a homological finiteness condition for monoids
• The algebra of oriented simplexes
• 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
• Homology of Gaussian groups.
• Towards an algebraic theory of Boolean circuits.
• A new finiteness condition for monoids presented by complete rewriting systems (after Craig C. Squier)
• Termination orders for three-dimensional rewriting
• The Knuth-Bendix Completion Procedure and Thue Systems
• Church-Rooser property and homology of monoids