The finite model property for BCI and related systems

Studia Logica 57 (2-3):303 - 323 (1996)
  Copy   BIBTEX

Abstract

We prove the finite model property (fmp) for BCI and BCI with additive conjunction, which answers some open questions in Meyer and Ono [11]. We also obtain similar results for some restricted versions of these systems in the style of the Lambek calculus [10, 3]. The key tool is the method of barriers which was earlier introduced by the author to prove fmp for the product-free Lambek calculus [2] and the commutative product-free Lambek calculus [4].

Links

PhilArchive



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

External links

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

Through your library

Similar books and articles

Analytics

Added to PP
2009-01-28

Downloads
38 (#409,607)

6 months
9 (#290,637)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Variations on a Theme of Curry.Lloyd Humberstone - 2006 - Notre Dame Journal of Formal Logic 47 (1):101-131.
Finite Models of Some Substructural Logics.Wojciech Buszkowski - 2002 - Mathematical Logic Quarterly 48 (1):63-72.

View all 8 citations / Add more citations

References found in this work

The Mathematics of Sentence Structure.Joachim Lambek - 1958 - Journal of Symbolic Logic 65 (3):154-170.
Linear Logic.Jean-Yves Girard - 1987 - Theoretical Computer Science 50:1–102.
Language in action.Johan Van Benthem - 1991 - Journal of Philosophical Logic 20 (3):225-263.
Logics without the contraction rule.Hiroakira Ono & Yuichi Komori - 1985 - Journal of Symbolic Logic 50 (1):169-201.
Completeness Results for Lambek Syntactic Calculus.Wojciech Buszkowski - 1986 - Mathematical Logic Quarterly 32 (1‐5):13-28.

View all 13 references / Add more references