Completeness of Nominal PROPs

Samuel Balco; Alexander Kurz

doi:10.46298/lmcs-19(1:8)2023

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.

Comment: arXiv admin note: text overlap with arXiv:1904.07534

https://doi.org/10.46298/lmcs-19(1:8)2023

Source: arXiv.org:2004.08380

Volume: Volume 19, Issue 1

Secondary volumes: Selected Papers of the 8th Conference on Algebra and Coalgebra in Computer Science (CALCO 2019)

Published on: January 26, 2023

Imported on: April 21, 2020

Keywords: Computer Science - Logic in Computer Science

Licence: Attribution 4.0 International (CC BY 4.0)