The finite model property for BCI and related systems (Q2563452)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 957481
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The finite model property for BCI and related systems |
scientific article; zbMATH DE number 957481 |
Statements
The finite model property for BCI and related systems (English)
0 references
12 December 1996
0 references
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.
0 references
finite model property
0 references
BCI logic
0 references
barriers
0 references
0.8676103949546814
0 references
0.8270213007926941
0 references
