Proof nets for unit-free multiplicative-additive linear logic

A cornerstone of the theory of proof nets for unit-free multiplicative linear logic (MLL) is the abstract representation of cut-free proofs modulo inessential rule commutation. The only known extension to additives, based on monomial weights, fails to preserve this key feature: a host of cut-free monomial proof nets can correspond to the same cut-free proof. Thus, the problem of finding a satisfactory notion of proof net for unit-free multiplicative-additive linear logic (MALL) has remained open since the inception of linear logic in 1986. We present a new definition of MALL proof net which remains faithful to the cornerstone of the MLL theory.

[1]  Dominic J. D. Hughes.  A canonical graphical syntax for non-empty finite products a nd sums , 2002 .

[2]  Jean-Yves Girard.  On the meaning of logical rules I : Syntax versus semantics , 1999 .

[3]  François Lamarche,et al.  Naming Proofs in Classical Propositional Logic , 2005, TLCA.

[4]  Ralph Loader.  Linear logic, totality and full completeness , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

[5]  J. Girard.  PROOF-NETS : THE PARALLEL SYNTAX FOR PROOF-THEORY , 1996 .

[6]  Vincent Danos,et al.  The structure of multiplicatives , 1989, Arch. Math. Log..

[7]  Dominic Hughes.  Logic Without Syntax , 2005 .

[8]  Jean-Yves Girard,et al.  Linear Logic , 1987, Theor. Comput. Sci..

[9]  Jean-Yves Girard,et al.  On the meaning of logical rules I: syntax vs. semantics , 1998 .

[10]  Gianluigi Bellin,et al.  A Decision Procedure Revisited: Notes on Direct Logic, Linear Logic and its Implementation , 1992, Theor. Comput. Sci..

[11]  Masahiro Hamano,et al.  Softness of MALL proof-structures and a correctness criterion with Mix , 2004, Arch. Math. Log..

[12]  Richard W. Weyhrauch,et al.  A Decidable Fragment of Predicate Calculus , 1984, Theor. Comput. Sci..

[13]  Radha Jagadeesan,et al.  Games and Full Completeness for Multiplicative Linear Logic , 1994, J. Symb. Log..

[14]  Philip J. Scott,et al.  Linear Läuchli Semantics , 1996, Ann. Pure Appl. Log..

[15]  R. Blute,et al.  Natural deduction and coherence for weakly distributive categories , 1996 .

[16]  Olivier Laurent,et al.  Slicing Polarized Additive Normalization , 2022 .

[17]  Gordon D. Plotkin,et al.  Full completeness of the multiplicative linear logic of Chu spaces , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[18]  Philip J. Scott,et al.  Softness of hypercoherences and MALL full completeness , 2005, Ann. Pure Appl. Log..

[19]  R. Blute,et al.  Linear L Auchli Semantics , 1996 .

[20]  Patrick Lincoln,et al.  Linear logic , 1992, SIGA.

[21]  Dominic Hughes.  Proofs without syntax , 2004 .

[22]  Radha Jagadeesan,et al.  Games and full completeness for multiplicative linear logic , 1992, Journal of Symbolic Logic.

[23]  Samson Abramsky,et al.  Concurrent games and full completeness , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).