We introduce the calculus of structures: it is more general than the sequent calculus and it allows for cut elimination and the subformula property. We show a simple extension of multiplicative linear logic, by a self-dual non-commutative operator inspired by CCS, that seems not to be expressible in the sequent calculus. Then we show that multiplicative exponential linear logic benefits from its presentation in the calculus of structures, especially because we can replace the ordinary, global promotion rule by a local version. These formal systems, for which we prove cut elimination, outline a range of techniques and properties that were not previously available. Contrarily to what happens in the sequent calculus, the cut elimination proof is modular.
|Number of pages||15|
|Publication status||Published - Sep 2001|
|Event||Computer Science Logic (CSL) 2001 - Lecture Notes in Computer Science - |
Duration: 1 Sep 2001 → …
|Conference||Computer Science Logic (CSL) 2001 - Lecture Notes in Computer Science|
|Period||1/09/01 → …|