From Proof nets to the Free *-Autonomous Categories - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Logical Methods in Computer Science Year : 2006

From Proof nets to the Free *-Autonomous Categories


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.
Fichier principal
Vignette du fichier
FreeStarLMCS.pdf (530.53 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00099865 , version 1 (15-11-2006)
inria-00099865 , version 2 (16-11-2006)



François Lamarche, Lutz Strassburger. From Proof nets to the Free *-Autonomous Categories. Logical Methods in Computer Science, 2006, 2 (4:3), 44 p. ⟨10.2168/LMCS-2(4:3)2006⟩. ⟨inria-00099865v2⟩
104 View
221 Download



Gmail Facebook Twitter LinkedIn More