(1) Department of Computer Science, King's College, Strand, London, WC2R 2LS, UK;(2) Institute of Information Transmission Problems, Russian Academy of Sciences, B. Karetny 19, 101447 Moscow, Russia
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.