How to delete categorically -- two pushout complement constructions

DOI10.1016/j.jsc.2010.09.007zbMath1215.18002OpenAlexW2042982712MaRDI QIDQ631570

Benjamin Braatz, Ulrike Golas, Thomas Soboll

Publication date: 14 March 2011

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2010.09.007

zbMATH Keywords

graph transformationdouble-pushout approachinitial pushoutpushout complementquasi-coproduct complement

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Limits and colimits (products, sums, directed limits, pushouts, fiber products, equalizers, kernels, ends and coends, etc.) (18A30)

Related Items (5)

A Software Package for Chemically Inspired Graph Transformation ⋮ Fundamentals of compositional rewriting theory ⋮ Computational category-theoretic rewriting ⋮ Finitary -adhesive categories ⋮ Concurrency theorems for non-linear rewriting theories

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pushout-complements and basic concepts of grammars in toposes
• Topoi. The categorial analysis of logic. Rev. ed
• Fundamentals of algebraic graph transformation
• Sesqui-Pushout Rewriting
• On the Construction of Transformation Steps in the Category of Multiagent Systems

This page was built for publication: How to delete categorically -- two pushout complement constructions