A categorical semantics for polarized MALL

Abstract In this paper, we present a categorical model for Multiplicative Additive Polarized Linear Logic MALLP , which is the linear fragment (without structural rules) of Olivier Laurent’s Polarized Linear Logic. Our model is based on an adjunction between reflective/coreflective full subcategories C − / C + of an ambient ∗ -autonomous category C (with products). Similar structures were first introduced by M. Barr in the late 1970’s in abstract duality theory and more recently in work on game semantics for linear logic. The paper has two goals: to discuss concrete models and to present various completeness theorems. As concrete examples, we present (i) a hypercoherence model, using Ehrhard’s hereditary/anti-hereditary objects, (ii) a Chu-space model, (iii) a double gluing model over our categorical framework, and (iv) a model based on iterated double gluing over a ∗ -autonomous category. For the multiplicative fragment MLLP of MALLP , we present both weakly full (Lauchli-style) as well as full completeness theorems, using a polarized version of functorial polymorphism in a double-glued hypercoherence model. For the latter, we introduce a notion of polarized ↑ -softness which is a variation of Joyal’s softness. This permits us to reduce the problem of polarized multiplicative full completeness to the nonpolarized MLL case, which we resolve by familiar functorial methods originating with Loader, Hyland, and Tan. Using a polarized Gustave function, we show that full completeness for MALLP fails for this model.

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

[2]  Michael Barr,et al.  *-Autonomous categories and linear logic , 1991, Mathematical Structures in Computer Science.

[3]  Jean-Yves Girard.  Locus Solum: From the Rules of Logic to the Logic of Rules , 2001, CSL.

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

[5]  Paul-André Melliès.  Categorical models of linear logic revisited , 2002 .

[6]  Vaughan Pratt,et al.  Chu spaces as a semantic bridge between linear logic and mathematics , 2003, Theor. Comput. Sci..

[7]  Kosta Dosen,et al.  Coherence for star-autonomous categories , 2006, Ann. Pure Appl. Log..

[8]  Martin Hyland,et al.  Glueing and orthogonality for models of linear logic , 2003, Theor. Comput. Sci..

[9]  Zoran Petric,et al.  Proof-Net Categories , 2007 .

[10]  Victor Harnik,et al.  Lambek's categorical proof theory and Läuchli's abstract realizability , 1992, Journal of Symbolic Logic.

[11]  Dominic J. D. Hughes,et al.  Modelling Linear Logic Without Units (Preliminary Results) , 2005, ArXiv.

[12]  A. Pitts.  INTRODUCTION TO HIGHER ORDER CATEGORICAL LOGIC (Cambridge Studies in Advanced Mathematics 7) , 1987 .

[13]  Thomas Ehrhard.  Hypercoherences: A Strongly Stable Model of Linear Logic , 1993, Math. Struct. Comput. Sci..

[14]  Olivier Laurent,et al.  Polarized Proof-Nets: Proof-Nets for LC , 1999, TLCA.

[15]  JEAN-MARC ANDREOLI,et al.  Logic Programming with Focusing Proofs in Linear Logic , 1992, J. Log. Comput..

[16]  Paul-André Melliès.  Asynchronous Games 3 An Innocent Model of Linear Logic , 2004, CTCS.

[17]  R. Blute,et al.  Category theory for linear logicians , 2004 .

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

[19]  Roberto M. Amadio,et al.  Domains and lambda-calculi , 1998, Cambridge tracts in theoretical computer science.

[20]  Masahito Hasegawa,et al.  COHERENCE OF THE DOUBLE INVOLUTION ON -AUTONOMOUS CATEGORIES , 2006 .

[21]  J. van Leeuwen,et al.  Theoretical Computer Science , 2003, Lecture Notes in Computer Science.

[22]  I. H. Öğüş,et al.  NATO ASI Series , 1997 .

[23]  J. Lambek,et al.  Introduction to higher order categorical logic , 1986 .

[24]  Jean-Marc Andreoli.  Focussing and proof construction , 2001, Ann. Pure Appl. Log..

[25]  Jean-Yves Girard,et al.  A new constructive logic: classic logic , 1991, Mathematical Structures in Computer Science.

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

[27]  Samson Abramsky,et al.  Sequentiality vs. concurrency in games and logic , 2003, Mathematical Structures in Computer Science.

[28]  Masahiro Hamano.  Pontrjagin duality and full completeness for multiplicative linear logic (without Mix) , 2000, Math. Struct. Comput. Sci..

[29]  Roberto M. Amadio,et al.  Domains and Lambda-Calculi (Cambridge Tracts in Theoretical Computer Science) , 2008 .

[30]  R. A. G. Seely,et al.  POLARIZED CATEGORY THEORY, MODULES, AND GAME SEMANTICS , 2007 .

[31]  Martin Hyland,et al.  Proof theory in the abstract , 2002, Ann. Pure Appl. Log..

[32]  J. Robin B. Cockett,et al.  The Logic of Linear Functors , 2002, Math. Struct. Comput. Sci..

[33]  Andre Scedrov,et al.  Functorial Polymorphism , 1990, Theor. Comput. Sci..

[34]  Dale Miller,et al.  An Overview of Linear Logic Programming , 2003 .

[35]  François Lamarche.  Games semantics for full propositional linear logic , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[36]  Dominic Hughes.  Simple free star-autonomous categories and full coherence , 2005 .

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

[38]  Jean-Yves Girard,et al.  Linear logic: its syntax and semantics , 1995 .

[39]  Peter Selinger,et al.  Control categories and duality: on the categorical semantics of the lambda-mu calculus , 2001, Mathematical Structures in Computer Science.