Completeness of Nominal PROPs
Logic in Computer Science
2023-06-22 v5
Abstract
We introduce nominal string diagrams as string diagrams internal in the category of nominal sets. This leads us to define nominal PROPs and nominal monoidal theories. We show that the categories of ordinary PROPs and nominal PROPs are equivalent. This equivalence is then extended to symmetric monoidal theories and nominal monoidal theories, which allows us to transfer completeness results between ordinary and nominal calculi for string diagrams.
Keywords
Cite
@article{arxiv.2004.08380,
title = {Completeness of Nominal PROPs},
author = {Samuel Balco and Alexander Kurz},
journal= {arXiv preprint arXiv:2004.08380},
year = {2023}
}
Comments
arXiv admin note: text overlap with arXiv:1904.07534