On first-order expressibility of satisfiability in submodels
Abstract
Let be regular cardinals, , let be a sentence of the language in a given signature, and let express the fact that holds in a submodel, i.e., any model in the signature satisfies if and only if some submodel of satisfies . It was shown in [1] that, whenever is in in the signature having less than functional symbols (and arbitrarily many predicate symbols), then is equivalent to a monadic existential sentence in the second-order language , and that for any signature having at least one binary predicate symbol there exists in such that is not equivalent to any (first-order) sentence in . Nevertheless, in certain cases are first-order expressible. In this note, we provide several (syntactical and semantical) characterizations of the case when is in and is or a certain large cardinal.
Keywords
Cite
@article{arxiv.1903.04993,
title = {On first-order expressibility of satisfiability in submodels},
author = {Denis I. Saveliev},
journal= {arXiv preprint arXiv:1903.04993},
year = {2019}
}