Reduction operators and completion of linear rewriting systems
Filed under:
TALK
Cyrille Chenavier (Université Paris-Est Marne-la-Vallée, France), 27 February 2018, 10:15 a.m., S2 416-1
Reduction operators and completion of linear rewriting systems
In rewriting theory, the confluence property guarantees the coherence of calculi. In this talk, we study the confluence property for linear rewriting systems defined by reduction operators. We use this approach to provide a lattice description of obstructions to confluence. We deduce lattice formulations of the completion procedure as well as a method for extending linear rewriting systems so that they become confluent. We also exploit this approach to study problems of constructive nature in higher-dimensional algebra (homological algebra and operads theory).