Abstract
Two important classic results about modal expressivity are the Characterization and Definability theorems. We develop a general theory for modal logics below first order (in terms of expressivity) which exposes the following result: Characterization and Definability theorems hold for every (reasonable) modal logic whose ω models have the Hennessy-Milner property. The results are presented in a general version which is relativized to classes of models.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge University Press, Cambridge (2001)
Kamp, H.: Tense Logic and the Theory of Linear Order. PhD thesis, University of Califormia, Los Angeles (1968)
Goranko, V., Passy, S.: Using the universal modality: Gains and questions. Journal of Logic and Computation 2(1), 5–30 (1992)
de Rijke, M.: The modal logic of inequality. Journal of Symbolic Logic 57, 566–584 (1992)
Kozen, D.: Results on the propositional μ-calculus. Theoretical Computer Science 27(3), 333–354 (1983)
Sangiorgi, D.: On the origins of bisimulation and coinduction. ACM Trans. Program. Lang. Syst. 31(4), 1–41 (2009)
van Benthem, J.: Modal Correspondence Theory. PhD thesis, Universiteit van Amsterdam, Instituut voor Logica en Grondslagenonderzoek van Exacte Wetenschappen (1976)
Chang, C.C., Keisler, H.J.: Model Theory. Studies in Logic and the Foundations of Mathematics, vol. 73. Elsevier Science B.V., Amsterdam (1973)
Kurtonina, N., de Rijke, M.: Simulating without negation. Journal of Logic and Computation 7, 503–524 (1997)
Kurtonina, N., de Rijke, M.: Bisimulations for temporal logic. Journal of Logic, Language and Information 6, 403–425 (1997)
Keisler, H.J.: The ultraproduct construction. In: Proceedings of the Ultramath Conference, Pisa, Italy (2008)
Hansen, H.H.: Monotonic modal logics. Master’s thesis, ILLC, University of Amsterdam (2003)
Carreiro, F.: Characterization and definability in modal first-order fragments. Master’s thesis, Universidad de Buenos Aires (2010), arXiv:1011.4718
Areces, C., Figueira, D., Figueira, S., Mera, S.: Expressive power and decidability for memory logics. In: Hodges, W., de Queiroz, R. (eds.) Logic, Language, Information and Computation. LNCS (LNAI), vol. 5110, pp. 56–68. Springer, Heidelberg (2008)
Areces, C., Figueira, D., Figueira, S., Mera, S.: The expressive power of memory logics. Review of Symbolic Logic (to appear)
Rosen, E.: Modal logic over finite structures. Journal of Logic, Language and Information 6, 95–27 (1995)
Kurtonina, N., de Rijke, M.: Classifying description logics. In: Brachman, R.J., Donini, F.M., Franconi, E., Horrocks, I., Levy, A.Y., Rousset, M.C. (eds.) Description Logics. URA-CNRS, vol. 410 (1997)
Otto, M.: Elementary proof of the van Benthem-Rosen characterisation theorem. Technical Report 2342, Department of Mathematics, Technische Universität Darmstadt (2004)
Hollenberg, M.: Logic and Bisimulation. PhD thesis, Philosophical Institute, Utrecht University (1998)
Areces, C., Gorín, D.: Coinductive models and normal forms for modal logics. Journal of Applied Logic (2010) (to appear)
Blackburn, P., van Benthem, J., Wolter, F.: Handbook of Modal Logic. Studies in Logic and Practical Reasoning, vol. 3. Elsevier Science Inc., New York (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Carreiro, F. (2011). On Characterization, Definability and ω-Saturated Models. In: Cerone, A., Pihlajasaari, P. (eds) Theoretical Aspects of Computing – ICTAC 2011. ICTAC 2011. Lecture Notes in Computer Science, vol 6916. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23283-1_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-23283-1_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23282-4
Online ISBN: 978-3-642-23283-1
eBook Packages: Computer ScienceComputer Science (R0)