The finite model property for BCI and related systems

DOI10.1007/BF00370837MaRDI QIDQ2563452zbMATH OpenOpenAlexFDO

Authors Wojciech Buszkowski

Publication date 12 December 1996

Published in Studia Logica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00370837

zbMATH Keywords

barriersBCI logicfinite model property

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Other algebras related to logic (03G25) BCK-algebras, BCI-algebras (06F35)

Review text

This paper answers problems posed by Meyer and Ono in proving the finite model property (\(A\) is provable if \(A\) is valid in every finite model) for BCI logic, BCI logic with conjunction and some restricted versions of these systems in the style of the lambda calculus. The author uses the ``method of barriers which he introduced to prove the same property for the product free lambda calculus and the commutative product free lambda calculus.

Recommendations

• The finite model property for BCK and BCIW
• Finite models of some substructural logics
• The finite model property for the implicational fragment of IPC without exchange and contraction

Cites work

• A Completeness Theorem for the Lambek Calculus of Syntactic Categories
• Compatibility of a Categorial Grammar With an Associated Category System
• Completeness Results for Lambek Syntactic Calculus
• scientific article; zbMATH DE number 4051579 (Why is no real title available?)
• scientific article; zbMATH DE number 46160 (Why is no real title available?)
• scientific article; zbMATH DE number 591901 (Why is no real title available?)
• scientific article; zbMATH DE number 700092 (Why is no real title available?)
• scientific article; zbMATH DE number 1406808 (Why is no real title available?)
• Lambek calculus is NP-complete
• Language in action. Categories, lambdas and dynamic logic
• Linear logic
• Logics without the contraction rule
• The finite model property for BCK and BCIW
• The Mathematics of Sentence Structure

Cited in

(16)

• The finite model property and recursive bounds on the size of countermodels
• Algebraic structures in categorial grammar
• The finite model property for BCK and BCIW
• A note on monothetic BCI
• Variations on a theme of Curry
• Language models for some extensions of the Lambek calculus
• Finite models of some substructural logics
• n-fold BCI-positive implicativeness
• The finite model property for semilinear substructural logics
• On an axiomatic system for the logic of linearly ordered BCI-matrices
• The finite model property for various fragments of intuitionistic linear logic
• Problems on the generation of finite models
• Relational Models for the Lambek Calculus with Intersection and Constants
• Cut elimination and strong separation for substructural logics: an algebraic approach
• Contextual deduction theorems
• On finite models of the Lambek calculus

This page was built for publication: The finite model property for BCI and related systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2563452)