Abstract
We investigate properties of propositional modal logic over the classof finite structures. In particular, we show that certain knownpreservation theorems remain true over this class. We prove that aclass of finite models is defined by a first-order sentence and closedunder bisimulations if and only if it is definable by a modal formula.We also prove that a class of finite models defined by a modal formulais closed under extensions if and only if it is defined by a ♦-modal formula.
Similar content being viewed by others
References
Andréka, H., van Benthem, J., and Németi, I., 1995, "Back and forth between modal logic and classical logic," Journal of the IGPL 3(5), 685–720.
Barwise, J., 1977, "On Moschovakis closure ordinals," Journal of Symbolic Logic 42, 292–296.
van Benthem, J., 1976, "Modal correspondence theory," Ph.D. Thesis, University of Amsterdam.
van Benthem, J., 1985, Modal Logic and Classical Logic, Naples: Bibliopolis.
Fagin, R., Stockmeyer, L., and Vardi, M.Y., 1995, "On monadic NP vs monadic co-NP," Information and Computation 120, 78–92.
Gurevich, Y., 1984, "Toward logic tailored for computational complexity," pp. 175–216 in Computation and Proof Theory, M. Richter et al., eds., Berlin: Springer-Verlag.
Hennessy, M. and Milner, R., 1985, "Algebraic laws for nondeterminism and concurrency," Journal of the Association for Computing Machinery 32, 137–161.
Hodges, W., 1993, Model Theory, Cambridge: Cambridge University Press.
Sahlqvist, H., 1975, "Completeness and correspondence in the first and second order semantics for modal logic," pp. 110–143 in Proceedings of the Third Scandinavian Logic Symposium, S. Kanger, ed., Amsterdam: North-Holland.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Rosen, E. Modal Logic over Finite Structures. Journal of Logic, Language and Information 6, 427–439 (1997). https://doi.org/10.1023/A:1008275906015
Issue Date:
DOI: https://doi.org/10.1023/A:1008275906015