 |
PREUVES, PROGRAMMES et SYSTÈMES |  |
|
PREUVES, PROGRAMMES et SYSTÈMES | |
| HAL: hal-00154204, version 1 |
| Detailed view |  Export this paper |
 |
| Linear Logic in Computer Science, Thomas Ehrhard and Jean-Yves Girard and Paul Ruet and Philip Scott (Ed.) (2004) 283-323 |
|
|
|
|
| A topological correctness criterion for non-commutative logic |
|
|
| Paul-André Melliès 1 |
|
|
| (2004) |
|
|
|
| We formulate Girard's long trip criterion for multiplicative linear logic (MLL) in a topological way, by associating a ribbon diagram to every switching, and requiring that it is homeomorphic to the disk. Then, we extend the well-known planarity criterion for multiplicative cyclic linear logic (McyLL) to multiplicative non-commutative logic (MNL) and show that the resulting planarity criterion is equivalent to Abrusci and Ruet's original long trip criterion for MNL. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | Preuves, Programmes et Systèmes (PPS) |
|
|
|
CNRS : UMR7126 – Université Paris VII - Paris Diderot |
|
|
|
|
|
|
|
|
|
| Subject | : | Computer Science/Logic in Computer Science |
|
|
| logique linéaire – logique cyclique – logique non commutative – critère de correction – planarité – rubans |
|
|
|
| Attached file list to this document: | ||||||||||
|
||||||||||
|
|
|
| hal-00154204, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00154204 | |
| oai:hal.archives-ouvertes.fr:hal-00154204 | |
| From: Paul-André Melliès | |
| Submitted on: Tuesday, 19 June 2007 13:36:06 | |
| Updated on: Wednesday, 20 June 2007 15:25:23 | |
