Proof nets sequentialisation in multiplicative linear logic


We provide an alternative proof of the sequentialisation theorem for proof nets of multiplicative linear logic. Namely, we show how a proof net can be transformed into a sequent calculus proof simply by properly adding to it some special edges, called sequential edges, which express the sequentiality constraints given by sequent calculus. © 2008 Elsevier B… (More)
DOI: 10.1016/j.apal.2008.04.002


2 Figures and Tables

Slides referencing similar topics