Abstract

A graph-theoretical look at multiplicative proof nets lead us to two new descriptions of a proof net, both as a graph endowed with a perfect matching. The first one is a rather conventional encoding of the connectives which nevertheless allows us to unify various sequentialisation techniques as the corollaries of a single graph theoretical result. The second one is more exciting: a proof net simply consists in the set of its axioms -- the perfect matching -- plus one single series-parallel graph which encodes the whole syntactical forest of the sequent. We thus identify proof nets which only differ because of the commutativity or associativity of the connectives, or because final par have been performed or not. We thus push further the program of proof net theory which is to get closer to the proof itself, ...

Citations

115	The Structure of Multiplicatives - Danos, Regnier - 1989
25	The mix rule - Fleury, Retoré - 1994
24	The number of two-terminal series-parallel networks - Riordan, Shannon - 1942
17	Pomset logic as an alternative categorial grammar - Lecomte, Retore - 1995
15	Comparability graphs - Kelly - 1984
12	Extremal Graph Theory - Bollobs - 1978
7	Matching Theory, volume 121 of Mathematics Studies - Lov'asz, Plummer - 1986
5	R#seaux et S#quents Ordonn#s. Th#se de Doctorat, sp#cialit - Retor - 1993
1	logique lin#aire appliqu#e # l'#tude de divers processus de normalisation et principalement du -calcul. Th#se de Doctorat, sp#cialit - La - 1990
1	On the theory of ��nite graph with a linear factor - Kotzig - 1959
1	Algorithmic aspects of comparability graphs - Mohring - 1985
1	Graph theory from linear logic: aggregates. Pr#publication 47, Equipe de Logique, Universit# Paris 7 - Retor - 1993