- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
The finite model property for BCI and related systems
Studia Logica 57 (2-3):303-323 (1996)
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].Other Versions
No versions found
My notes
Similar books and articles
Finite Models of Some Substructural Logics.Wojciech Buszkowski - 2001 - Mathematical Logic Quarterly 48 (1):63-72.
On the Complexity of Some Substructural Logics.Buszkowski Wojciech - 2008 - Reports on Mathematical Logic.
Distributive Full Lambek Calculus Has the Finite Model Property.Michał Kozak - 2009 - Studia Logica 91 (2):201-216.
The Pentus Theorem for Lambek Calculus with Simple Nonlogical Axioms.Maria Bulińska - 2005 - Studia Logica 81 (1):43-59.
On the Complexity of Nonassociative Lambek Calculus with Unit.Maria Bulińska - 2009 - Studia Logica 93 (1):1-14.
Relational Semantics of the Lambek Calculus Extended with Classical Propositional Logic.Michael Kaminski & Nissim Francez - 2014 - Studia Logica 102 (3):479-497.
Language-Theoretic and Finite Relation Models for the (Full) Lambek Calculus.Christian Wurm - 2017 - Journal of Logic, Language and Information 26 (2):179-214.
The Lambek calculus enriched with additional connectives.Makoto Kanazawa - 1992 - Journal of Logic, Language and Information 1 (2):141-171.
Analytics
Added to PP
2009-01-28
Downloads
111 (#437,428)
6 months
40 (#213,498)
2009-01-28
Downloads
111 (#437,428)
6 months
40 (#213,498)
Historical graph of downloads
Citations of this work
Structural Completeness in Substructural Logics.J. S. Olson, J. G. Raftery & C. J. Van Alten - 2008 - Logic Journal of the IGPL 16 (5):453-495.
The finite model property for various fragments of intuitionistic linear logic.Mitsuhiro Okada & Kazushige Terui - 1999 - Journal of Symbolic Logic 64 (2):790-802.
Cut elimination and strong separation for substructural logics: an algebraic approach.Nikolaos Galatos & Hiroakira Ono - 2010 - Annals of Pure and Applied Logic 161 (9):1097-1133.
Dual-Context Sequent Calculus and Strict Implication.Kentaro Kikuchi - 2002 - Mathematical Logic Quarterly 48 (1):87-92.
Variations on a Theme of Curry.Lloyd Humberstone - 2006 - Notre Dame Journal of Formal Logic 47 (1):101-131.
References found in this work
The Mathematics of Sentence Structure.Joachim Lambek - 1958 - Journal of Symbolic Logic 65 (3):154-170.
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.
Try MATCHA Writer if you're interested in citing directly from PhilPapers and certifying your authorship.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation