A semantic characterisation of the correctness of a proof net
by Chr I St, I An Retore
http://www.irisa.fr/paragraphe/Christian.Retore/ARTICLES/coretcoh.ps
Add To MetaCart
Abstract:
The purpose of this note is to show that the correctness of a multiplicative proof net with mix is equivalent to its semantic correctness: a proof structure is a proof net if and only if its semantic interpretation is a clique, where one given finite coherence space interprets all propositional variables. This is just an example of what can be done with these kinds of semantic techniques; for more information and further results, the reader is referred to (Retor'e, 1994).
Citations
| 479 | On the unity of logic – Girard - 1993 |
| 211 | Computational interpretations of linear logic – Abramsky - 1993 |
| 148 | Interaction nets – Lafont - 1990 |
| 37 | The structure of Multiplicatives, Archive for Mathematical Logic 28 – Danos, Regnier - 1989 |
| 22 | The mix rule – Fleury, Retoré - 1994 |
| 21 | La Logique Lin'eaire Appliqu'ee `a l"etude de Divers Processus de Normalisation (Principalement du -Calcul – Danos - 1990 |
| 16 | Réseaux et Séquents Ordonnés. Thèse de Doctorat, spécialité Mathématiques, Université Paris 7, février – Retoré - 1993 |
| 8 | Linear logic: A survey – Girard - 1993 |
| 6 | Perfect matchings and series-parallel graphs: multiplicatives proof nets as r&b-graphs – Retor'e - 1996 |
| 5 | On the relation between coherence semantics and multiplicative proof nets. Rapport de Recherche 2430, INRIA, decembre – Retore - 1994 |
