% Encoding: UTF-8
@COMMENT{BibTeX export based on data in FAU CRIS: https://cris.fau.de/}
@COMMENT{For any questions please write to cris-support@fau.de}
@inproceedings{faucris.311741156,
abstract = {Theory graphs have theories as nodes and theory morphisms as edges. They can be seen as generators of categories with the nodes as the objects and the paths as the morphisms. But in contrast to generated categories, theory graphs do not allow for an equational theory on the morphisms. That blocks formalizing important aspects of theory graphs such as isomorphisms between theories. MMT is essentially a logic-independent language for theory graphs. It previously supported theories and morphisms, and we extend it with morphism equality as a third primitive. We show the importance of this feature in several elementary formalizations that critically require stating and proving certain non-trivial morphism equalities. The key difficulty of this approach is that important properties of theory graphs now become undecidable and require heuristic methods.},
author = {Rabe, Florian and Weber, Franziska},
booktitle = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
date = {2023-09-05/2023-09-08},
doi = {10.1007/978-3-031-42753-4{\_}12},
editor = {Catherine Dubois, Manfred Kerber},
faupublication = {yes},
isbn = {9783031427527},
note = {CRIS-Team Scopus Importer:2023-10-06},
pages = {174-189},
peerreviewed = {unknown},
publisher = {Springer Science and Business Media Deutschland GmbH},
title = {{Morphism} {Equality} inĀ {Theory} {Graphs}},
venue = {Cambridge, GBR},
volume = {14101 LNAI},
year = {2023}
}