Abstract.
We introduce a new correctness criterion for multiplicative non commutative proof nets which can be considered as the non-commutative counterpart to the Danos-Regnier criterion for proof nets of linear logic. The main intuition relies on the fact that any switching for a proof net (obtained by mutilating one premise of each disjunction link) can be naturally viewed as a series-parallel order variety (a cyclic relation) on the conclusions of the proof net.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: 8 November 2000 / Revised version: 21 June 2001 / Published online: 2 September 2002
Research supported by the EU TMR Research Programme ``Linear Logic and Theoretical Computer Science''.
Mathematics Subject Classification (2000): 03F03, 03F07, 03F52, 03B70
Key words or phrases: Linear and non-commutative logic – Proof nets – Series-parallel orders and order varieties
Rights and permissions
About this article
Cite this article
Maieli, R. A new correctness criterion for multiplicative non-commutative proof nets. Arch. Math. Logic 42, 205–220 (2003). https://doi.org/10.1007/s001530100127
Issue Date:
DOI: https://doi.org/10.1007/s001530100127