A new correctness criterion for cyclic proof nets

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
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 35,865
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

Total downloads
17 ( #356,194 of 2,293,801 )

Recent downloads (6 months)
1 ( #410,358 of 2,293,801 )

How can I increase my downloads?

Monthly downloads

My notes

Sign in to use this feature