Skip to Main content Skip to Navigation

Handsome Non-Commutative Proof-Nets: perfect matchings, series-parallel orders and Hamiltonian circuits

Sylvain Pogodalla 1 Christian Retoré 2
1 CALLIGRAMME - Linear logic, proof networks and categorial grammars
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
2 SIGNES - Linguistic signs, grammar and meaning: computational logic for natural language
INRIA Futurs, Université Sciences et Technologies - Bordeaux 1, École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), Université Bordeaux Montaigne, CNRS - Centre National de la Recherche Scientifique : UMR5800
Abstract : This paper provides a definition of proof-nets for non-commutative linear logic (cyclic linear logic and Lambek calculus) where there are no links, that are small graphs representing the connectives. Instead of a tree like representation with links, the formula is depicted as a graph representing the conclusion up to the algebraic properties of the connectives. In the commutative case the formula is viewed as a cograph. In the non-commutative case it is a more complicated kind of graph which is, roughly speaking, a directed cograph. The criterion consists in the commutative condition plus a bracketing condition.
Document type :
Complete list of metadata

Cited literature [28 references]  Display  Hide  Download
Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Tuesday, May 23, 2006 - 2:51:56 PM
Last modification on : Friday, February 4, 2022 - 3:34:47 AM
Long-term archiving on: : Sunday, April 4, 2010 - 10:04:20 PM


  • HAL Id : inria-00071248, version 1


Sylvain Pogodalla, Christian Retoré. Handsome Non-Commutative Proof-Nets: perfect matchings, series-parallel orders and Hamiltonian circuits. [Research Report] RR-5409, INRIA. 2004, pp.25. ⟨inria-00071248⟩



Record views


Files downloads