Samuel Balco ; Alexander Kurz - Completeness of Nominal PROPs

lmcs:6313 - Logical Methods in Computer Science, January 26, 2023, Volume 19, Issue 1 - https://doi.org/10.46298/lmcs-19(1:8)2023
Completeness of Nominal PROPsArticle

Authors: Samuel Balco ; Alexander Kurz

    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.


    Volume: Volume 19, Issue 1
    Published on: January 26, 2023
    Accepted on: November 26, 2022
    Submitted on: April 21, 2020
    Keywords: Computer Science - Logic in Computer Science

    Consultation statistics

    This page has been seen 1403 times.
    This article's PDF has been downloaded 290 times.