A survey of proof nets and matrices for substructural logics
Logic in Computer Science
2012-03-23 v1
Abstract
This paper is a survey of two kinds of "compressed" proof schemes, the \emph{matrix method} and \emph{proof nets}, as applied to a variety of logics ranging along the substructural hierarchy from classical all the way down to the nonassociative Lambek system. A novel treatment of proof nets for the latter is provided. Descriptions of proof nets and matrices are given in a uniform notation based on sequents, so that the properties of the schemes for the various logics can be easily compared.
Cite
@article{arxiv.1203.4912,
title = {A survey of proof nets and matrices for substructural logics},
author = {Sean A. Fulop},
journal= {arXiv preprint arXiv:1203.4912},
year = {2012}
}