From Proof nets to the Free *-Autonomous Categories

Francois Lamarche 1 Lutz Strassburger 1
1 CALLIGRAMME - Linear logic, proof networks and categorial grammars
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : In the first part of this paper we present a theory of proof nets for full multiplicative linear logic, including the two units. It naturally extends the well-known theory of unit-free multiplicative proof nets. A linking is no longer a set of axiom links but a tree in which the axiom links are subtrees. These trees will be identified according to an equivalence relation based on a simple form of graph rewriting. We show the standard results of sequentialization and strong normalization of cut elimination. In the second part of the paper we show that the identifications enforced on proofs are such that the class of two-conclusion proof nets defines the free *-autonomous category.
Document type :
Complete list of metadatas
Contributor : Publications Loria <>
Submitted on : Wednesday, November 15, 2006 - 2:43:26 PM
Last modification on : Thursday, July 4, 2019 - 3:56:24 PM
Long-term archiving on : Monday, April 5, 2010 - 11:05:46 PM



Francois Lamarche, Lutz Strassburger. From Proof nets to the Free *-Autonomous Categories. [Research Report] A04-R-390 || lamarche04a, 2004, 45 p. ⟨inria-00099865v1⟩



Record views


Files downloads