On Proof Nets for Multiplicative Linear Logic with Units - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2004

On Proof Nets for Multiplicative Linear Logic with Units

Résumé

In this paper a theory of proof nets for multiplicative linear logic is presented, which includes the two multiplicative 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 will have the standard results of sequentialisation and strong normalisation of cut elimination. Furthermore, the identifications enforced on proofs are such that the proof nets, as they are presented here, form the arrows of the free (symmetric) *-autonomous category.
Fichier non déposé

Dates et versions

inria-00100244 , version 1 (26-09-2006)

Identifiants

  • HAL Id : inria-00100244 , version 1

Citer

Lutz Strassburger, François Lamarche. On Proof Nets for Multiplicative Linear Logic with Units. 18th International Workshop on Computer Science Logic - CSL'2004, 2004, Karpacz, Poland, pp.145--159. ⟨inria-00100244⟩
84 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More