Polarized Proof-Nets: Proof-Nets for LC
Résumé
We define a notion of polarization in linear logic (LL) coming from the polarities of Jean-Yves Girard's classical sequent calculus LC. This allows us to define a translation between the two systems. Then we study the application of this polarization constraint to proof-nets for full linear logic. This yields an important simplification of the correctness criterion for polarized proof-nets. In this way we obtain a system of proof-nets for LC.