Full Intuitionistic Linear Logic (extended abstract)

Abstract In this paper we give a brief treatment of a theory of proofs for a system of Full Intuitionistic Linear Logic. This system is distinct from Classical Linear Logic, but unlike the standard Intuitionistic Linear Logic of Girard and Lafont includes the multiplicative disjunction par. This connective does have an entirely natural interpretation in a variety of (non-classical) categorical models of Intuitionistic Linear Logic. The main proof-theoretic problem arises from the observation of Schellinx that cut elimination fails outright for an intuitive formulation of Full Intuitionistic Linear Logic; the nub of the problem is the interaction between par and linear implication. We present here a term assignment system which gives an interpretation of proofs as some kind of non-deterministic function. In this way we find a system which does enjoy cut elimination. The system is a direct result of an analysis of the categorical semantics, though we make an effort to present the system as if it were purely a proof-theoretic construction.

[1]  Jean-Yves Girard,et al.  The System F of Variable Types, Fifteen Years Later , 1986, Theor. Comput. Sci..

[2]  Michel Parigot,et al.  Lambda-Mu-Calculus: An Algorithmic Interpretation of Classical Natural Deduction , 1992, LPAR.

[3]  Jean-Yves Girard,et al.  Linear Logic and Lazy Computation , 1987, TAPSOFT, Vol.2.

[4]  de Paiva,et al.  The Dialectica categories , 1991 .

[5]  J. Zucker.  The correspondence between cut-elimination and normalization II , 1974 .

[6]  Valeria C V de Paiva,et al.  Term Assignment for Intuitionistic Linear Logic , 1992 .

[7]  Valeria de Paiva,et al.  A new proof system for intuitionistic logic , 1995 .

[8]  Samson Abramsky,et al.  Computational Interpretations of Linear Logic , 1993, Theor. Comput. Sci..

[9]  Valeria de Paiva,et al.  A Dialectica-like Model of Linear Logic , 1989, Category Theory and Computer Science.

[10]  Harold Schellinx,et al.  Some Syntactical Observations on Linear Logic , 1991, J. Log. Comput..

[11]  Andreas Blass,et al.  A Game Semantics for Linear Logic , 1992, Ann. Pure Appl. Log..

[12]  Andre Scedrov,et al.  Bounded Linear Logic: A Modular Approach to Polynomial-Time Computability , 1992, Theor. Comput. Sci..

[13]  John W. Gray,et al.  Categories in Computer Science and Logic , 1989 .

[14]  Dov M. Gabbay,et al.  Abduction in Labelled Deductive Systems - A Conceptual Abstract , 1991, ECSQARU.

[15]  R. A. G. Seely,et al.  Linear Logic, -Autonomous Categories and Cofree Coalgebras , 1989 .

[16]  Garrel Pottinger,et al.  Normalization as a homomorphic image of cut-elimination , 1977 .