Towards M Adhesive Categories of Corecursive Graphs
In this contribution we investigate several extensions of the powerset that comprise arbitrarily nested subsets, and call them superpower set. This allows the definition of graphs with possibly infinitely nested nodes. additionally we define edges that are incident to edges. Since we use coalgebraic constructions we refer to these graphs as corecursive graphs. The superpower set functors are examined and then used for the definition of M adhesive categories which are the basic categories forM adhesive transformation systems. So, we additionally show that coalgebras SetsF are M adhesive categories provided the functor F Sets Sets preserves pullbacks along monomorphisms.
ArXiv