Proof nets without links for Lambek calculus and partially commutative linear logic - Archive ouverte HAL
Communication Dans Un Congrès Année : 2008

Proof nets without links for Lambek calculus and partially commutative linear logic

Résumé

Proof nets wothout links turn algebraic properties of the connectives like assocativity into proof equality. We recall similar results for multiplicative linear logic and for Lambek syntactic calculus before providing an almost complete solution for partially commutative linear logic which contains both commutative and non commutative connectives.
Fichier non déposé

Dates et versions

hal-00409487 , version 1 (09-08-2009)

Identifiants

  • HAL Id : hal-00409487 , version 1

Citer

Daniele Porello, Christian Retoré. Proof nets without links for Lambek calculus and partially commutative linear logic. 50 years of the Syntactic calculus, Jul 2008, Chieti, Italy. ⟨hal-00409487⟩
142 Consultations
0 Téléchargements

Partager

More