Transformation of Corecursive Graphs
|
|
- Kerrie Kennedy
- 5 years ago
- Views:
Transcription
1 Transformation of Corecursive Graphs Towards M-Adhesive Categories of Corecursive Graphs Julia Padberg Padberg Transformation of Corecursive Graphs
2 Motivation Table of Contents 1 Motivation 2 Node- and Edge Recursion 3 Coalgebras and M-adhesive Categories 4 Edge Corecursion 5 Corecursive Graphs 6 Related Work 7 Discussion Padberg Transformation of Corecursive Graphs
3 Motivation Motivation various graph types with nodes within nodes hierarchies mostly what about edges between edges? define recursion on a graph s structure so that we still obtain an M-adhesive transformation systems. Padberg Transformation of Corecursive Graphs
4 Motivation Example The corecursive graph G = (N, E, c, n) given by N = {n 1, n 2, n 3, n 4, n 5, n 6 } with n i ; 1 i 3 {n 1, n 2 } ; i = 4 c(n i ) = {n 3 } ; i = 5 {n 2, {n 1, n 2 }, n 5 } ; i = 6 Atomic nodes are called vertices V = {n 1, n 2, n 3 }. Padberg Transformation of Corecursive Graphs
5 Motivation Example The corecursive graph G = (N, E, c, n) given by N = {n 1, n 2, n 3, n 4, n 5, n 6 } Atomic nodes are called vertices V = {n 1, n 2, n 3 }. E = {a, b, c, d, e} with n1 : a {n 1, n 3 } b {n 2, b} c {n 4, a} d {b, c, n 5 } e {n 1, n 3 } Padberg Transformation of Corecursive Graphs
6 Motivation Example The corecursive graph G = (N, E, c, n) given by N = {n 1, n 2, n 3, n 4, n 5, n 6 } Atomic nodes are called vertices V = {n 1, n 2, n 3 }. E = {a, b, c, d, e} Edge d is an hyperedge. All other egdes are arcs, i.e.edges with one or two incident entities. Atomics arcs are A = {a, e}. The edges b and d are not node based, since n + (b) and n + (d) remain undefined. b is an unary arc, denoted by n 2 b. Padberg Transformation of Corecursive Graphs
7 Motivation Corecursive Graphs as A corecursive graph G = (N, E, c, n) with only atomic nodes and all edges are atomic arcs: an undirected multi-graph only atomic nodes and all edges are atomic: a classic hypergraph only atomic nodes and and all edges are layered and node-based: hierarchical graphs [Drewes u. a.(2002)] all nodes being layered and well-founded and and all edges are atomic: hierarchical graphs [Busatto u. a.(2005)] all nodes being hierarchical and well-founded: bigraphs [Milner(2006)] Padberg Transformation of Corecursive Graphs
8 Node- and Edge Recursion Table of Contents 1 Motivation 2 Node- and Edge Recursion 3 Coalgebras and M-adhesive Categories 4 Edge Corecursion 5 Corecursive Graphs 6 Related Work 7 Discussion Padberg Transformation of Corecursive Graphs
9 Node- and Edge Recursion Superpower For (finite) sets M the superpower set is achieved by recursively inserting subsets of the superpower set into the superpower set. There are two possibilities: 1 P only allows sets of nodes. 2 P ω layers the nesting of nodes. 3 P allows atomic nodes as well. Padberg Transformation of Corecursive Graphs
10 Node- and Edge Recursion Superpower For (finite) sets M the superpower set is achieved by recursively inserting subsets of the superpower set into the superpower set. There are two possibilities: 1 P only allows sets of nodes. 2 P ω layers the nesting of nodes. 3 P allows atomic nodes as well. we use the last one... Padberg Transformation of Corecursive Graphs
11 Node- and Edge Recursion Superpower Definition (Superpower set P) Given a finite set M and P(M) the power set of M then we define the superpower set P(M) 1 M P(M) and P(M) P(M) 2 If M P(M) then M P(M). P(M) is the smallest set satisfying 1. and 2. The use of the strict subset ensures that Russell s antinomy cannot occur. Padberg Transformation of Corecursive Graphs
12 Example Node- and Edge Recursion Let M = {1, 2, 3}. Then Padberg Transformation of Corecursive Graphs
13 Example Node- and Edge Recursion Let M = {1, 2, 3}. Then 1 M P(M) and P(M) P(M) P(M) = {1, 2, 3,, {1},..., {1, 2, 3}, {1, {1, 2}}, {{1}}, {, { }}, P(M),..., {1, {1}, {{1}}},..., P 3 (M),...} Padberg Transformation of Corecursive Graphs
14 Example Node- and Edge Recursion Let M = {1, 2, 3}. Then 2 If M P(M) then M P(M). P(M) = {1, 2, 3,, {1},..., {1, 2, 3}, {1, {1, 2}}, {{1}}, {, { }}, P(M),..., {1, {1}, {{1}}},..., P 3 (M),...} Padberg Transformation of Corecursive Graphs
15 Example Node- and Edge Recursion Let M = {1, 2, 3}. Then 2 If M P(M) then M P(M). P(M) = {1, 2, 3,, {1},..., {1, 2, 3}, {1, {1, 2}}, {{1}}, {, { }}, P(M),..., {1, {1}, {{1}}},..., P 3 (M),...} Padberg Transformation of Corecursive Graphs
16 Example Node- and Edge Recursion Let M = {1, 2, 3}. Then 2 If M P(M) then M P(M). P(M) = {1, 2, 3,, {1},..., {1, 2, 3}, {1, {1, 2}}, {{1}}, {, { }}, P(M),..., {1, {1}, {{1}}},..., P 3 (M),...} Padberg Transformation of Corecursive Graphs
17 Example Node- and Edge Recursion Let M = {1, 2, 3}. Then P(M) = {1, 2, 3,, {1},..., {1, 2, 3}, {1, {1, 2}}, {{1}}, {, { }}, P(M),..., {1, {1}, {{1}}},..., P 3 (M),...} P(M) can be inductively enumerated by the depth of the nested parentheses provided M is finite. Padberg Transformation of Corecursive Graphs
18 Node- and Edge Recursion Superpower Set P Lemma (P is a functor) P : finsets finsets is defined for finite sets as above and for functions { f : M N by P(f) : P(M) P(N) with f (x) ; x M P(f)(x) = {P(f)(x ) x x} ; else Lemma (P preserves injections) Given injective function f : M N then P(f) : P(M) P(N) is injective. Padberg Transformation of Corecursive Graphs
19 Node- and Edge Recursion Proof Sketch Induction over the number of nested parentheses: P(f) is injective on the elements of M since f is injective. Padberg Transformation of Corecursive Graphs
20 Node- and Edge Recursion Proof Sketch Induction over the number of nested parentheses: P(f) is injective on the elements of M since f is injective. Let P(f) be injective on the sets of P(M) with at most n nested parentheses. Given M 1, M 2 P(M) with n + 1 nested parentheses and M 1 M 2. Let x M 1 x / M 2. Hence P(f)(x) P(f)(M 1 ). x / M 2 implies for all m M 2 that x m. x and m have at most n nested parentheses. P(f)(x) P(f)(m) for all m M 2 as P(f) is injective for all sets with at most n nested parentheses. Thus P(f)(x) / P(f)(M 2 ). So, P(M 1 ) P(M 2 ). Padberg Transformation of Corecursive Graphs
21 Node- and Edge Recursion Proof Sketch Induction over the number of nested parentheses: P(f) is injective on the elements of M since f is injective. Let P(f) be injective on the sets of P(M) with at most n nested parentheses. Given M 1, M 2 P(M) with n + 1 nested parentheses and M 1 M 2. Let x M 1 x / M 2. Hence P(f)(x) P(f)(M 1 ). x / M 2 implies for all m M 2 that x m. x and m have at most n nested parentheses. P(f)(x) P(f)(m) for all m M 2 as P(f) is injective for all sets with at most n nested parentheses. Thus P(f)(x) / P(f)(M 2 ). So, P(M 1 ) P(M 2 ). Padberg Transformation of Corecursive Graphs
22 Node- and Edge Recursion Lemma (P preserves pullbacks along injective morphisms) A π B B P π C C (PB) g 1 f 1 D h h π P(C) π P(B) (2) P(A) (3) P(π B ) P(B) P(f π C ) (1) P(f 1 ) h : P P(A) with P(C) P(g 1 ) P(D) (b, c) ; if X = b B, Y = c C h((x, Y )) = {(x, y) x X B, y Y C, f 1 (x) = g 1 (y)} h(x (X,Y ) (X B) (Y C), Y ) ; else Padberg Transformation of Corecursive Graphs
23 Node- and Edge Recursion Corecursive F -Graph [Schneider(1999), Jäkel(2015b)] Definition (Category of corecursive graphs crfgraph) is given by a comma category crfgraph =< Id finsets P >. G-objects: E P(N) G-morphisms f = (f N, f E ) : G 1 G 2 with: P(f N ) c 1 = c 2 f N P(f E ) n 1 = n 2 f E Padberg Transformation of Corecursive Graphs
24 Coalgebras and M-adhesive Categories Table of Contents 1 Motivation 2 Node- and Edge Recursion 3 Coalgebras and M-adhesive Categories 4 Edge Corecursion 5 Corecursive Graphs 6 Related Work 7 Discussion Padberg Transformation of Corecursive Graphs
25 Coalgebras and M-adhesive Categories Wanted: nice categorical construct for c : N P(N) and n : E P(N E) with morphisms f : G 1 G 2 based on mappings of nodes and mappings of edges, so that c 1 n N 1 1 P(N 1 ) E 1 P(N 1 E 1 ) f N P(f N ) c 2 N 2 P(N 2 ) both diagrams commute f E P(f E ) n 2 E 2 P(N 2 E 2 ) Padberg Transformation of Corecursive Graphs
26 Coalgebras and M-adhesive Categories Wanted: nice categorical construct for c : N P(N) and n : E P(N E) with morphisms f : G 1 G 2 based on mappings of nodes and mappings of edges, so that c 1 n N 1 1 P(N 1 ) E 1 P(N 1 E 1 ) f N P(f N ) c 2 N 2 P(N 2 ) Coalgebra (see [Rutten(2000)] ) both diagrams commute f E P(f E ) n 2 E 2 P(N 2 E 2 ) A endofunctor F : Sets Sets gives rise the category of coalgebras Sets F with M α M F (M) also denoted by (M, α M ) being the objects and morphisms f : (M, α M ) (N, α N ) called F -homomorphism so that (1) commutes in Sets. M f N α M (1) F (M) F (f ) α N F (N) Padberg Transformation of Corecursive Graphs
27 Coalgebras and M-adhesive Categories Examples of Coalgebras Let F : Sets Sets an F -coalgebra is a pair (S, α S : S F (S) [Rutten(2000), Adamek(2005), Jacobs(2016)]: finitely branching nondeteministic transition system with Sets Pfin, where (Q, α Q : Q P fin (Q): assigns each state q a finite collection of successor states. infinite binary trees over an alphabet A with F (S) = A S S: given a state x S, a one-step computation yields a triple (a 0, x 1, x 2 ) of an element a 0 A and two successor states x 1, x 2 S. Continuing the computation with both x 1 and x 2 yields two more elements in A, and four successor states, etc. This yields for each x S an infinite binary tree with one label from A at each node. Labelled transition systems over a signature Σ with Sets P(Σ ). Padberg Transformation of Corecursive Graphs
28 Coalgebras and M-adhesive Categories Properties of Sets F Proposition [Jacobs(2016)] Assume a functor F : C C that preserves (ordinary) pullbacks. If the category C has pullbacks, then so has the category of coalgebras Coalg F. Lemma (Pullbacks along injections in Sets F ) Given a functor F : Sets Sets that preserves pullbacks along an injective morphism, then Sets F has pullbacks along an injective F-homomorphism. Padberg Transformation of Corecursive Graphs
29 Coalgebras and M-adhesive Categories Transformation System for Coalgebras According to Prop. 4.7 in [Rutten(2000)] if f : M N is injective in Sets then f is an F -monomorphism in Sets F. Obviously the class of all injective functions M F = {(A, α A ) f (B, α B ) f is injective in Sets } is PO-PB-compatible. Theorem ((Sets F, M F ) is an M-Adhesive Category) If F preserves pullbacks along injective morphisms, then (Sets F, M F ) is an M-adhesive category. Padberg Transformation of Corecursive Graphs
30 Proof Idea Coalgebras and M-adhesive Categories 1 M-POs exist as Sets F is finitely cocomplete (Thm 4.2 [Rutten(2000)]) for arbitrary F : Sets Sets. 2 and are vertical weak VK squares (A, α A ) m M (B, α B ) f (1) (C, α C ) n (D, α D ) g (A, α A) (2) f m (C, α a C ) (B, α B) c (C, α C ) n f n (D, α D) d (A, α A ) g g m b (B, α B ) (D, α D ) Since (finite) colimits and pullbacks along M-morphisms are constructed on the underlying set, square (1) and the VK-cube are given for the underlying sets in Sets as well. Padberg Transformation of Corecursive Graphs
31 Coalgebras and M-adhesive Categories M-Transformation Systems for F -Coalgebras M-transformation systems for finitely branching non-deterministic transition systems Sets Pfin, where (Q, α Q : Q P fin (Q) as finite power set functor P fin preserves pullbacks along injective morphisms M-transformation systems for infinite binary trees Sets A alphabet A with since the product functoer preserves limits M-transformation systems for labelled transition systems over a signature Σ with Sets P(Σ ), since the composition preserves pullback-preservation. over an Padberg Transformation of Corecursive Graphs
32 Coalgebras and M-adhesive Categories M-Transformation Systems for F -Coalgebras M-transformation systems for finitely branching non-deterministic transition systems Sets Pfin, where (Q, α Q : Q P fin (Q) as finite power set functor P fin preserves pullbacks along injective morphisms M-transformation systems for infinite binary trees Sets A alphabet A with since the product functoer preserves limits M-transformation systems for labelled transition systems over a signature Σ with Sets P(Σ ), since the composition preserves pullback-preservation. over an Padberg Transformation of Corecursive Graphs
33 Edge Corecursion Table of Contents 1 Motivation 2 Node- and Edge Recursion 3 Coalgebras and M-adhesive Categories 4 Edge Corecursion 5 Corecursive Graphs 6 Related Work 7 Discussion Padberg Transformation of Corecursive Graphs
34 Edge Corecursion Corecursive Hyperedges graphs with undirected edges as many sorted coalgebras using the functor F : Sets Sets Sets Sets with F (V, E) = (V, E) (!,<s,t>) (1, V V ) where 1 is the final object and! the corresponding final morphism.[rutten(2000)] Definition (Corecursive Hyperedges) Given a set of vertices V and a set of edge names E and a function yielding the neighbouring entities n : E P(V E). Then the category of coalgebras Coalg F1 over F 1 : Sets Sets Sets Sets with F 1 (V, E) = (1, P(V E) yields the category of graphs with corecursive hyperedges. The class M is given by the class of pairs of injective morphisms < f V, f E >. Lemma ((Coalg F1, M) is an M-Adhesive Category) Padberg Transformation of Corecursive Graphs
35 Edge Corecursion Corecursive Hyperedges graphs with undirected edges as many sorted coalgebras using the functor F : Sets Sets Sets Sets with F (V, E) = (V, E) (!,<s,t>) (1, V V ) where 1 is the final object and! the corresponding final morphism.[rutten(2000)] Definition (Corecursive Hyperedges) Given a set of vertices V and a set of edge names E and a function yielding the neighbouring entities n : E P(V E). Then the category of coalgebras Coalg F1 over F 1 : Sets Sets Sets Sets with F 1 (V, E) = (1, P(V E) yields the category of graphs with corecursive hyperedges. The class M is given by the class of pairs of injective morphisms < f V, f E >. Lemma ((Coalg F1, M) is an M-Adhesive Category) Padberg Transformation of Corecursive Graphs
36 Edge Corecursion Corecursive Hyperedges graphs with undirected edges as many sorted coalgebras using the functor F : Sets Sets Sets Sets with F (V, E) = (V, E) (!,<s,t>) (1, V V ) where 1 is the final object and! the corresponding final morphism.[rutten(2000)] Definition (Corecursive Hyperedges) Given a set of vertices V and a set of edge names E and a function yielding the neighbouring entities n : E P(V E). Then the category of coalgebras Coalg F1 over F 1 : Sets Sets Sets Sets with F 1 (V, E) = (1, P(V E) yields the category of graphs with corecursive hyperedges. The class M is given by the class of pairs of injective morphisms < f V, f E >. Lemma ((Coalg F1, M) is an M-Adhesive Category) Padberg Transformation of Corecursive Graphs
37 Edge Corecursion More Corecursive Edges This can be extended to various types of corecursive edges: corecursive undirected edges: vertices V, edges E and a function n : E P (1,2) (V E) Coalg F2 over F 2 : Sets Sets Sets Sets with F 2 (V, E) = (1, P (1,2) (V E) together with class M is an M-adhesive category. corecursive directed edges: vertices V, edges E and a function n : E (V E) (V E) Coalg F3 over F 3 : Sets Sets Sets Sets with F 3 (V, E) = (1, (V E) (V E) together with class M is an M-adhesive category. Padberg Transformation of Corecursive Graphs
38 Edge Corecursion More Corecursive Edges This can be extended to various types of corecursive edges: corecursive undirected edges: vertices V, edges E and a function n : E P (1,2) (V E) Coalg F2 over F 2 : Sets Sets Sets Sets with F 2 (V, E) = (1, P (1,2) (V E) together with class M is an M-adhesive category. corecursive directed edges: vertices V, edges E and a function n : E (V E) (V E) Coalg F3 over F 3 : Sets Sets Sets Sets with F 3 (V, E) = (1, (V E) (V E) together with class M is an M-adhesive category. Padberg Transformation of Corecursive Graphs
39 Edge Corecursion More Corecursive Edges This can be extended to various types of corecursive edges: corecursive undirected edges: vertices V, edges E and a function n : E P (1,2) (V E) Coalg F2 over F 2 : Sets Sets Sets Sets with F 2 (V, E) = (1, P (1,2) (V E) together with class M is an M-adhesive category. corecursive directed edges: vertices V, edges E and a function n : E (V E) (V E) Coalg F3 over F 3 : Sets Sets Sets Sets with F 3 (V, E) = (1, (V E) (V E) together with class M is an M-adhesive category. Padberg Transformation of Corecursive Graphs
40 Edge Corecursion More Corecursive Edges This can be extended to various types of corecursive edges: corecursive undirected edges: vertices V, edges E and a function n : E P (1,2) (V E) Coalg F2 over F 2 : Sets Sets Sets Sets with F 2 (V, E) = (1, P (1,2) (V E) together with class M is an M-adhesive category. corecursive directed edges: vertices V, edges E and a function n : E (V E) (V E) Coalg F3 over F 3 : Sets Sets Sets Sets with F 3 (V, E) = (1, (V E) (V E) together with class M is an M-adhesive category. Padberg Transformation of Corecursive Graphs
41 Edge Corecursion More Corecursive Edges This can be extended to various types of corecursive edges: corecursive undirected edges: vertices V, edges E and a function n : E P (1,2) (V E) Coalg F2 over F 2 : Sets Sets Sets Sets with F 2 (V, E) = (1, P (1,2) (V E) together with class M is an M-adhesive category. corecursive directed edges: vertices V, edges E and a function n : E (V E) (V E) Coalg F3 over F 3 : Sets Sets Sets Sets with F 3 (V, E) = (1, (V E) (V E) together with class M is an M-adhesive category. Padberg Transformation of Corecursive Graphs
42 Edge Corecursion More Corecursive Edges This can be extended to various types of corecursive edges: corecursive undirected edges: vertices V, edges E and a function n : E P (1,2) (V E) Coalg F2 over F 2 : Sets Sets Sets Sets with F 2 (V, E) = (1, P (1,2) (V E) together with class M is an M-adhesive category. corecursive directed edges: vertices V, edges E and a function n : E (V E) (V E) Coalg F3 over F 3 : Sets Sets Sets Sets with F 3 (V, E) = (1, (V E) (V E) together with class M is an M-adhesive category. Padberg Transformation of Corecursive Graphs
43 Edge Corecursion More Corecursive Edges This can be extended to various types of corecursive edges: corecursive undirected edges: vertices V, edges E and a function n : E P (1,2) (V E) Coalg F2 over F 2 : Sets Sets Sets Sets with F 2 (V, E) = (1, P (1,2) (V E) together with class M is an M-adhesive category. corecursive directed edges: vertices V, edges E and a function n : E (V E) (V E) Coalg F3 over F 3 : Sets Sets Sets Sets with F 3 (V, E) = (1, (V E) (V E) together with class M is an M-adhesive category. Padberg Transformation of Corecursive Graphs
44 Edge Corecursion More Corecursive Edges This can be extended to various types of corecursive edges: corecursive undirected edges: vertices V, edges E and a function n : E P (1,2) (V E) Coalg F2 over F 2 : Sets Sets Sets Sets with F 2 (V, E) = (1, P (1,2) (V E) together with class M is an M-adhesive category. corecursive directed edges: vertices V, edges E and a function n : E (V E) (V E) Coalg F3 over F 3 : Sets Sets Sets Sets with F 3 (V, E) = (1, (V E) (V E) together with class M is an M-adhesive category. Padberg Transformation of Corecursive Graphs
45 Corecursive Graphs Table of Contents 1 Motivation 2 Node- and Edge Recursion 3 Coalgebras and M-adhesive Categories 4 Edge Corecursion 5 Corecursive Graphs 6 Related Work 7 Discussion Padberg Transformation of Corecursive Graphs
46 Corecursive Graphs Corecursive Graphs Definition (Corecursive graphs) G = (N, E, c : N P(V ), n : E P(P(N) E)) can be considered to be an coalgebra over F : Sets Sets Sets Sets with F(N, E) = (P(N), P(P(N) E)). Lemma ((Coalg F, M) is an M-Adhesive Category) F preserves pullbacks along monomorphisms. Padberg Transformation of Corecursive Graphs
47 Overview Corecursive Graphs definition nodes edges n : E P(N) n : E P(N) c : N P(N) n : E P(N) c : N P(N) n : E P(N) (1,2) c : N P(N) s, t : E N containers have no names atomic nodes may exist containers have no names every node is a container containers have a name atomic nodes may exist containers have a name atomic nodes may exist containers have a name atomic nodes may exist c : N P(N) containers have a name s, t : E (N) atomic nodes may exist hyperedges without order hyperedges without order hyperedges without order undirected edges directed edges directed hyperedges with an order Padberg Transformation of Corecursive Graphs
48 Overview Corecursive Graphs definition nodes edges! : V 1 n : E P(V E)! : V 1 n : E P (1,2) (V E)! : V 1 n : E (V E) (V E) c : N P(N) n : E P(N E) only vertices only vertices only vertices containers have a name atomic nodes may exist corecursive hyperedges corecursive undirected edges corecursive directed edges corecursive hyperedges without order Padberg Transformation of Corecursive Graphs
49 Corecursive Graphs Properties of Corecursive Nodes 1 Nodes are unique if c is injective. 2 Vertices are the atomic nodes that refer to themselves: V = {n c(n) = n} 3 Nodes are containers if c(n) P(N) N 4 The set of nodes is well-founded if and only if X N Y c(x ) implies, that Y c(n) X c(n) Y (X N) implies, that Y c(n) 5 The set of nodes is hierarchical if and only if c(n) c(n ) implies n = n Padberg Transformation of Corecursive Graphs
50 Corecursive Graphs Properties of Corecursive Hyperedges 1 The set of atomic hyperedges E := {e E n(e) P(N)}. 2 Edges are noded based if the function n + : E P(N) defined by n + (e) = {n N n n(e)} x n(e) n+ (x) is well-defined. 3 Edges are atomic if they are noded-based and if the function n + (E) V only yields vertices. Analogously the properties for (un-)directed edges. Padberg Transformation of Corecursive Graphs
51 Related Work Table of Contents 1 Motivation 2 Node- and Edge Recursion 3 Coalgebras and M-adhesive Categories 4 Edge Corecursion 5 Corecursive Graphs 6 Related Work 7 Discussion Padberg Transformation of Corecursive Graphs
52 Related Work Related Work recursive graphs A recursive graph G = (V, E) is recursive, if V, the set of vertices is a recursive subset of the natural numbers N and E, the set of edges is a recursive subset of N (2), the set of unordered pairs from N [Bean(1976), Remmel(1986)]. bigraphs hierarchical graphs abstraction for graphs Padberg Transformation of Corecursive Graphs
53 Related Work Bigraph: Application Example from [Milner(2006)] Padberg Transformation of Corecursive Graphs
54 Related Work Bigraph: Abstract Example from [Milner(2006)] Padberg Transformation of Corecursive Graphs
55 Related Work Bigraph as a Corecursive Graph hierarchical nodes c : N P(N), N = {0, 1, v 0, v 1, v 2, v 3, 0, 1, 2} directed nested hyperedges s, t : E P(N E), E = {e 1, e 2, e 3, e 4, e 5 } c : 0 {v 0, v 2 } 1 {v 3, 1} v 0 {v 1 } v 1 {0} v 2 v 2 v 3 {2} i i;for 0 i 2 s : e 1 {v 1, v 2, v 3 } y 0 {v 2 } y 1 {v 2, v 3 } x 0 {x 0 } x 1 {x 1 } t : e 1 {v 1, v 2, v 3 } y 0 {v 2 } y 1 {v 2, v 3 } x 0 {x 0 } x 1 {x 1 } Padberg Transformation of Corecursive Graphs
56 Related Work Hierarchical Hypergraphs [Drewes u. a.(2002)] Hypergraphs with order, so att : E V Hierarchy in layers, edges within one layer < G, F, cts : F H > H with special edges F that contain subgraphs c =!, n : E N P ω (N) so that edges are node-based n : a < xyz, > b < nm, > c < v2v4, > e 1 < v1v2v3, {x, y, z} > e 2 < v4, {n, m} > Padberg Transformation of Corecursive Graphs
57 Related Work Hierarchical Graphs [Busatto u. a.(2005)] graphs are grouped into packages via a coupling graph c : N P ω (N) being N = {n, well-founded m, x, y, z, p1, p2, p3} packages are the nodes that v ; if v {n, m, x, y, z} are not atomic {x, y, z} ; if v = p1 c(v) = n : E F (N) where F {n, m} ; if v = p2 determines the type of the {p1, p2} ; if v = p3 underlying graphs completeness condition: n N : c(n) = n p N : n c(p) Padberg Transformation of Corecursive Graphs
58 Discussion Table of Contents 1 Motivation 2 Node- and Edge Recursion 3 Coalgebras and M-adhesive Categories 4 Edge Corecursion 5 Corecursive Graphs 6 Related Work 7 Discussion Padberg Transformation of Corecursive Graphs
59 Discussion Open Questions transformation of coalgebras?? nomenclature?? recursive vs corecursive atomic nodes vs. vertices edges vs. arcs/ atomic hyperedge edge atomic edge = arc?? abstraction for graphs F -Graphs M-adhesive transformation systems?? P preserving PBs along injections for arbitrary sets Padberg Transformation of Corecursive Graphs
60 Discussion Padberg Transformation of Corecursive Graphs
61 Discussion Adamek, Jiri: Introduction to coalgebra. In: Theory and Applications of Categories 14 (2005), Bean, Dwight R.: Effective coloration. In: Journal of Symbolic Logic 41 (1976), Nr. 2, S Busatto, Giorgio ; Kreowski, Hans-Jörg ; Kuske, Sabine: Abstract hierarchical graph transformation. In: Mathematical Structures in Computer Science 15 (2005), Nr. 4, Drewes, Frank ; Hoffmann, Berthold ; Plump, Detlef: Hierarchical Graph Transformation. In: J. Comput. Syst. Sci. 64 (2002), Nr. 2, DOI /jcss ISSN Ehrig, H. ; Ehrig, K. ; Prange, U. ; Taentzer, G.: Fundamentals of Algebraic Graph Transformation. Springer, 2006 (EATCS Monographs in TCS) Jacobs, Bart: Introduction to Coalgebra: Towards Mathematics of States and Observation. Bd. 59. Cambridge University Press, 2016 Padberg Transformation of Corecursive Graphs
62 Discussion Jäkel, C.: A coalgebraic model of graphs Jäkel, C.: A unified categorical approach to graphs Milner, Robin: Pure bigraphs: Structure and dynamics. In: Inf. Comput. 204 (2006), Nr. 1, Remmel, J.B.: Graph colorings and recursively bounded 0 1 -classes. In: Annals of Pure and Applied Logic 32 (1986), S Rutten, J.J.M.M.: Universal coalgebra: a theory of systems. In: Theoretical Computer Science 249 (2000), Nr. 1, Schneider, H. J.: Describing systems of processes by means of high-level replacement. In: Handbook of Graph Grammars and Computing by Graph Transformation, Volume 3. World Scientific, 1999, S in Computer Science), Padberg Transformation of Corecursive Graphs
Parallel Independence in Hierarchical Graph Transformation
Parallel Independence in Hierarchical Graph Transformation Annegret Habel 1 and Berthold Hoffmann 2 1 Carl-v.-Ossietzky-Universität Oldenburg, Germany habel@informatik.uni-oldenburg.de 2 Universitität
More informationAttribution of Graphs by Composition of M, N -adhesive Categories
Attribution of Graphs by Composition of M, N -adhesive Categories Christoph Peuser and Annegret Habel Carl von Ossietzky Universität Oldenburg {peuser,habel}@informatik.uni-oldenburg.de Abstract. This
More informationUniversity of Oxford, Michaelis November 16, Categorical Semantics and Topos Theory Homotopy type theor
Categorical Semantics and Topos Theory Homotopy type theory Seminar University of Oxford, Michaelis 2011 November 16, 2011 References Johnstone, P.T.: Sketches of an Elephant. A Topos-Theory Compendium.
More informationFundamental Theory for Typed Attributed Graph Transformation
Fundamental Theory for Typed Attributed Graph Transformation Hartmut Ehrig, Ulrike Prange, and Gabriele Taentzer Technical University of Berlin, Germany ehrig ullip gabi@cs.tu-berlin.de Abstract. The concept
More information6 Coalgebraic modalities via predicate liftings
6 Coalgebraic modalities via predicate liftings In this chapter we take an approach to coalgebraic modal logic where the modalities are in 1-1 correspondence with so-called predicate liftings for the functor
More informationWhat are Iteration Theories?
What are Iteration Theories? Jiří Adámek and Stefan Milius Institute of Theoretical Computer Science Technical University of Braunschweig Germany adamek,milius @iti.cs.tu-bs.de Jiří Velebil Department
More informationPDF hosted at the Radboud Repository of the Radboud University Nijmegen
PDF hosted at the Radboud Repository of the Radboud University Nijmegen The following full text is a preprint version which may differ from the publisher's version. For additional information about this
More informationProceedings of the 12th International Workshop on Graph Transformation and Visual Modeling Techniques (GTVMT 2013)
Electronic Communications of the EASST Volume 58 (2013) Proceedings of the 12th International Workshop on raph Transformation and Visual Modeling Techniques (TVMT 2013) Analysis of Hypergraph Transformation
More informationRealization of Coinductive Types
MFPS 2011 Realization of Coinductive Types Dexter Kozen 1,2 Department of Computer Science Cornell University Ithaca, New York 14853 7501, USA Abstract We give an explicit combinatorial construction of
More informationStreams and Coalgebra Lecture 2
Streams and Coalgebra Lecture 2 Helle Hvid Hansen and Jan Rutten Radboud University Nijmegen & CWI Amsterdam Representing Streams II, Lorentz Center, Leiden, January 2014 Tutorial Overview Lecture 1 (Hansen):
More informationConceptual Connections of Circularity and Category Theory
1/64 Conceptual Connections of Circularity and Category Theory Larry Moss Indiana University, Bloomington ESSLLI 2012, Opole 2/64 The conceptual comparison chart Filling out the details is my goal for
More informationAlgebras. Larry Moss Indiana University, Bloomington. TACL 13 Summer School, Vanderbilt University
1/39 Algebras Larry Moss Indiana University, Bloomington TACL 13 Summer School, Vanderbilt University 2/39 Binary trees Let T be the set which starts out as,,,, 2/39 Let T be the set which starts out as,,,,
More informationWhat are Iteration Theories?
What are Iteration Theories? Jiří Adámek 1, Stefan Milius 1 and Jiří Velebil 2 1 Institute of Theoretical Computer Science, TU Braunschweig, Germany {adamek,milius}@iti.cs.tu-bs.de 2 Department of Mathematics,
More informationESSLLI 2010 CHP INTRODUCTION TO CATEGORY THEORY, ALGEBRAS AND COALGEBRA. Stefan Milius
ESSLLI 2010 CHP INTRODUCTION TO CATEGORY THEORY, ALGEBRAS AND COALGEBRA Jiří Adámek Stefan Milius This is the course material for our one week course at ESSLLI 2010. The course consists of two parts. The
More informationPART I. Abstract algebraic categories
PART I Abstract algebraic categories It should be observed first that the whole concept of category is essentially an auxiliary one; our basic concepts are those of a functor and a natural transformation.
More informationAbstracting away from cell complexes
Abstracting away from cell complexes Michael Shulman 1 Peter LeFanu Lumsdaine 2 1 University of San Diego 2 Stockholm University March 12, 2016 Replacing big messy cell complexes with smaller and simpler
More informationCategory Theory (UMV/TK/07)
P. J. Šafárik University, Faculty of Science, Košice Project 2005/NP1-051 11230100466 Basic information Extent: 2 hrs lecture/1 hrs seminar per week. Assessment: Written tests during the semester, written
More informationWELL-POINTED COALGEBRAS
Logical Methods in Computer Science Vol. 9(3:2)2013, pp. 1 51 www.lmcs-online.org Submitted Jul. 31, 2012 Published Aug. 9, 2013 WELL-POINTED COALGEBRAS JIŘÍ ADÁMEKa, STEFAN MILIUS b, LAWRENCE S. MOSS
More informationDescriptional Complexity of Formal Systems (Draft) Deadline for submissions: April 20, 2009 Final versions: June 18, 2009
DCFS 2009 Descriptional Complexity of Formal Systems (Draft) Deadline for submissions: April 20, 2009 Final versions: June 18, 2009 On the Number of Membranes in Unary P Systems Rudolf Freund (A,B) Andreas
More informationTopos Theory. Lectures 21 and 22: Classifying toposes. Olivia Caramello. Topos Theory. Olivia Caramello. The notion of classifying topos
Lectures 21 and 22: toposes of 2 / 30 Toposes as mathematical universes of Recall that every Grothendieck topos E is an elementary topos. Thus, given the fact that arbitrary colimits exist in E, we can
More informationDual Adjunctions Between Algebras and Coalgebras
Dual Adjunctions Between Algebras and Coalgebras Hans E. Porst Department of Mathematics University of Bremen, 28359 Bremen, Germany porst@math.uni-bremen.de Abstract It is shown that the dual algebra
More informationACLT: Algebra, Categories, Logic in Topology - Grothendieck's generalized topological spaces (toposes)
ACLT: Algebra, Categories, Logic in Topology - Grothendieck's generalized topological spaces (toposes) Steve Vickers CS Theory Group Birmingham 2. Theories and models Categorical approach to many-sorted
More informationReverse mathematics of some topics from algorithmic graph theory
F U N D A M E N T A MATHEMATICAE 157 (1998) Reverse mathematics of some topics from algorithmic graph theory by Peter G. C l o t e (Chestnut Hill, Mass.) and Jeffry L. H i r s t (Boone, N.C.) Abstract.
More informationTakeuchi s Free Hopf Algebra Construction Revisited
Takeuchi s Free Hopf Algebra Construction Revisited Hans E. Porst Department of Mathematics, University of Bremen, 28359 Bremen, Germany Abstract Takeuchi s famous free Hopf algebra construction is analyzed
More informationPart II. Logic and Set Theory. Year
Part II Year 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2018 60 Paper 4, Section II 16G State and prove the ǫ-recursion Theorem. [You may assume the Principle of ǫ- Induction.]
More informationSimulations in Coalgebra
Simulations in Coalgebra Jesse Hughes Dept. Philosophy, Technical Univ. Eindhoven, P.O. Box 513, 5600 MB Eindhoven, The Netherlands. J.Hughes@tm.tue.nl Bart Jacobs Dept. Computer Science, Univ. Nijmegen,
More informationAn adjoint construction for topological models of intuitionistic modal logic Extended abstract
An adjoint construction for topological models of intuitionistic modal logic Extended abstract M.J. Collinson, B.P. Hilken, D.E. Rydeheard April 2003 The purpose of this paper is to investigate topological
More informationSymbol Index Group GermAnal Ring AbMonoid
Symbol Index 409 Symbol Index Symbols of standard and uncontroversial usage are generally not included here. As in the word index, boldface page-numbers indicate pages where definitions are given. If a
More informationTopos Theory. Lectures 17-20: The interpretation of logic in categories. Olivia Caramello. Topos Theory. Olivia Caramello.
logic s Lectures 17-20: logic in 2 / 40 logic s Interpreting first-order logic in In Logic, first-order s are a wide class of formal s used for talking about structures of any kind (where the restriction
More informationLax Extensions of Coalgebra Functors and Their Logic
Lax Extensions of Coalgebra Functors and Their Logic Johannes Marti, Yde Venema ILLC, University of Amsterdam Abstract We discuss the use of relation lifting in the theory of set-based coalgebra and coalgebraic
More informationA few bridges between operational and denotational semantics of programming languages
A few bridges between operational and denotational semantics of programming languages Soutenance d habilitation à diriger les recherches Tom Hirschowitz November 17, 2017 Hirschowitz Bridges between operational
More informationIntroduction to Restriction Categories
Introduction to Restriction Categories Robin Cockett Department of Computer Science University of Calgary Alberta, Canada robin@cpsc.ucalgary.ca Estonia, March 2010 Defining restriction categories Examples
More informationInformation Theory and Statistics Lecture 2: Source coding
Information Theory and Statistics Lecture 2: Source coding Łukasz Dębowski ldebowsk@ipipan.waw.pl Ph. D. Programme 2013/2014 Injections and codes Definition (injection) Function f is called an injection
More informationAlgebraic Geometry
MIT OpenCourseWare http://ocw.mit.edu 18.726 Algebraic Geometry Spring 2009 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.726: Algebraic Geometry
More informationComposition and Decomposition of DPO Transformations with Borrowed Context
Composition and Decomposition of DP Transformations with Borrowed Context Paolo Baldan 1, Hartmut Ehrig 2, and Barbara König 3 1 Dipartimento di Informatica, niversità Ca Foscari di Venezia, Italy 2 Institut
More informationInequational Deduction as Term Graph Rewriting 1
TERMGRAPH Preliminary Version Inequational Deduction as Term Graph Rewriting Andrea Corradini and Fabio Gadducci Dipartimento di Informatica, Università di Pisa, Italy Wolfram Kahl 3 Department of Computing
More informationA Graph Rewriting Semantics for the Polyadic π-calculus
A Graph Rewriting Semantics for the Polyadic π-calculus BARBARA KÖNIG Fakultät für Informatik, Technische Universität München Abstract We give a hypergraph rewriting semantics for the polyadic π-calculus,
More informationDuality in Logic and Computation
Duality in Logic and Computation Prakash Panangaden 1 1 School of Computer Science McGill University IEEE Symposium On Logic In Computer Science, June 2013 Panangaden (McGill University) Duality in Logic
More informationGraph Transformations
Graph Transformations An Introduction to the Categorical Approach Hans J. Schneider c Hans J. Schneider, Computer Science Department, University of Erlangen-Nürnberg, Germany, 2012 December 28, 2012 211
More informationIsomorphism of Finitary Inductive Types
Isomorphism of Finitary Inductive Types Christian Sattler joint work (in progress) with Nicolai Kraus University of Nottingham May 2014 Motivating Example Generic data may be represented in a multitude
More information1 Categorical Background
1 Categorical Background 1.1 Categories and Functors Definition 1.1.1 A category C is given by a class of objects, often denoted by ob C, and for any two objects A, B of C a proper set of morphisms C(A,
More informationOn Term Graphs as an Adhesive Category
Electronic Notes in Theoretical Computer Science 127 (2005) 43 56 www.elsevier.com/locate/entcs On Term Graphs as an Adhesive Category Andrea Corradini 1 and Fabio Gadducci 2 Dipartimento di Informatica,
More informationA NOTE ON ENRICHED CATEGORIES
U.P.B. Sci. Bull., Series A, Vol. 72, Iss. 4, 2010 ISSN 1223-7027 A NOTE ON ENRICHED CATEGORIES Adriana Balan 1 În această lucrare se arată că o categorie simetrică monoidală închisă bicompletă V cu biproduse
More informationsset(x, Y ) n = sset(x [n], Y ).
1. Symmetric monoidal categories and enriched categories In practice, categories come in nature with more structure than just sets of morphisms. This extra structure is central to all of category theory,
More informationDistributive laws for the Coinductive Solution of Recursive Equations
Distributive laws for the Coinductive Solution of Recursive Equations Bart Jacobs Institute for Computing and Information Sciences, Radboud University Nijmegen P.O. Box 9010, 6500 GL Nijmegen, The Netherlands
More informationAutomata and Fixed Point Logic: a Coalgebraic Perspective
Automata and Fixed Point Logic: a Coalgebraic Perspective Yde Venema Abstract This paper generalizes existing connections between automata and logic to a coalgebraic level. Let F : Set Set be a standard
More informationFUNCTORS JULIA PADBERG. Institute for Communication and Software Technology.
CLASSIFICATION OF PETRI NETS USING ADJOINT FUNCTORS JULIA PADBERG Technical University of Berlin Institute for Communication and Software Technology email: padberg@cs.tu-berlin.de Keywords: Petri nets,
More informationCOMMUTATIVE ALGEBRA LECTURE 1: SOME CATEGORY THEORY
COMMUTATIVE ALGEBRA LECTURE 1: SOME CATEGORY THEORY VIVEK SHENDE A ring is a set R with two binary operations, an addition + and a multiplication. Always there should be an identity 0 for addition, an
More informationLIST OF CORRECTIONS LOCALLY PRESENTABLE AND ACCESSIBLE CATEGORIES
LIST OF CORRECTIONS LOCALLY PRESENTABLE AND ACCESSIBLE CATEGORIES J.Adámek J.Rosický Cambridge University Press 1994 Version: June 2013 The following is a list of corrections of all mistakes that have
More informationPetri Net Modules in the Transformation-Based Component Framework
Petri Net Modules in the Transformation-Based Component Framework Julia Padberg, Hartmut Ehrig Technische Universität Berlin Fakultät IV - Informatik und Elektrotechnik Franklinstr. 28/29, D-10587 Berlin
More information1. The Method of Coalgebra
1. The Method of Coalgebra Jan Rutten CWI Amsterdam & Radboud University Nijmegen IMS, Singapore - 15 September 2016 Overview of Lecture one 1. Category theory (where coalgebra comes from) 2. Algebras
More information1 Differentiable manifolds and smooth maps
1 Differentiable manifolds and smooth maps Last updated: April 14, 2011. 1.1 Examples and definitions Roughly, manifolds are sets where one can introduce coordinates. An n-dimensional manifold is a set
More informationRelations on Hypergraphs
Relations on Hypergraphs John Stell School of Computing, University of Leeds RAMiCS 13 Cambridge, 17th September 2012 Relations on a Set Boolean algebra Converse R = R Complement R = R Composition & residuation
More informationThe Essentially Equational Theory of Horn Classes
The Essentially Equational Theory of Horn Classes Hans E. Porst Dedicated to Professor Dr. Dieter Pumplün on the occasion of his retirement Abstract It is well known that the model categories of universal
More informationPetri Net Transformations
1 Petri Net Transformations Hartmut Ehrig, Kathrin Hoffmann, Julia Padberg, Claudia Ermel, Ulrike Prange, Enrico Biermann and Tony Modica Institute for Software Technology and Theoretical Computer Science
More informationSemantics and syntax of higher inductive types
Semantics and syntax of higher inductive types Michael Shulman 1 Peter LeFanu Lumsdaine 2 1 University of San Diego 2 Stockholm University http://www.sandiego.edu/~shulman/papers/stthits.pdf March 20,
More informationSMALL SUBSETS OF THE REALS AND TREE FORCING NOTIONS
SMALL SUBSETS OF THE REALS AND TREE FORCING NOTIONS MARCIN KYSIAK AND TOMASZ WEISS Abstract. We discuss the question which properties of smallness in the sense of measure and category (e.g. being a universally
More informationRecursion in Coalgebras
Recursion in Coalgebras Mauro Jaskelioff mjj@cs.nott.ac.uk School of Computer Science & IT FoP Away Day 2007 Outline Brief overview of coalgebras. The problem of divergence when considering unguarded recursion.
More informationA note on coinduction and weak bisimilarity for while programs
Centrum voor Wiskunde en Informatica A note on coinduction and weak bisimilarity for while programs J.J.M.M. Rutten Software Engineering (SEN) SEN-R9826 October 31, 1998 Report SEN-R9826 ISSN 1386-369X
More informationCategorical logics for contravariant simulations, partial bisimulations, modal refinements and mixed transition systems
Categorical logics for contravariant simulations, partial bisimulations, modal refinements and mixed transition systems Ignacio Fábregas, Miguel Palomino, and David de Frutos-Escrig Departamento de Sistemas
More informationThe Hopf monoid of generalized permutahedra. SIAM Discrete Mathematics Meeting Austin, TX, June 2010
The Hopf monoid of generalized permutahedra Marcelo Aguiar Texas A+M University Federico Ardila San Francisco State University SIAM Discrete Mathematics Meeting Austin, TX, June 2010 The plan. 1. Species.
More informationDEGREES OF CATEGORICITY AND THE HYPERARITHMETIC HIERARCHY
DEGREES OF CATEGORICITY AND THE HYPERARITHMETIC HIERARCHY BARBARA F. CSIMA, JOHANNA N. Y. FRANKLIN, AND RICHARD A. SHORE Abstract. We study arithmetic and hyperarithmetic degrees of categoricity. We extend
More informationImplementing -Reduction by. Hypergraph Rewriting. Sabine Kuske 1. Fachbereich Mathematik und Informatik. Universitat Bremen. D{28334 Bremen, Germany
URL: http://www.elsevier.nl/locate/entcs/volume2.html 8 pages Implementing -Reduction by Hypergraph Rewriting abine Fachbereich Mathematik und Informatik Universitat Bremen D{28334 Bremen, Germany email:
More informationAutomata and Fixed Point Logic: a Coalgebraic Perspective
Automata and Fixed Point Logic: a Coalgebraic Perspective Yde Venema Abstract This paper generalizes existing connections between automata and logic to a coalgebraic abstraction level. Let F : Set Set
More informationGraph Computation Models Selected Revised Papers from GCM 2014
Electronic Communications of the EASST Volume 71 (2015) Graph Computation Models Selected Revised Papers from GCM 2014 Graph Transformation with Symbolic Attributes via Monadic Coalgebra Homomorphisms
More information2 GRAPH AND NETWORK OPTIMIZATION. E. Amaldi Introduction to Operations Research Politecnico Milano 1
2 GRAPH AND NETWORK OPTIMIZATION E. Amaldi Introduction to Operations Research Politecnico Milano 1 A variety of decision-making problems can be formulated in terms of graphs and networks Examples: - transportation
More informationTransformational programming and forests
Transformational programming and forests AB18 1 A. Bijlsma Eindhoven University of Technology Department of Mathematics and Computing Science P.O. Box 513, 5600 MB Eindhoven, The Netherlands Introduction
More informationCoreflections in Algebraic Quantum Logic
Coreflections in Algebraic Quantum Logic Bart Jacobs Jorik Mandemaker Radboud University, Nijmegen, The Netherlands Abstract Various generalizations of Boolean algebras are being studied in algebraic quantum
More informationPushouts, Pullbacks and Their Properties
Pushouts, Pullbacks and Their Properties Joonwon Choi Abstract Graph rewriting has numerous applications, such as software engineering and biology techniques. This technique is theoretically based on pushouts
More informationMATH 101B: ALGEBRA II PART A: HOMOLOGICAL ALGEBRA
MATH 101B: ALGEBRA II PART A: HOMOLOGICAL ALGEBRA These are notes for our first unit on the algebraic side of homological algebra. While this is the last topic (Chap XX) in the book, it makes sense to
More informationICS141: Discrete Mathematics for Computer Science I
ICS141: Discrete Mathematics for Computer Science I Dept. Information & Computer Sci., Jan Stelovsky based on slides by Dr. Baek and Dr. Still Originals by Dr. M. P. Frank and Dr. J.L. Gross Provided by
More informationAlgebras with finite descriptions
Algebras with finite descriptions André Nies The University of Auckland July 19, 2005 Part 1: FA-presentability A countable structure in a finite signature is finite-automaton presentable (or automatic)
More informationAn Introduction to the Theory of Coalgebras
An Introduction to the Theory of Coalgebras Dirk Pattinson Institut für Informatik, LMU München 2 Contents 1 Introduction 7 1.1 State Based Systems....................... 7 1.1.1 Informal Denition....................
More informationAn Algebraic View of the Relation between Largest Common Subtrees and Smallest Common Supertrees
An Algebraic View of the Relation between Largest Common Subtrees and Smallest Common Supertrees Francesc Rosselló 1, Gabriel Valiente 2 1 Department of Mathematics and Computer Science, Research Institute
More informationDiscrete Mathematics. Benny George K. September 22, 2011
Discrete Mathematics Benny George K Department of Computer Science and Engineering Indian Institute of Technology Guwahati ben@iitg.ernet.in September 22, 2011 Set Theory Elementary Concepts Let A and
More informationJoseph Muscat Universal Algebras. 1 March 2013
Joseph Muscat 2015 1 Universal Algebras 1 Operations joseph.muscat@um.edu.mt 1 March 2013 A universal algebra is a set X with some operations : X n X and relations 1 X m. For example, there may be specific
More informationTheory of Computation
Theory of Computation (Feodor F. Dragan) Department of Computer Science Kent State University Spring, 2018 Theory of Computation, Feodor F. Dragan, Kent State University 1 Before we go into details, what
More information9. Integral Ring Extensions
80 Andreas Gathmann 9. Integral ing Extensions In this chapter we want to discuss a concept in commutative algebra that has its original motivation in algebra, but turns out to have surprisingly many applications
More informationVietoris bisimulations
Vietoris bisimulations N. Bezhanishvili, G. Fontaine and Y. Venema July 17, 2008 Abstract Building on the fact that descriptive frames are coalgebras for the Vietoris functor on the category of Stone spaces,
More informationExpressiveness of predicate logic: Some motivation
Expressiveness of predicate logic: Some motivation In computer science the analysis of the expressiveness of predicate logic (a.k.a. first-order logic) is of particular importance, for instance In database
More informationEquational Logic. Chapter Syntax Terms and Term Algebras
Chapter 2 Equational Logic 2.1 Syntax 2.1.1 Terms and Term Algebras The natural logic of algebra is equational logic, whose propositions are universally quantified identities between terms built up from
More informationSymbolic Graphs for Attributed Graph Constraints
Symbolic Graphs for Attributed Graph Constraints Fernando Orejas Dpt. L.S.I., Universitat Politècnica de Catalunya, Campus Nord, Mòdul Omega, Jordi Girona 1-3, 08034 Barcelona, Spain. Abstract In this
More informationAbstract model theory for extensions of modal logic
Abstract model theory for extensions of modal logic Balder ten Cate Stanford, May 13, 2008 Largely based on joint work with Johan van Benthem and Jouko Väänänen Balder ten Cate Abstract model theory for
More informationOn the Effectiveness of Symmetry Breaking
On the Effectiveness of Symmetry Breaking Russell Miller 1, Reed Solomon 2, and Rebecca M Steiner 3 1 Queens College and the Graduate Center of the City University of New York Flushing NY 11367 2 University
More informationFinite Induced Graph Ramsey Theory: On Partitions of Subgraphs
inite Induced Graph Ramsey Theory: On Partitions of Subgraphs David S. Gunderson and Vojtěch Rödl Emory University, Atlanta GA 30322. Norbert W. Sauer University of Calgary, Calgary, Alberta, Canada T2N
More informationThe complexity of recursive constraint satisfaction problems.
The complexity of recursive constraint satisfaction problems. Victor W. Marek Department of Computer Science University of Kentucky Lexington, KY 40506, USA marek@cs.uky.edu Jeffrey B. Remmel Department
More informationForschungsberichte der Fakultät IV Elektrotechnik und Informatik. Concurrency in Reconfigurable Place/Transition Systems:
Forschungsberichte der Fakultät IV Elektrotechnik und Informatik Concurrency in Reconfigurable Place/Transition Systems: Independence of Net Transformations as well as Net Transformations and Token Firing
More informationReconsidering MacLane. Peter M. Hines
Reconsidering MacLane Coherence for associativity in infinitary and untyped settings Peter M. Hines Oxford March 2013 Topic of the talk: Pure category theory... for its own sake. This talk is about the
More informationGeneric trace semantics via coinduction
Generic trace semantics via coinduction Hasuo, I.; Jacobs, B.P.F.; Sokolova, A. Published in: Logical Methods in Computer Science DOI: 10.2168/LMCS-3(4:11)2007 Published: 01/01/2007 Document Version Publisher
More informationGENERATORS FOR COMONOIDS AND UNIVERSAL CONSTRUCTIONS
GENERATORS FOR COMONOIDS AND UNIVERSAL CONSTRUCTIONS Adnan H Abdulwahid University of Iowa Third Conference on Geometric Methods in Representation Theory University of Iowa Department of Mathematics November
More informationBarr s Embedding Theorem for Enriched Categories
Barr s Embedding Theorem for Enriched Categories arxiv:0903.1173v3 [math.ct] 31 Aug 2009 Dimitri Chikhladze November 9, 2018 Abstract We generalize Barr s embedding theorem for regular categories to the
More informationA brief Introduction to Category Theory
A brief Introduction to Category Theory Dirk Hofmann CIDMA, Department of Mathematics, University of Aveiro, 3810-193 Aveiro, Portugal Office: 11.3.10, dirk@ua.pt, http://sweet.ua.pt/dirk/ October 9, 2017
More informationarxiv: v1 [math.ct] 28 Oct 2017
BARELY LOCALLY PRESENTABLE CATEGORIES arxiv:1710.10476v1 [math.ct] 28 Oct 2017 L. POSITSELSKI AND J. ROSICKÝ Abstract. We introduce a new class of categories generalizing locally presentable ones. The
More informationClosure operators on sets and algebraic lattices
Closure operators on sets and algebraic lattices Sergiu Rudeanu University of Bucharest Romania Closure operators are abundant in mathematics; here are a few examples. Given an algebraic structure, such
More informationDouble-pushout graph transformation revisited
Math. Struct. in Comp. Science (00), vol., pp. 637 688. c 00 Cambridge University Press DOI: 0.7/S096095000345 Printed in the United Kingdom Double-pushout graph transformation revisited ANNEGRET HABEL,JÜRGEN
More informationfor Boolean coherent toposes
for McMaster University McGill logic, category theory, and computation seminar 5 December 2017 What is first-order logic? A statement for a logical doctrine is an assertion that a theory in this logical
More informationEmbedding and Confluence of Graph Transformations with Negative Application Conditions
Embedding and Confluence of Graph Transformations with Negative Application Conditions Leen Lambers 1, Hartmut Ehrig 1, Ulrike Prange 1, and Fernando Orejas 2 1 Institute for Software Engineering and Theoretical
More informationTECHNISCHE UNIVERSITÄT DRESDEN. Fakultät Informatik. Technische Berichte Technical Reports. Frank Felfe
TECHNISCHE UNIVERSITÄT DRESDEN Fakultät Informatik TUD FI05 02 Januar 2005 Technische Berichte Technical Reports ISSN 1430-211X Frank Felfe Institut für Theoretische Informatik An Approach to Computable
More informationAn introduction to locally finitely presentable categories
An introduction to locally finitely presentable categories MARU SARAZOLA A document born out of my attempt to understand the notion of locally finitely presentable category, and my annoyance at constantly
More informationMath 455 Some notes on Cardinality and Transfinite Induction
Math 455 Some notes on Cardinality and Transfinite Induction (David Ross, UH-Manoa Dept. of Mathematics) 1 Cardinality Recall the following notions: function, relation, one-to-one, onto, on-to-one correspondence,
More information