How to delete categorically -- two pushout complement constructions

DOI10.1016/J.JSC.2010.09.007MaRDI QIDQ631570zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Categoricity and quantifier elimination for intuitionistic theories
• scientific article; zbMATH DE number 2051175
• On pullback and pushout diagrams in general and super comma categories
• Finite categories with pushouts
• scientific article; zbMATH DE number 910440
• Pushouts of categories, derived limits, and colimits
• The pushouts category of additive category
• scientific article; zbMATH DE number 778200
• Elimination of quantifiers for commutative theories
• Constructing categories and setoids of setoids in type theory

Cites work

• scientific article; zbMATH DE number 139800 (Why is no real title available?)
• scientific article; zbMATH DE number 3633737 (Why is no real title available?)
• scientific article; zbMATH DE number 1216133 (Why is no real title available?)
• scientific article; zbMATH DE number 195102 (Why is no real title available?)
• Fundamentals of algebraic graph transformation
• On the Construction of Transformation Steps in the Category of Multiagent Systems
• Pushout-complements and basic concepts of grammars in toposes
• Sesqui-Pushout Rewriting
• Topoi. The categorial analysis of logic. Rev. ed

Cited in

(13)

• Fundamentals of compositional rewriting theory
• A software package for chemically inspired graph transformation
• Concurrency theorems for non-linear rewriting theories
• Pushout-complements and basic concepts of grammars in toposes
• Van Kampen squares for graph transformation
• Single pushout rewriting in comprehensive systems
• Single pushout rewriting in comprehensive systems of graph-like structures
• On the Construction of Transformation Steps in the Category of Multiagent Systems
• Partial pullback complement rewriting along admissible matches
• Computational category-theoretic rewriting
• Partial pullback complement rewriting
• Computational Category-Theoretic Rewriting
• Finitary \(\mathcal{M}\)-adhesive categories

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q631570)