DeepAI AI Chat
Log In Sign Up

Exponentially Handsome Proof Nets and Their Normalization

by   Matteo Acclavio, et al.

Handsome proof nets were introduced by Retoré as a syntax for multiplicative linear logic. These proof nets are defined by means of cographs (graphs representing formulas) equipped with a vertices partition satisfying simple topological conditions. In this paper we extend this syntax to multiplicative linear logic with units and exponentials. For this purpose we develop a new sound and complete sequent system for the logic, enforcing a stronger notion of proof equivalence with respect to the one usually considered in the literature. We then define combinatorial proofs, a graphical proof system able to capture syntactically the proof equivalence, for the cut-free fragment of the calculus. We conclude the paper by defining the exponentially handsome proof nets as combinatorial proofs with cuts and defining an internal normalization procedure for this syntax.


page 1

page 2

page 3

page 4


Graphical Proof Theory I: Multiplicative Linear Logic Beyond Cographs

Cographs are a class of (undirected) graphs, characterized by the absenc...

Proof nets, coends and the Yoneda isomorphism

Proof nets provide permutation-independent representations of proofs and...

Unification nets: canonical proof net quantifiers

Proof nets for MLL (unit-free Multiplicative Linear Logic) are concise g...

An application of parallel cut elimination in multiplicative linear logic to the Taylor expansion of proof nets

We examine some combinatorial properties of parallel cut elimination in ...

Cobordisms and commutative categorial grammars

We propose a concrete surface representation of abstract categorial gram...

A theory of linear typings as flows on 3-valent graphs

Building on recently established enumerative connections between lambda ...

Interpreting a concurrent λ-calculus in differential proof nets (extended version)

In this paper, we show how to interpret a language featuring concurrency...