Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
AndrÉka, H., J. van Benthem, and I. NÉmeti, ‘Back and forth between modal logic and classical logic’, Journal of the Interest Group in Propositional Logics 3(5):685–720, 1995.
Archangelsky, D., and M. Taitslin, ‘A logic for data description’, in A. Meyer and M. Taitslin (eds.), Symposium on Logic Foundations of Computer Science, Pereslavl-Zalessky, pages 2–11, Springer-Verlag, LNCS 363, July 1989.
Bolc, I., and A. Szalas (eds.), Time and Logic. A Computational Approach, UCL Press, 1995.
Catach, L., Les logiques multimodales, PhD thesis, Université Pierre et Marie Curie (Paris 6), March 1989.
Cerrato, C., ‘Decidability by filtrations for graded normal logics (graded modalities V)’, Studia Logica 53(1):61–73, 1994.
Chang, C., and H. Keisler, Model Theory, North-Holland Publishing Company, 1973.
Danecki, R., ‘Nondeterministic propositional dynamic logic with intersection is decidable’, in A. Skowron (ed.), Computation Theory, 5th Symposium, Zaborów, Poland, pages 34–53. LNCS 208, Springer-Verlag, 1984.
Demri, S., ‘A class of information logics with a decidable validity problem’, in W. Penczek and A. Szalas (eds.), 21st Symposium on Mathematical Foundations of Computer Sciences (MFCS'96), Kraków, pages 291–302. LNCS 1113, Springer-Verlag, 1996.
Demri, S., and E. OrŁowska, ‘Every finitely reducible logic has the finite model property with respect to the class of ♦-formulae’, Technical Report ICS-10-96, Warsaw University of Technology, Institute of Computer Science, April 1996.
Demri, S., and Ewa OrŁowska, ‘A class of modal logics with a finite model property with respect to the set of <>-formulae’, Bulletin of the Section of Logic, University of Lódź, 26(1):39–49, 1997.
Emerson, A., ‘Temporal and modal logic’, in J. van Leeuwen (ed.), Handbook of Theoretical Computer Science, pages 996–1072, Elsevier Science Publishers B.V., 1990.
FariÑas del Cerro, L., and E. Orlowska, ‘DAL — A logic for data analysis’ Theoretical Computer Science 36:251–264, 1985. Corrigendum: ibidem 47, p. 345, 1986.
Fischer, M., and R. Ladner, ‘Propositional dynamic logic of regular programs’, Journal of Computer and System Sciences 18:194–211, 1979.
Fitting, M., ‘Logics with several modal operators’, Theoria, pages 259–266, 1969.
Gargov, G., ‘Two completeness theorems in the logic for data analysis’, Technical Report 581, Institute of Computer Science, Polish Academy of Sciences, Warsaw, 1986.
Halpern, J., and Y. Moses, ‘A guide to completeness and complexity for modal logics of knowledge and belief’, Artificial Intelligence 54:319–379, 1992.
Harel, D., ‘Dynamic logic’, in D. Gabbay and F. Guenthner (eds.), Handbook of Philosophical Logic, Volume II, pages 497–604, Reidel, Dordrecht, 1984.
Mirkowska G., ‘Multimodal logics’, Technical report, Warsaw University, 1979.
Nakamura, A., ‘On a logic based on fuzzy modalities’, in 22nd International Symposium on Multiple-Valued Logic, Sendai, pages 460–466, IEEE Computer Society Press, May 1992.
Pratt, V., ‘Applications of modal logic to programming’, Studia Logica 39:257–274, 1980.
Segerberg, K., ‘A completeness theorem in the modal logic of programs’, in T. Traczyk (ed.), Universal Algebra and Applications, pages 31–46, Banach Center Publications, Volume 9 PWN — Polish Scientific Publishers, Warsaw, 1982.
Tuominen, H., ‘Dynamic logic as a uniform framework for theorem proving in intensional logic’, in M. E. Stickel (ed.), CADE-10, pages 514–527, LNCS 449, Springer-Verlag, July 1990.
Vakarelov, D., ‘Information systems, similarity relations and modal logics’, in E. Orlowska (ed.), Incomplete Information: Rough Set Analysis, Physica Verlag, Berlin, 1997, 492–550.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Demri, S., Orłowska, E. Every Finitely Reducible Logic has the Finite Model Property with Respect to the Class of ♦-Formulae. Studia Logica 62, 177–200 (1999). https://doi.org/10.1023/A:1026499402531
Issue Date:
DOI: https://doi.org/10.1023/A:1026499402531