Hostname: page-component-6766d58669-bp2c4 Total loading time: 0 Render date: 2026-05-16T04:43:14.461Z Has data issue: false hasContentIssue false
  • English
  • Français

A coding theoretic study of MLL proof nets

Published online by Cambridge University Press:  02 February 2012

SATOSHI MATSUOKA
SATOSHI MATSUOKA*
Affiliation:
National Institute of Advanced Industrial Science and Technology (AIST), 1-1-1 Umezono, Tsukuba, Ibaraki, 305-8563Japan E-mail: matsuoka@ni.aist.go.jp
Get access Rights & Permissions [Opens in a new window]

Abstract

In this paper we propose a novel approach for analysing proof nets of Multiplicative Linear Logic (MLL) using coding theory. We define families of proof structures called PS-families and introduce a metric space for each family. In each family:

  1. (1) an MLL proof net is a true code element; and

  2. (2) a proof structure that is not an MLL proof net is a false (or corrupted) code element.

The definition of our metrics elegantly reflects the duality of the multiplicative connectives. We show that in our framework one-error-detection is always possible but one-error-correction is always impossible. We also demonstrate the importance of our main result by presenting two proof-net enumeration algorithms for a given PS-family: the first searches proof nets naively and exhaustively without help from our main result, while the second uses our main result to carry out an intelligent search. In some cases, the first algorithm visits proof structures exponentially, while the second does so only polynomially.

Information

Type
Paper
Information
Mathematical Structures in Computer Science , Volume 22 , Issue 3 , June 2012 , pp. 409 - 449
Copyright
Copyright © Cambridge University Press 2012

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

Baylis, J. (1998) Error-Correcting Codes: A Mathematical Introduction, Chapman and Hall.CrossRefGoogle Scholar
Bellin, G. and van de Wiele, J. (1995) Subnets of Proof-nets in MLL−. In: Girard, J.-Y., Lafont, Y. and Regnier, L. (eds.) Advances in Linear Logic, Cambridge University Press 249–270.CrossRefGoogle Scholar
Danos, V. and Regnier, R. (1989) The structure of multiplicatives. Archive for Mathematical Logic 28 181–203.CrossRefGoogle Scholar
Girard, J.-Y. (1987) Linear Logic. Theoretical Computer Science 50 1–102.CrossRefGoogle Scholar
Girard, J.-Y. (1996) Proof-nets: the parallel syntax for proof-theory. In: Ursini, A. and Agliano, P. (eds.) Logic and Algebra, Marcel Dekker 97–124.Google Scholar
Girard, J.-Y. (2006) Le Point Aveugle: Tome I, vers la perfection, Hermann.Google Scholar
Guerrini, S. (1999) Correctness of Multiplicative Proof Nets Is Linear. In: 14th Annual IEEE Symposium on Logic in Computer Science (LICS'99), IEEE Computer Society Press 454–463.Google Scholar
Matsuoka, S. (2007) Weak Typed Böhm Theorem on IMLL. Annals of Pure and Applied Logic 145 37–90.CrossRefGoogle Scholar
MacWilliams, F. J. and Sloane, N. J. A. (1993) The Theory of Error-correcting Codes, North-Holland.Google Scholar