A new correctness criterion for cyclic proof nets
Journal of Logic, Language and Information 7 (4):449-459 (1998)
| 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 | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,664 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesFrank A. Bäuerle, David Albrecht, John N. Crossley & John S. Jeavons (1998). Curry-Howard Terms for Linear Logic. Studia Logica 61 (2):223-235.
Jean-Baptiste Joinet, Harold Schellinx & Lorenzo Tortora de Falco (2002). SN and CR for Free-Style LKtq: Linear Decorations and Simulation of Normalization. Journal of Symbolic Logic 67 (1):162-196.
Jean-Yves Girard, Yves Lafont & Laurent Regnier (eds.) (1995). Advances in Linear Logic. Cambridge University Press.
Mark Johnson (1998). Proof Nets and the Complexity of Processing Center Embedded Constructions. Journal of Logic, Language and Information 7 (4):433-447.
Denis Béchet (2007). Parsing Pregroup Grammars and Lambek Calculus Using Partial Composition. Studia Logica 87 (2-3):199 - 224.
Dirk Roorda (1994). Interpolation in Fragments of Classical Linear Logic. Journal of Symbolic Logic 59 (2):419-444.
Philippe De Groote & François Lamarche (2002). Classical Non-Associative Lambek Calculus. Studia Logica 71 (3):355 - 388.
Philippe de Groote & François Lamarche (2002). Classical Non-Associative Lambek Calculus. Studia Logica 71 (3):355-388.
Richard Moot & Quintijn Puite (2002). Proof Nets for the Multimodal Lambek Calculus. Studia Logica 71 (3):415-442.
Misao Nagayama & Mitsuhiro Okada (2001). A New Correctness Criterion for the Proof Nets of Non-Commutative Multiplicative Linear Logics. Journal of Symbolic Logic 66 (4):1524-1542.
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads6 ( #145,498 of 549,017 )Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
