Proof nets for the Lambek-Grishin calculus
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:4MHEAXUSrecord.jsonopen to challenge →
classification
cs.CL
keywords
calculusnetslambek-grishinleftmultiplicativeproofrightcombines
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.