Abstract
Known results on global definability in basic modal logic are generalized in the following sense. A class of Kripke models is usually called modally definable if there is a set of modal formulas such that a class consists exactly of models on which every formula of that set is globally true, i. e. universally quantified standard translations of these formulas to the corresponding first order language are true. Here, the notion of definability is extended to existentially quantified translations of modal formulas – a class is called modally ∃-definable if there is a set of modal formulas such that a class consists exactly of models in which every formula of that set is satisfiable. A characterization result is given in usual form, in terms of closure conditions on such 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.
References
Blackburn, J., de Rijke, M., Venema, Y.: Modal Logic. Cambridge University Press (2001)
Chang, C.C., Keisler, H.J.: Model Theory. Elsevier (1990)
Hollenberg, M.: Characterizations of Negative Definability in Modal Logic. Studia Logica 60, 357–386 (1998)
de Rijke, M., Sturm, H.: Global Definability in Basic Modal Logic. In: Wansing, H. (ed.) Essays on Non-classical Logic, pp. 111–133. World Scientific Publishers (2001)
Venema, Y.: Derivation rules as anti-axioms in modal logic. Journal of Symbolic Logic 58, 1003–1034 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Perkov, T. (2012). Towards a Generalization of Modal Definability. In: Lassiter, D., Slavkovik, M. (eds) New Directions in Logic, Language and Computation. ESSLLI ESSLLI 2010 2011. Lecture Notes in Computer Science, vol 7415. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31467-4_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-31467-4_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31466-7
Online ISBN: 978-3-642-31467-4
eBook Packages: Computer ScienceComputer Science (R0)