Computer Science – Computation and Language
Scientific paper
2011-12-29
Computer Science
Computation and Language
Revised version to appear as a chapter in E. Grefenstette, C. Heunen, and M. Sadrzadeh (eds.) 'Compositional Methods in Physic
Scientific paper
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.
Moortgat Michael
Moot Richard
No associations
LandOfFree
Proof nets for the Lambek-Grishin calculus does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Proof nets for the Lambek-Grishin calculus, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Proof nets for the Lambek-Grishin calculus will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-728721