Abstract
In the early 1960s, to prove undecidability of monadic fragments of sublogics of the predicate modal logic \(\textbf{QS5}\) that include the classical predicate logic \(\textbf{QCl}\), Saul Kripke showed how a classical atomic formula with a binary predicate letter can be simulated by a monadic modal formula. We consider adaptations of Kripke’s simulation, which we call the Kripke trick, to various modal and superintuitionistic predicate logics not considered by Kripke. We also discuss settings where the Kripke trick does not work and where, as a result, decidability of monadic modal predicate logics can be obtained.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Andréka, H., S. Givant, and I. Németi, Decision problems for equational theories of relation algebras, in Number 604 in Memoirs of the American Mathematical Society, American Mathematical Society, 1997.
Blackburn, P., and E. Spaan, A modal perspective on the computational complexity of attribute value grammar, Journal of Logic, Language, and Information 2:129–169, 1993.
Boolos, G. S., J. P. Burgesss, and R. C. Jeffrey, Computability and Logic, 5th edn, Cambridge University Press, 2007.
Börger, E., E. Grädel, and Y. Gurevich, The Classical Decision Problem, Springer, 1997.
Chagrov, A., and M. Rybakov, How many variables does one need to prove PSPACE-hardness of modal logics?, in P. Balbiani, N.-Y. Suzuki, F. Wolter, and M. Zakharyaschev, (eds), Advances in Modal Logic 4, King’s College Publications, 2003, pp. 71–82.
Church, A., A note on the “Entscheidungsproblem”, The Journal of Symbolic Logic 1:40–41, 1936.
Corsi, G., Quantified modal logics of positive rational numbers and some related systems, Notre Dame Journal of Formal Logic 34(2):263–283, 1993.
Fitting, M., and R. L. Mendelsohn, First-Order Modal Logic, 2nd edn, Springer, 2023.
Gabbay, D., Semantical Investigations in Heyting’s Intuitionistic Logic, D. Reidel, 1981.
Gabbay, D., A. Kurucz, F. Wolter, and M. Zakharyaschev, Many-Dimensional Modal Logics: Theory and Applications, vol. 148 of Studies in Logic and the Foundations of Mathematics, Elsevier, 2003.
Gabbay, D., and V. Shehtman, Undecidability of modal and intermediate first-order logics with two individual variables, The Journal of Symbolic Logic 58(3):800–823, 1993.
Gabbay, D., and V. Shehtman, Products of modal logics, Part 1, Logic Journal of the IGPL 6(1):73–146, 1998.
Gabbay, D., V. Shehtman, and D. Skvortsov, Quantification in Nonclassical Logic, Volume 1, vol. 153 of Studies in Logic and the Foundations of Mathematics. Elsevier, 2009.
Garson, J. W., Quantification in modal logic, in D. M. Gabbay, and F. Guenthner, (eds), Handbook of Philosophical Logic, vol. 3, Springer, Dordrecht, 2001, pp. 267–323.
Garson, J. W., Modal Logic for Philosophers, 2nd edn, Cambridge University Press, 2013.
Halpern, J. Y., The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic, Artificial Intelligence 75(2):361–372, 1995.
Harrop, R., On the existence of finite models and decision procedures for propositional calculi, Mathematical Proceedings of the Cambridge Philosophical Society 54(1):1–13, 1958.
Hodkinson, I., F. Wolter, and M. Zakharyaschev, Decidable fragments of first-order temporal logics, Annals of Pure and Applied Logic 106:85–134, 2000.
Hughes, G. E., and M. J. Cresswell, A New Introduction to Modal Logic, Routledge, 1996.
Kontchakov, R., A. Kurucz, and M. Zakharyaschev, Undecidability of first-order intuitionistic and modal logics with two variables, Bulletin of Symbolic Logic 11(3):428–438, 2005.
Kremer, P., On the complexity of propositional quantification in intuitionistic logic, The Journal of Symbolic Logic 62(2):529–544, 1997.
Kripke, S. A., The undecidability of monadic modal quantification theory, Zeitschrift für Matematische Logik und Grundlagen der Mathematik 8:113–116, 1962.
Kripke, S. A., Semantical considerations on modal logic, Acta Philosophica Fennica 16:83–94, 1963.
Liu, M., A. Padmanabha, R. Ramanujam, and Y. Wang, Are bundles good deals for FOML? Information and Computation 293:105062, 2024.
Maslov, S., G. Mints, and V. Orevkov, Unsolvability in the constructive predicate calculus of certain classes of formulas containing only monadic predicate variables, Soviet Mathematics Doklady 6:918–920, 1965.
Montagna, F., The predicate modal logic of provability, Notre Dame Journal of Formal Logic 25(2):179–189, 1984.
Nerode, A., and R. A. Shore, Second order logic and first order theories of reducibility ordering, in J. Barwise, H. J. Keisler, and K. Kunen, (eds), The Kleene Symposium, North-Nolland, 1980, pp. 181–200.
Rybakov, M., On algorithmic expressivity of modal languages with a single monadic predicate letter, Logical Investigations 9:179–201, 2002. in Russian.
Rybakov, M., Complexity of intuitionistic propositional logic and its fragments, Journal of Applied Non-Classical Logics 18(2–3):267–292, 2008.
Rybakov, M., Undecidability of modal logics of a unary predicate, Logical Investigations 23:60–75, 2017. in Russian.
Rybakov, M., Computational complexity of theories of a binary predicate with a small number of variables, Doklady. Mathematics 106:458–461, 2022.
Rybakov, M., Predicate counterparts of modal logics of provability: high undecidability and Kripke incompleteness. To appear in Logic Journal of the IGPL, https://doi.org/10.1093/jigpal/jzad002.
Rybakov, M., and D. Shkatov, A recursively enumerable Kripke complete first-order logic not complete with respect to a first-order definable class of frames, in G. Metcalfe, G. Bezhanishvili, G. D’Agostino, and T. Studer, (eds), Advances in Modal Logic 12, College Publications, 2018, pp. 531–540.
Rybakov, M., and D. Shkatov, Complexity of finite-variable fragments of propositional modal logics of symmetric frames, Logic Journal of the IGPL 27(1):60–68, 2019.
Rybakov, M., and D. Shkatov, Undecidability of first-order modal and intuitionistic logics with two variables and one monadic predicate letter, Studia Logica 107(4):695–717, 2019. Corrected version available at arXiv:1706.05060.
Rybakov, M., and D. Shkatov, Algorithmic properties of first-order modal logics of finite Kripke frames in restricted languages, Journal of Logic and Computation 30(7):1305–1329, 2020.
Rybakov, M., and D. Shkatov, Algorithmic properties of first-order modal logics of the natural number line in restricted languages, in N. Olivetti, R. Verbrugge, S. Negri, and G. Sandu, (eds), Advances in Modal Logic, volume 13. College Publications, 2020.
Rybakov, M., and D. Shkatov, Algorithmic properties of first-order superintuitionistic logics of finite Kripke frames in restricted languages, Journal of Logic and Computation 31(2):494–522, 2021.
Rybakov, M., and D. Shkatov, Algorithmic properties of first-order modal logics of linear Kripke frames in restricted languages, Journal of Logic and Computation 31(5):853–870, 2021.
Rybakov, M., and D. Shkatov, Complexity of finite-variable fragments of products with non-transitive modal logics, Journal of Logic and Computation 32(5):853–870, 2022.
Rybakov, M., and D. Shkatov, Complexity of finite-variable fragments of propositional temporal and modal logics of computation, Theoretical Computer Science 925:45–60, 2022.
Rybakov, M., and D. Shkatov, Complexity function and complexity of validity of modal and superintuitionistic propositional logics, Journal of Logic and Computation 33(7):1566–1595, 2023.
Rybakov, M., and D. Shkatov, Algorithmic properties of modal and superintuitionistic logics of monadic predicates over finite Kripke frames. To appear in Journal of Logic and Computationhttps://doi.org/10.1093/logcom/exad078.
Shehtman, V., On Kripke completeness of modal predicate logics around quantified K5, Annals of Pure and Applied Logic 174(2):103202, 2023.
Shehtman, V., and D. Shkatov, On one-variable fragments of modal predicate logics, in Proceedings of SYSMICS2019, Institute for Logic, Language and Computation, University of Amsterdam, 2019, pp. 129–132.
Shehtman, V., and D. Shkatov, Kripke (in)completeness of predicate modal logics with axioms of bounded alternativity, in First-Order Modal and Temporal Logics: State of the Art and Perspectives (FOMTL 2023), ESSLLI, 2023, pp. 26–29.
Shehtman, V., and D. Shkatov, Semiproducts, products, and modal predicate logics: some examples. To appear in Doklady. Mathematics. https://doi.org/10.1134/S1064562423701296.
Skvortsov, D., The superintuitionistic predicate logic of finite Kripke frames is not recursively axiomatizable, The Journal of Symbolic Logic 70(2):451–459, 2005.
Spaan, E., Complexity of Modal Logics, PhD Thesis, University of Amsterdam, 1993.
Surányi, J., Zur Reduktion des Entscheidungsproblems des logischen Funktioskalküls, Mathematikai és Fizikai Lapok 50:51–74, 1943.
Tanaka, Y., and H. Ono, Rasiowa-Sikorski lemma and Kripke completeness of predicate and infinitary modal logics, in M. Zakharyaschev, K. Segerberg, M. de Rijke, and H. Wansing, (eds), Advances in Modal Logic, volume 2. CSLI Publications, 2001, pp. 419–437.
Tarski, A., and S. Givant, A Formalization of Set Theory without Variables, vol. 41 of American Mathematical Society Colloquium Publications, American Mathematical Society, 1987.
Trakhtenbrot, B. A., The impossibility of an algorithm for the decidability problem on finite classes, Doklady AN SSSR, 1950. in Russian; English translation in [54].
Trakhtenbrot, B. A., Impossibility of an algorithm for the decision problem in finite classes, American Mathematica Society Translations 23:1–5, 1963.
Urquhart, A., Decidability and the finite model property, Journal of Philosophical Logic 10(3):367–370, 1981.
van Dalen, D., Logic and Structure, 5th edn, Springer, 2013.
Visser, A., A propositional logic with explicit fixed points, Studia Logica 40:155–175, 1981.
Wolter, F., and M. Zakharyaschev, Decidable fragments of first-order modal logics, The Journal of Symbolic Logic 66:1415–1438, 2001.
Acknowledgements
We are grateful to anonymous reviewers for helping to improve the paper. Work on this paper was supported by the Russian Science Foundation, Project 21-18-00195.
Funding
Open access funding provided by University of the Witwatersrand.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Presented by Heinrich Wansing; Received January 23, 2023.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Rybakov, M., Shkatov, D. Variations on the Kripke Trick. Stud Logica (2024). https://doi.org/10.1007/s11225-023-10093-y
Received:
Published:
DOI: https://doi.org/10.1007/s11225-023-10093-y