Proof nets for the Lambek-Grishin calculus

Michael Moortgat; Richard Moot

REVIEW

Proof nets for the Lambek-Grishin calculus

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1112.6384 v1 pith:4MHEAXUS submitted 2011-12-29 cs.CL

Michael Moortgat , Richard Moot This is my paper · ORCID

classification cs.CL

keywords calculusnetslambek-grishinleftmultiplicativeproofrightcombines

verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments

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.

Discussion (0). Continue with ORCID to comment.

Pith tools