More on expressibility of satisfiability in submodels and extensions
Logic
2026-05-05 v1
Abstract
We study expressibility in infinitary languages of the modal operators associated with satisfiability of sentences of these languages in submodels and extensions of models. We give a syntactic criterion for expressibility in finitary predicate languages, show that in many cases infinitary languages are closed under the operator associated with submodels, and that this is so in any language with a purely monadic signature. Finally, we prove that in finitary or strongly compact languages, the operator associated with extensions, though can be inexpressible by a single sentence, is always expressible by a universal theory, in striking contrast with the submodel case.
Cite
@article{arxiv.2605.02725,
title = {More on expressibility of satisfiability in submodels and extensions},
author = {Nikolai L. Poliakov and Denis I. Saveliev},
journal= {arXiv preprint arXiv:2605.02725},
year = {2026}
}