• Corpus ID: 11479545

Surface proofs for linear logic

@article{Dunn2016SurfacePF,
  title={Surface proofs for linear logic},
  author={Lawrence Dunn and Jamie Vicary},
  journal={ArXiv},
  year={2016},
  volume={abs/1601.05372}
}
We show that a proof in multiplicative linear logic can be represented as a decorated surface, such that two proofs are logically equivalent just when their surfaces are geometrically equivalent. The technical basis is a coherence theorem for Frobenius pseudomonoids. 
3 Citations

Figures from this paper

A Topological Perspective on Interacting Algebraic Theories

TLDR
This work presents constructions of computads, all with clear analogues in standard topology, that capture in great generality such notions as homomorphisms and actions, and the interactions of monoids and comonoids that lead to the theory of Frobenius algebra and of bialgebras.

Shaded tangles for the design and verification of quantum circuits

TLDR
This work gives a scheme for interpreting shaded tangles as quantum programs, with the property that isotopic tangles yield equivalent programs, and uses the methods to identify several new or generalized procedures.

References

SHOWING 1-10 OF 33 REFERENCES

The geometry of tensor calculus, I

Quasistrict symmetric monoidal 2-categories via wire diagrams

In this paper we give an expository account of quasistrict symmetric monoidal 2-categories, as introduced by Schommer-Pries. We reformulate the definition using a graphical calculus called wire

Simple multiplicative proof nets with units

This paper presents a simple notion of proof net for multiplicative linear logic with units. Cut elimination is direct and strongly normalising, in contrast to previous approaches which resorted to

Internal bicategories

We define bicategories internal to 2-categories. When the ambient 2-category is symmetric monoidal categories, this provides a convenient framework for encoding the structures of a symmetric monoidal

Linear Logic without Units

TLDR
A higher-dimensional analogue of Cayley's theorem is proved, and used to deduce a novel characterisation of the unit of a promonoidal category, and two characterisations of the categories that model the unitless fragment of intuitionistic multiplicative linear logic are given.

Frobenius monads and pseudomonoids

Six equivalent definitions of Frobenius algebra in a monoidal category are provided. In a monoidal bicategory, a pseudoalgebra is Frobenius if and only if it is star autonomous. Autonomous

From proof-nets to bordisms: the geometric meaning of multiplicative connectives

  • Sergey Slavnov
  • Mathematics
    Mathematical Structures in Computer Science
  • 2005
TLDR
Deep relationships are discovered between this new model and the author's coherent phase spaces model (Slavnov 2003), which is based on the context of symplectic geometry, and the resulting model has an extremely intuitive geometric description.

Linear Logic, -Autonomous Categories and Cofree Coalgebras

A brief outline of the categorical characterisation of Girard's linear logic is given, analagous to the relationship between cartesian closed categories and typed-calculus. The linear structure

No proof nets for MLL with units

TLDR
It is shown that MLL proof equivalence is PSPACE-complete, using a reduction from Nondeterministic Constraint Logic, and the existence of a satisfactory notion of proof nets for MLL with units is ruled out.