Finite Models of Some Substructural Logics

Mathematical Logic Quarterly 48 (1):63-72 (2002)
  Copy   BIBTEX

Abstract

We give a proof of the finite model property of some fragments of commutative and noncommutative linear logic: the Lambek calculus, BCI, BCK and their enrichments, MALL and Cyclic MALL. We essentially simplify the method used in [4] for proving fmp of BCI and the Lambek ca culus and in [5] for proving fmp of MALL. Our construction of finite models also differs from that used in Lafont [8] in his proof of fmp of MALL

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,642

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
2013-11-03

Downloads
6 (#711,559)

6 months
31 (#500,116)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Quantales and (noncommutative) linear logic.David N. Yetter - 1990 - Journal of Symbolic Logic 55 (1):41-64.
Completeness Results for Lambek Syntactic Calculus.Wojciech Buszkowski - 1986 - Mathematical Logic Quarterly 32 (1‐5):13-28.
Completeness Results for Lambek Syntactic Calculus.Wojciech Buszkowski - 1986 - Mathematical Logic Quarterly 32 (1-5):13-28.
Some Decision Problems in the Theory of Syntactic Categories.Wojciech Buszkowski - 1982 - Mathematical Logic Quarterly 28 (33‐38):539-548.

View all 9 references / Add more references