A new correctness criterion for cyclic proof nets

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
Categories (categorize this paper)
Reprint years 2004
DOI 10.1023/A:1008354130493
Options
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 32,678
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles
Added to PP index
2009-01-28

Total downloads
17 ( #327,742 of 2,236,870 )

Recent downloads (6 months)
2 ( #266,081 of 2,236,870 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature