Abstract
We dene a notion of polarization in linear logic (LL) coming from the polarities of Jean-Yves Girard’s classical sequent calculus LC [4]. This allows us to dene a translation between the two systems. Then we study the application of this polar ization constraint to proofnets for full linear logic described in [7]. This yields an important simplication of the correctness criterion for polarized proof-nets. In this way we obtain a system of proof-nets for LC.
Cite
CITATION STYLE
Laurent, O. (1999). Polarized proof-nets: Proof-nets for LC. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1581, pp. 213–227). Springer Verlag. https://doi.org/10.1007/3-540-48959-2_16
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
