Abstract
We present a proof of a theorem mentioned in an earlier paper “Modal environment for Boolean speculations”, devoted to the study of extended modal languages containing the so-called “window” or “sufficiency” modal operator m. The theorem states that a particular axiom system for the poly-modal logic encompassing union, intersection and complement of relations (a Boolean analog of the propositional dynamic logic of Pratt, Fischer, Ladner and Segerberg) is complete for the standard Kripke semantics. Moreover this system modally defines the standard semantics — so in the terminology of the present paper the axiomatics is adequate. On the other hand our logic has the finite model property. Thus a fragment of second order logic, rather powerful with respect to expressiveness, turns out to be decidable.
Research partially supported by the Bulgarian Committee for Science, contracts # 56, # 247.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
D. Arhangel’skij and M. Taiclin, On a Logic for Data Analysis - Abstract (in Russian), Abstracts of the 9-th All-Union Conference on Mathematical Logic, Leningrad, September, 1988.
J. van Benthem, Modal Logic and Classical Logic, Bibliopolis, Napoli, 1986.
L. Farinas del Cerro and E. Orlowsk, DAL–A Logic for Data Analysis, Theor. Comp. Sci., 35, 1985, 251–264.
G. Gargov, Two Completeness Theorems in the Logic for Data Analysis, ICS-PAS Reports # 581, Warsaw, 1986.
G. Gargov, Modal Logics of Families of Equivalence Relations (to appear).
G. Gargov, S. Passy and T. Tinchev, Modal Environment for Boolean Speculations, in: Mathematical Logic and Its Applications (ed. D. Skordev), Proc. of the 1986 Goedel Conference, Plenum Press, New York, 1987, 253–263.
V. Goranko, Modal Definability in Enriched Languages, Notre Dame Journal of Formal Logic, to appear.
V. Goranko, Definability and Completeness in Poly-Modal Logics, Ph.D. Thesis, Sofia University, January 1988 (in Bulgarian).
V. Goranko, Completeness and Incompleteness in the Bi-modal Base t(R,-R), this volume.
I.L. Humberstone, The Modal Logic of ‘All and Only’. Notre Dame Journal of Formal Logic, 28, 1987, 2, 177–188.
S. Passy and T. Tinchev, PDL with Data Constants, Inf. Proc. Lett. 20, 1985, 35–41.
W. Penczek, A Temporal Logic for Event Structures, this volume.
H. Sahlqvist. Completeness and Correspondence in First and Second Order Semantics for Modal Logic, in: S. Kanger (ed.), Proceedings of the third Scandinavian logic symposium, Uppsala 1973, North-Holland, Amsterdam, 1975.
K. Segerberg, A Completeness Theorem in the Modal Logic of Programs, Notices of the AMS, 24, 6(1977), A-552.
V. Shehtman, Two-Dimensional Modal Logics (in Russian), Matematicheskie Zametki, 23, 1978, 759–772.
D. Vakarelov, S4 and S5 Together - S4+5 (Abstract), in: Proc. of the VIII Int. Congress LMPS’87, Moscow 1987, vol. 5, part 3, 222.
D. Vakarelov, Modal Logics for Knowledge Representation Systems, to appear in: Proc. of SCT’87, Sixth Symposium on Computation Theory, Wendisch - Rietz. DDR.
D. Vakarelov, Modal Characterization of the Classes of Finite and Infinite Quasi-ordered Sets, this volume.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Plenum Press, New York
About this chapter
Cite this chapter
Gargov, G., Passy, S. (1990). A Note on Boolean Modal Logic. In: Petkov, P.P. (eds) Mathematical Logic. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-0609-2_21
Download citation
DOI: https://doi.org/10.1007/978-1-4613-0609-2_21
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-7890-0
Online ISBN: 978-1-4613-0609-2
eBook Packages: Springer Book Archive