Completeness of Nominal PROPs

Authors

Samuel Balco, Runtime Verication Inc.
Alexander Kurz, Chapman UniversityFollow

Document Type

Article

Publication Date

1-26-2023

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.

Comments

This article was originally published in Logical Methods in Computer Science, volume 19, issue 1, in 2023. https://doi.org/10.46298/lmcs-19(1:8)2023

Recommended Citation

Samuel Balco and Alexander Kurz. Completeness of Nominal PROPs. Log. Methods Comput. Sci., 19(1), 2023. https://doi.org/10.46298/lmcs-19(1:8)2023

Copyright

The authors

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 License.