Abstract
Let \(\kappa ,\lambda \) be regular cardinals, \(\lambda \leqslant \kappa \), let \(\varphi \) be a sentence of the language \(\mathcal L_{\kappa ,\lambda }\) in a given signature, and let \(\vartheta (\varphi )\) express the fact that \(\varphi \) holds in a submodel, i.e., any model \(\mathfrak A\) in the signature satisfies \(\vartheta (\varphi )\) if and only if some submodel \(\mathfrak B\) of \(\mathfrak A\) satisfies \(\varphi \). It was shown in [1] that, whenever \(\varphi \) is in \(\mathcal L_{\kappa ,\omega }\) in the signature having less than \(\kappa \) functional symbols (and arbitrarily many predicate symbols), then \(\vartheta (\varphi )\) is equivalent to a monadic existential sentence in the second-order language \(\mathcal L^{2}_{\kappa ,\omega }\), and that for any signature having at least one binary predicate symbol there exists \(\varphi \) in \(\mathcal L_{\omega ,\omega }\) such that \(\vartheta (\varphi )\) is not equivalent to any (first-order) sentence in \(\mathcal L_{\infty ,\omega }\). Nevertheless, in certain cases \(\vartheta (\varphi )\) are first-order expressible. In this note, we provide several (syntactical and semantical) characterizations of the case when \(\vartheta (\varphi )\) is in \(\mathcal L_{\kappa ,\kappa }\) and \(\kappa \) is \(\omega \) or a certain large cardinal.
The work was supported by grant 16-11-10252 of Russian Science Foundation and was carried out at Steklov Mathematical Institute of Russian Academy of Sciences.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Saveliev, D.I., Shapirovsky, I.B.: On modal logics of model-theoretic relations. Studia Logica (2019, accepted). arXiv: 1804.09810
Barwise, J., Feferman, S. (eds.): Model-Theoretic Logics. Perspectives in Mathematical Logic, vol. 8. Springer, New York (1985)
Hamkins, J.D., Löwe, B.: The modal logic of forcing. Trans. Am. Math. Soc. 360(4), 1793–1817 (2008)
Montague, R.: Reduction of higher-order logic. In: Symposium on the Theory of Models, pp. 251–264. North-Holland, Amsterdam (1965)
Drake, F.R.: Set theory: an introduction to large cardinals. In: Studies in Logic and the Foundations of Mathematics, vol. 76. North-Holland, Amsterdam, Oxford, New York (1974)
Kanamori, A.: The Higher Infinite: Large Cardinals in Set Theory from Their Beginnings, 2nd edn. Springer, Heidelberg (2003)
Chang, C.C., Keisler, H.J.: Model Theory, 3rd edn. North-Holland, Amsterdam (1990)
Acknowledgement
I am grateful to N. L. Poliakov for discussions on the subject of this note and especially for his valuable help in handling the case of functional signatures in Lemma 1. I am indebted to F. N. Pakhomov for his remark about the number of functional symbols in that lemma, which leaded me to Theorem 3, and for his proposal to weaken the large cardinal property of \(\kappa \) to inaccessibility by using the downward Löwenheim–Skolem theorem for \(\mathcal L_{\kappa ,\kappa }\). I also express my appreciation to I. B. Shapirovsky who read this note and made several useful comments. Finally, I thank two (unknown to me) referees for some suggestions improving the text.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer-Verlag GmbH Germany, part of Springer Nature
About this paper
Cite this paper
Saveliev, D.I. (2019). On First-Order Expressibility of Satisfiability in Submodels. In: Iemhoff, R., Moortgat, M., de Queiroz, R. (eds) Logic, Language, Information, and Computation. WoLLIC 2019. Lecture Notes in Computer Science(), vol 11541. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-59533-6_35
Download citation
DOI: https://doi.org/10.1007/978-3-662-59533-6_35
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-59532-9
Online ISBN: 978-3-662-59533-6
eBook Packages: Computer ScienceComputer Science (R0)