Proof nets for the Lambek-Grishin calculus
Computation and Language
2011-12-30 v1
Abstract
Grishin's generalization of Lambek's Syntactic Calculus combines a non-commutative multiplicative conjunction and its residuals (product, left and right division) with a dual family: multiplicative disjunction, right and left difference. Interaction between these two families takes the form of linear distributivity principles. We study proof nets for the Lambek-Grishin calculus and the correspondence between these nets and unfocused and focused versions of its sequent calculus.
Keywords
Cite
@article{arxiv.1112.6384,
title = {Proof nets for the Lambek-Grishin calculus},
author = {Michael Moortgat and Richard Moot},
journal= {arXiv preprint arXiv:1112.6384},
year = {2011}
}
Comments
Revised version to appear as a chapter in E. Grefenstette, C. Heunen, and M. Sadrzadeh (eds.) 'Compositional Methods in Physics and Linguistics', Oxford University Press