Article contents
A coding theoretic study of MLL proof nets
Published online by Cambridge University Press: 02 February 2012
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) an MLL proof net is a true code element; and
(2) a proof structure that is not an MLL proof net is a false (or corrupted) code element.
- Type
- Paper
- Information
- Copyright
- Copyright © Cambridge University Press 2012
References
- 1
- Cited by