Constructive Logics. Part II: Linear Logic and Proof Nets
The purpose of this paper is to give an exposition of material dealing with constructive logics, typed -calculi, and linear logic. The first part of this paper gives an exposition of background material (with the exception of the Girard-translation of classical logic into intuitionistic logic, which is new). This second part is devoted to linear logic and proof nets. Particular attention is given to the algebraic semantics (in Girard’s terminology, phase semantics) of linear logic. We show how phase spaces arise as an instance of a Galois connection. We also give a direct proof of the correctness of the Danos-Regnier criterion for proof nets. This proof is based on a purely graph-theoretic decomposition lemma. As a corollary, we give anO(n2)-time algorithm for testing whether a proof net is correct. Although the existence of such an algorithm has been announced by Girard, our algorithm appears to be original.