论文标题
$ \ Mathcal {M}，\ Mathcal {n} $ - 粘合度的新标准，并应用于层次图
A new criterion for $\mathcal{M}, \mathcal{N}$-adhesivity, with an application to hierarchical graphs
论文作者
论文摘要
粘合剂类别为重写理论的代数方法提供了一个抽象框架，可以重新铸造并统一证明许多一般结果。但是，检查模型是否满足粘合性属性有时远非立即。在本文中，我们提出了一个新标准，为$ \ mathcal {m}，\ Mathcal {n} $ - 粘合性提供足够的条件，对原始粘合性概念的概括。我们将其应用于几个现有类别，尤其是层次图，这种形式主义众所周知，很难适合代数方法的重写模式，并且各种替代定义浮动。
Adhesive categories provide an abstract framework for the algebraic approach to rewriting theory, where many general results can be recast and uniformly proved. However, checking that a model satisfies the adhesivity properties is sometimes far from immediate. In this paper we present a new criterion giving a sufficient condition for $\mathcal{M}, \mathcal{N}$-adhesivity, a generalisation of the original notion of adhesivity. We apply it to several existing categories, and in particular to hierarchical graphs, a formalism that is notoriously difficult to fit in the mould of algebraic approaches to rewriting and for which various alternative definitions float around.
