Completeness of Nominal PROPs

DOI10.46298/LMCS-19(1:8)2023MaRDI QIDQ5883754zbMATH OpenOpenAlexFDO

Authors Samuel Balco, Alexander Kurz

Publication date 22 March 2023

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2004.08380v5

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites work

• scientific article; zbMATH DE number 2125662 (Why is no real title available?)
• scientific article; zbMATH DE number 3251427 (Why is no real title available?)
• scientific article; zbMATH DE number 3344105 (Why is no real title available?)
• scientific article; zbMATH DE number 3367095 (Why is no real title available?)
• scientific article; zbMATH DE number 7649901 (Why is no real title available?)
• A program construction and verification tool for separation logic
• A structural and nominal syntax for diagrams
• A survey of graphical languages for monoidal categories
• Adjointness in Foundations
• Automata theory in nominal sets
• Braided tensor categories
• Causal inference by string diagram surgery
• Classical roots of knot theory
• Coherent presentations of monoidal categories
• Denotational semantics with nominal Scott domains
• Foundations of Software Science and Computational Structures
• Full abstraction for signal flow graphs
• Functorial Boxes in String Diagrams
• Learning nominal automata
• Linear logic
• Multi-type display calculus for dynamic epistemic logic
• Nominal (universal) algebra: equational logic with names and binding
• Nominal Domain Theory for Concurrency
• Nominal sets. Names and symmetry in computer science
• On the category of props
• Picturing quantum processes. A first course in quantum theory and diagrammatic reasoning
• Pure bigraphs: structure and dynamics
• Rewriting modulo symmetric monoidal structure
• Stone Duality for Nominal Boolean Algebras with И
• The Logic of Bunched Implications
• The Logical Essentials of Bayesian Reasoning
• The calculus of signal flow diagrams. I: Linear relations on streams.
• The geometry of tensor calculus. I
• The semantics of BI and resource tableaux
• Topology and logic as a source of algebra
• Towards an algebraic theory of Boolean circuits.

This page was built for publication: Completeness of Nominal PROPs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5883754)