2022/01/01 by Davide Castelnovo, Castelnovo, Davide, Fabio Gadducci +3
Chemistry · Computer Science · #Category Theory (math.CT) #F.4.1 #FOS: Computer and information sciences #FOS: Mathematics #Logic (math.LO) #Logic in Computer Science (cs.LO) #Logic, programming, and type systems #Model-Driven Software Engineering Techniques #Synthetic Organic Chemistry Methods
paper · pdf · doi:10.48550/arxiv.2201.00233
openalex publication_date 2022/01/01 · openalex created_date 2022/05/05 · openalex updated_date 2026/07/28
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 M, 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.