Skip to Main content Skip to Navigation

Réseaux et séquents ordonnés

Abstract : This thesis provides a sequent calculus for linear logic enriched with a non comutative and selfdual connective called "before", in between "par" and "times". It is defined for sequents whose formulae are endowed with a partial order. A proof net calculus, a quotient of the sequent calculus is defined in terms of directed graphs. This calculus enjoys a denotational semantics with coherence spaces, which is preserved under cut eliminatio, a terminating and confluent process. Some needed combinatorial properties of partial orders and proof graphs are established, as well as some properties of the commutative calculus with the MIX rule.
Complete list of metadatas
Contributor : Christian Retoré <>
Submitted on : Wednesday, April 13, 2011 - 3:44:15 PM
Last modification on : Saturday, March 28, 2020 - 2:11:02 AM
Long-term archiving on: : Thursday, July 14, 2011 - 2:47:07 AM


  • HAL Id : tel-00585634, version 1



Christian Retoré. Réseaux et séquents ordonnés. Mathématiques [math]. Université Paris-Diderot - Paris VII, 1993. Français. ⟨tel-00585634⟩



Record views


Files downloads