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.
|Titolo:||Retractile Proof Nets of the Purely Multiplicative and Additive Fragment of Linear Logic|
MAIELI, ROBERTO (Corresponding)
|Data di pubblicazione:||2007|
|Citazione:||Maieli, R. (2007). Retractile Proof Nets of the Purely Multiplicative and Additive Fragment of Linear Logic. In Logic for Programming, Artificial Intelligence, and Reasoning. - 14th International Conference, LPAR 2007, Yerevan, Armenia, October 15-19, 2007. Proceedingsasoning. (pp.363-377). BERLIN HEIDELBERG : Springer-Verlag.|
|Appare nelle tipologie:||4.1 Contributo in Atti di convegno|