Skip to main content
Log in

A New Correctness Criterion for Cyclic Proof Nets

  • Published:
Journal of Logic, Language and Information Aims and scope Submit manuscript

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).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Abrusci, V.M., 1991, “Phase semantics and sequent calculus for pure non-commutative classical linear logic,” Journal of Symbolic Logic 56(4), 1403–1451.

    Google Scholar 

  • Abrusci, V.M., 1995, “Non-commutative proof nets,” pp. 271–296 in J.-Y. Girard, Y. Lafont, and L. Regnier, eds., Cambridge: Cambridge University Press.

    Google Scholar 

  • Berge, C., 1973, Graphs and Hypergraphs, Amsterdam: North-Holland.

    Google Scholar 

  • Danos, V. and Regnier, L., 1989, “The structure of multiplicatives,” Archive for Mathematical Logic 28, 181–203.

    Google Scholar 

  • Girard, J.-Y., “Linear logic,” Theoretical Computer Science 50(1), 1–102.

  • Girard, J.-Y., Lafont, Y., and Regnier, L., eds., 1995, Advances in Linear Logic, London Mathematical Society Lecture Notes, Vol. 222, Cambridge: Cambridge University Press.

    Google Scholar 

  • Lambek, J., 1958, “The mathematics of sentence structure,” American Mathematical Monthly, 154–170.

  • Retoré, C., 1996a, “Calcul de Lambek et logique linéaire,” Traitement Automatique des Langues 37(2), 39–70.

    Google Scholar 

  • Retoré, C., 1996b, Perfect Matchings and Series-Parallel Graphs: Multiplicative Proof Nets as R&BGraphs, Electronic Notes in Theoretical Computer Science, Vol. 3, http://www.elsevier.com/

  • Yetter, D.N., 1990, “Quantales and (non-commutative) linear logic,” Journal of Symbolic Logic 55, 41–64.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Abrusci, V.M., Maringelli, E. A New Correctness Criterion for Cyclic Proof Nets. Journal of Logic, Language and Information 7, 449–459 (1998). https://doi.org/10.1023/A:1008354130493

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008354130493

Navigation