Classical non-associative Lambek calculus

Studia Logica 71 (3):355-388 (2002)
  Copy   BIBTEX

Abstract

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.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,672

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-01-28

Downloads
67 (#241,904)

6 months
8 (#352,539)

Historical graph of downloads
How can I increase my downloads?