# Exponentially Handsome Proof Nets and Their Normalization

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.

## Authors

• 3 publications
02/09/2018

### Unification nets: canonical proof net quantifiers

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

### Proof nets, coends and the Yoneda isomorphism

Proof nets provide permutation-independent representations of proofs and...
12/15/2017

### Taylor expansion in linear logic is invertible

Each Multiplicative Exponential Linear Logic (MELL) proof-net can be exp...
02/14/2019

### 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 ...
07/31/2020

### Stellar Resolution: Multiplicatives

We present a new asynchronous model of computation named Stellar Resolut...
02/13/2020

### The Abstract Machinery of Interaction (Long Version)

This paper revisits the Interaction Abstract Machine (IAM), a machine ba...
12/07/2020

### Stellar Resolution: Multiplicatives – for the linear logician, through examples

The stellar resolution is an asynchronous model of computation used in G...
##### This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.