Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request

Algebraic critical pair lemma

Item request has been placed! ×
Item request cannot be made. ×
loading   Processing Request
  • Additional Information
    • Contributors:
      XLIM (XLIM); Université de Limoges (UNILIM)-Centre National de la Recherche Scientifique (CNRS); Institut Camille Jordan (ICJ); École Centrale de Lyon (ECL); Université de Lyon-Université de Lyon-Université Claude Bernard Lyon 1 (UCBL); Université de Lyon-Institut National des Sciences Appliquées de Lyon (INSA Lyon); Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université Jean Monnet - Saint-Étienne (UJM)-Centre National de la Recherche Scientifique (CNRS); Algèbre, géométrie, logique (AGL); Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université Jean Monnet - Saint-Étienne (UJM)-Centre National de la Recherche Scientifique (CNRS)-École Centrale de Lyon (ECL)
    • Publication Information:
      HAL CCSD
    • Publication Date:
      2020
    • Collection:
      Université Jean Monnet – Saint-Etienne: HAL
    • Subject Terms:
    • Abstract:
      International audience ; Convergent rewriting systems on algebraic structures give methods to prove coherence results and compute homological invariants of these structures. These methods are based on higher-dimensional extensions of the critical pair lemma that characterizes local confluence from confluence of critical pairs. The analysis of local confluence of rewriting systems on algebraic structures, such as groups or linear algebras, is complicated because of the underlying algebraic axioms, and local confluence properties require additional termination conditions. In this work, we define the structure of algebraic polygraph modulo that formalizes the interaction between the rules of the rewriting system and the inherent algebraic axioms, and we show a critical pair lemma algebraic polygraphs. We deduce from this result a critical pair lemma for rewriting systems on algebraic structures specified by rewriting systems convergent modulo AC. As an illustration, we explicit our constructions on linear rewriting systems.
    • Relation:
      hal-03348232; https://hal.science/hal-03348232; https://hal.science/hal-03348232/document; https://hal.science/hal-03348232/file/algebraicCriticalPairLemma.pdf
    • Online Access:
      https://hal.science/hal-03348232
      https://hal.science/hal-03348232/document
      https://hal.science/hal-03348232/file/algebraicCriticalPairLemma.pdf
    • Rights:
      info:eu-repo/semantics/OpenAccess
    • Accession Number:
      edsbas.FC6641C3