Constructing free Boolean categories

By Boolean category we mean something which is to a Boolean algebra what a category is to a poset. We propose an axiomatic system for Boolean categories, which is different in several respects from the ones proposed recently In particular everything is done from the start in a *-autonomous category and not in a weakly distributive one, which simplifies issues like the Mix rule. An important axiom, which is introduced later, is a "graphical" condition, which is closely related to denotational semantics and the Geometry of Interaction. Then we show that a previously constructed category of proof nets is the free "graphical" Boolean category in our sense. This validates our categorical axiomatization with respect to a real-life example. Another important aspect of this work is that we do not assume a-priori the existence of units in the *-autonomous categories we use. This has some retroactive interest for the semantics of linear logic, and is motivated by the properties of our example with respect to units.

[1]  Thomas Streicher,et al.  Classical logic, continuation semantics and abstract machines , 1998, Journal of Functional Programming.

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

[3]  R. A. G. Seely,et al.  Weakly distributive categories , 1997 .

[4]  François Lamarche,et al.  On Proof Nets for Multiplicative Linear Logic with Units , 2004, CSL.

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

[6]  Richard Blute,et al.  Linear Logic, Coherence, and Dinaturality , 1993, Theor. Comput. Sci..

[7]  Andrew Pressley,et al.  QUANTUM GROUPS (Graduate Texts in Mathematics 155) , 1997 .

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

[9]  Rob J. van Glabbeek,et al.  Proof nets for unit-free multiplicative-additive linear logic , 2005, TOCL.

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

[11]  Alessio Guglielmi,et al.  A system of interaction and structure , 1999, TOCL.

[12]  François Lamarche,et al.  Naming Proofs in Classical Propositional Logic , 2005, TLCA.

[13]  David J. Pym,et al.  Order-enriched categorical models of the classical sequent calculus , 2006 .

[14]  Rob J. van Glabbeek,et al.  Proof nets for unit-free multiplicative-additive linear logic (extended abstract) , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..

[15]  Martin Hyland.  Abstract Interpretation of Proofs: Classical Propositional Calculus , 2004, CSL.

[16]  François Lamarche,et al.  From Proof Nets to the Free *-Autonomous Category , 2006, Log. Methods Comput. Sci..

[17]  S. Maclane,et al.  Categories for the Working Mathematician , 1971 .

[18]  N. Reshetikhin,et al.  Quantum Groups , 1993, hep-th/9311069.

[19]  Saunders MacLane,et al.  Natural Associativity and Commutativity , 1963 .

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

[21]  David J. Pym,et al.  On the geometry of interaction for classical logic , 2004, LICS 2004.

[22]  S. Lane.  Categories for the Working Mathematician , 1971 .

[23]  Alwen Tiu,et al.  A Local System for Classical Logic , 2001, LPAR.