2026-07-22T21:25:26Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:9185 2024-03-06T10:43:34Z ddc:004 open_access

Coherence of Gray Categories via Rewriting Forest, Simon Mimram, Samuel rewriting coherence Gray category polygraph pseudomonoid precategory Over the recent years, the theory of rewriting has been extended in order to provide systematic techniques to show coherence results for strict higher categories. Here, we investigate a further generalization to low-dimensional weak categories, and consider in details the first non-trivial case: presentations of tricategories. By a general result, those are equivalent to the stricter Gray categories, for which we introduce a notion of rewriting system, as well as associated tools: critical pairs, termination orders, etc. We show that a finite rewriting system admits a finite number of critical pairs and, as a variant of Newman's lemma in our context, that a convergent rewriting system is coherent, meaning that two parallel 3-cells are necessarily equal. This is illustrated on rewriting systems corresponding to various well-known structures in the context of Gray categories (monoids, adjunctions, Frobenius monoids). Finally, we discuss generalizations in arbitrary dimension. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Simon Forest and Samuel Mimram 2018 Is Part Of LIPIcs, Volume 108, 3rd International Conference on Formal Structures for Computation and Deduction (FSCD 2018) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.FSCD.2018.15 urn:nbn:de:0030-drops-91855 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2018.15 eng https://creativecommons.org/licenses/by/3.0/legalcode