Every Finitely Reducible Logic has the Finite Model Property with Respect to the Class of Diamond-Formulae

Stéphane Demri (1, 2) , Ewa Orlowska (3)

1 Leibniz - IMAG - Laboratoire Leibniz
2 CNRS - Centre National de la Recherche Scientifique
3 Institute of Telecommunications

In this paper a unified framework for dealing with a broad family of propositional multimodal logics is developed. The key tools for presentation of the logics are the notions of closure relation operation and monotonous relation operation. The two classes of logics: FiRe-logics (finitely reducible logics) and LaFiRe-logics (FiRe-logics with local agreement of accessibility relations) are introduced within the proposed framework. Further classes of logics can be handled indirectly by means of suitable translations. It is shown that the logics from these classes have the finite model property with respect to the class of ♦-formulae, i.e. each ♦-formula has a ℒ-model iff it has a finite ℒ-model. Roughly speaking, a ♦-formula is logically equivalent to a formula in negative normal form without occurrences of modal operators with necessity force. In the proof we introduce a substantial modification of Claudio Cerrato's filtration technique that has been originally designed for graded modal logics. The main core of the proof consists in building adequate restrictions of models while preserving the semantics of the operators used to build terms indexing the modal operators.

Domaines: Informatique [cs]; Logique en informatique [cs.LO]

Stéphane Demri, Ewa Orlowska. Every Finitely Reducible Logic has the Finite Model Property with Respect to the Class of Diamond-Formulae. Studia Logica, 1999, 62 (2), pp.177-200. ⟨10.1023/A:1026499402531⟩. ⟨hal-03192512⟩