A new criterion for ℳ, 𝒩-adhesivity, with an application to hierarchical graphs

01/01/2022
by   Davide Castelnovo, et al.
0

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 ℳ, 𝒩-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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/04/2020

Abstract Mathematical morphology based on structuring element: Application to morpho-logic

A general definition of mathematical morphology has been defined within ...
research
01/30/2023

Fuzzy Presheaves are Quasitoposes

Quasitoposes encompass a wide range of structures, including various cat...
research
12/03/2020

An Algebraic Graph Transformation Approach for RDF and SPARQL

We consider the recommendations of the World Wide Web Consortium (W3C) a...
research
01/14/2022

The Sassenfeld criterion revisited

The starting point of this article is a decades-old yet little-noticed s...
research
07/22/2013

A generalized back-door criterion

We generalize Pearl's back-door criterion for directed acyclic graphs (D...
research
12/07/2020

Algebraic geometry of discrete interventional models

We investigate the algebra and geometry of general interventions in disc...
research
05/30/2023

Hierarchical string diagrams and applications

This is a tutorial text giving an advanced introduction to the diagramma...

Please sign up or login with your details

Forgot password? Click here to reset