A note on the exact completion of a regular category, and its infinitary generalizations.
Lack, Stephen (1999)
Theory and Applications of Categories [electronic only]
Similarity:
Lack, Stephen (1999)
Theory and Applications of Categories [electronic only]
Similarity:
Gran, Marino, Vitale, Enrico Maria (1999)
Theory and Applications of Categories [electronic only]
Similarity:
Isar Stubbe (2005)
Cahiers de Topologie et Géométrie Différentielle Catégoriques
Similarity:
Hu, Hongde, Tholen, Walter (1996)
Theory and Applications of Categories [electronic only]
Similarity:
S. Mantovani (1998)
Cahiers de Topologie et Géométrie Différentielle Catégoriques
Similarity:
Menni, Matías (2001)
Theory and Applications of Categories [electronic only]
Similarity:
Diers, Yves (2005)
Theory and Applications of Categories [electronic only]
Similarity:
Gran, Marino, Pedicchio, Maria Cristina (2001)
Theory and Applications of Categories [electronic only]
Similarity:
Brian J. Day (1978)
Cahiers de Topologie et Géométrie Différentielle Catégoriques
Similarity:
Stephen Lack, Paweł Sobociński (2005)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
We introduce adhesive categories, which are categories with structure ensuring that pushouts along monomorphisms are well-behaved, as well as quasiadhesive categories which restrict attention to regular monomorphisms. Many examples of graphical structures used in computer science are shown to be examples of adhesive and quasiadhesive categories. Double-pushout graph rewriting generalizes well to rewriting on arbitrary adhesive and quasiadhesive categories.