A New Correctness Criterion for Cyclic Proof Nets |
| |
Authors: | V Michele Abrusci Elena Maringelli |
| |
Affiliation: | (1) Logica, Dipartimento di Filosofia, Università, di Roma Tre, via Magenta 5, 00185 Rome, Italy |
| |
Abstract: | We define proof nets for cyclic multiplicative linear logic as edge bi-coloured graphs. Our characterization is purely graph theoretical and works without further complication for proof nets with cuts, which are usually harder to handle in the non-commutative case. This also provides a new characterization of the proof nets for the Lambek calculus (with the empty sequence) which simply are a restriction on the formulas to be considered (which are asked to be intuitionistic). |
| |
Keywords: | Linear logic proof nets |
本文献已被 SpringerLink 等数据库收录! |
|