Retractile Proof Nets of the Purely Multiplicative and Additive Fragment of Linear Logic

Proof nets are a parallel syntax for sequential proofs of linear logic, firstly introduced by Girard in 1987. Here we present and intrinsic (geometrical) characterization of proof nets, that is a correctness criterion (an algorithm) for checking those proof structures which correspond to proofs of the purely multiplicative and additive fragment of linear logic. This criterion is formulated in terms of simple graph rewriting rules and it extends an initial idea of a retraction correctness criterion for proof nets of the purely multiplicative fragment of linear logic presented by Danos in his Thesis in 1990.

• Type: Conference
• Year: 2007
• Where: LPAR
• Authors: Roberto Maieli
• Keywords: Artificial Intelligence, Correctness Criterion, Linear Logic, LPAR 2007, Proof Nets