Cut Elimination for Monomial Proof Nets of the Purely Multiplicative and Additive Fragment of Linear Logic

Roberto Maieli (1)

1 ROMA TRE - Università degli Studi Roma Tre = Roma Tre University

We present a simple cut-elimination procedure for MALL proof nets with monomial weights (` a la Girard) and explicit contraction links, based on an almost local cut reduction steps. This procedure preserves correctness of proof nets and it is strong normalizing and confluent.

Mots clés: Proof Theory; Sequent Calculus; Cut Elimination; Proof Nets; Linear Logic

Domaines: Logique en informatique [cs.LO]

Roberto Maieli. Cut Elimination for Monomial Proof Nets of the Purely Multiplicative and Additive Fragment of Linear Logic. [Research Report] Department of Mathematics and Physics, Roma TRE University. 2007. ⟨hal-01153910⟩