Proof Nets for Multiplicative Cyclic Linear Logic and Lambek Calculus

Maieli, Roberto; Abrusci, Vito Michele - This paper presents a simple and intuitive syntax for proof nets of the multiplicative cyclic fragment (McyLL) of linear logic (LL). The main technical achievement of this work is to propose a correctness criterion that allows for sequentialization (recovering a proof from a proof net) for all McyLL proof nets, including those containing cut links.