走向三维重写理论
Towards 3-Dimensional Rewriting Theory
摘要:
弦重写系统被证明对研究幺半群非常有用。在好的情况下,它们给出了幺半群的有限表示,允许计算机对它们进行计算和操纵。更妙的是,当呈现是汇合的和终止的时,它们提供了一个呈现幺半群的元素的规范表示的概念。测谎仪是这种呈现概念的更高维度的推广,从monoid的设置到n-范畴的更一般的设置。本文的主要目的之一是逐步介绍由测谎仪提供的高维重写系统的概念,并描述其与经典重写理论,特别是字符串和项重写系统的联系。在介绍了一般的设置,我们将有兴趣证明当地的融合测谎仪呈现2类,并介绍了一个框架,其中有限的3维重写系统承认有限数量的关键对。
英文摘要:
String rewriting systems have proved very useful to study monoids. In good cases, they give finite presentations of monoids, allowing computations on those and their manipulation by a computer. Even better, when the presentation is confluent and terminating, they provide one with a notion of canonical representative of the elements of the presented monoid. Polygraphs are a higher-dimensional generalization of this notion of presentation, from the setting of monoids to the much more general setting of n-categories. One of the main purposes of this article is to give a progressive introduction to the notion of higher-dimensional rewriting system provided by polygraphs, and describe its links with classical rewriting theory, string and term rewriting systems in particular. After introducing the general setting, we will be interested in proving local confluence for polygraphs presenting 2-categories and introduce a framework in which a finite 3-dimensional rewriting system admits a finite number of critical pairs.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。