Proof nets for the multimodal Lambek calculus

Studia Logica 71 (3):415-442 (2002)
Abstract
We present a novel way of using proof nets for the multimodal Lambek calculus, which provides a general treatment of both the unary and binary connectives. We also introduce a correctness criterion which is valid for a large class of structural rules and prove basic soundness, completeness and cut elimination results. Finally, we will present a correctness criterion for the original Lambek calculus Las an instance of our general correctness criterion.
Keywords Philosophy   Logic   Mathematical Logic and Foundations   Computational Linguistics
Categories (categorize this paper)
Reprint years 2004
DOI 10.1023/A:1020525032763
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history
Request removal from index
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 29,478
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA
Symmetric Categorial Grammar.Michael Moortgat - 2009 - Journal of Philosophical Logic 38 (6):681-710.

Add more citations

Similar books and articles
Added to PP index
2009-01-28

Total downloads
29 ( #179,887 of 2,180,556 )

Recent downloads (6 months)
1 ( #302,815 of 2,180,556 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature


Discussion
Order:
There  are no threads in this forum
Nothing in this forum yet.

Other forums