Abstract

The paper is mainly concerned with the extension of proof-nets to additives, for which the best known solution is presented. It proposes two cut-elimination procedures, the lazy one being in linear time. The solution is shown to be compatible with quantifiers, and the structural rules of exponentials are also accommodated. Traditional proof-theory deals with cut-elimination; these results are usually obtained by means of sequent calculi, with the consequence that 75 % of a cutelimination proof is devoted to endless commutations of rules. It is hard to be happy with this, mainly because: ◮ the structure of the proof is blurred by all these cases; ◮ whole forests have been destroyed in order to print the same routine lemmas; ◮ this is not extremely elegant. However old-fashioned proof-theory, which is concerned with the ritual question: “is-that-theory-consistent? ” never really cared. The situation changed when subtle algorithmic aspects of cut-elimination became prominent: typically

Citations

97	Towards a geometry of interaction - Girard - 1989
39	The structure of multiplicatives, Archive for Mathematical Logic 28 - Danos - 1989
11	Geometry of interaction III: the general case - Girard - 1993
5	Multiplicatives' Rendiconti del Seminario Matematico dell' Universit'a e Politecnico Torino - Girard - 1987
5	Quantifiers in linear logic II. In Nuovi problemi della logica e della filosofia della scienza - Girard - 1991
2	Quantifiers in linear logic. In Temi e prospettivi della logica e della filosofia della szienca contemporanee - Girard - 1987