Abstract
In this paper we improve the results of [2] by proving the product f.m.p. for the product of minimal n-modal and minimal n-temporal logic. For this case we modify the finite depth method introduced in [1]. The main result is applied to identify new fragments of classical first-order logic and of the equational theory of relation algebras, that are decidable and have the finite model property.
| Original language | English |
|---|---|
| Pages (from-to) | 157-183 |
| Number of pages | 27 |
| Journal | Studia Logica |
| Volume | 72 |
| Issue number | 2 |
| DOIs | |
| State | Published - 2002 |
| Externally published | Yes |
Keywords
- Classical first-order logic
- Decidability
- Finite depth method
- Finite model property
- Product finite model property
- Product of modal logics
- Relation algebra
- Temporal logic