Classical Non-Associative Lambek Calculus

Studia Logica 71 (3):355 - 388 (2002)
We introduce non-associative linear logic, which may be seen as the classical version of the non-associative Lambek calculus. We define its sequent calculus, its theory of proof-nets, for which we give a correctness criterion and a sequentialization theorem, and we show proof search in it is polynomial.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/20016441
 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
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 16,707
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles
Kosta Došen (1992). Modal Logic as Metalogic. Journal of Logic, Language and Information 1 (3):173-201.
Makoto Kanazawa (1992). The Lambek Calculus Enriched with Additional Connectives. Journal of Logic, Language and Information 1 (2):141-171.

Monthly downloads

Added to index


Total downloads

4 ( #424,619 of 1,726,249 )

Recent downloads (6 months)

3 ( #231,316 of 1,726,249 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.