Completeness of Nominal PROPs

04/16/2020
by   Samuel Balco, et al.
0

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.

READ FULL TEXT

page 2

page 6

page 7

page 19

page 33

research
04/16/2019

Nominal String Diagrams

We introduce nominal string diagrams as, string diagrams internal in the...
research
05/13/2022

Completeness and expressiveness for gs-monoidal categories

Formalised in the study of symmetric monoidal categories, string diagram...
research
04/20/2018

Graphical Conjunctive Queries

The Calculus of Conjunctive Queries (CCQ) has foundational status in dat...
research
09/14/2019

Propagation complete encodings of smooth DNNF theories

We investigate conjunctive normal form (CNF) encodings of a function rep...
research
03/25/2023

From Gödel's Incompleteness Theorem to the completeness of bot religions (Extended abstract)

Hilbert and Ackermann asked for a method to consistently extend incomple...
research
05/01/2023

Data-Parallel Algorithms for String Diagrams

We give parallel algorithms for string diagrams represented as structure...
research
05/12/2021

Categorical composable cryptography

We formalize the simulation paradigm of cryptography in terms of categor...

Please sign up or login with your details

Forgot password? Click here to reset