English

On first-order expressibility of satisfiability in submodels

Logic 2019-07-22 v3

Abstract

Let κ,λ\kappa,\lambda be regular cardinals, λκ\lambda\le\kappa, let φ\varphi be a sentence of the language Lκ,λ\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 A\mathfrak A in the signature satisfies ϑ(φ)\vartheta(\varphi) if and only if some submodel B\mathfrak B of A\mathfrak A satisfies φ\varphi. It was shown in [1] that, whenever φ\varphi is in Lκ,ω\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 Lκ,ω2\mathcal L^{2}_{\kappa,\omega}, and that for any signature having at least one binary predicate symbol there exists φ\varphi in Lω,ω\mathcal L_{\omega,\omega} such that ϑ(φ)\vartheta(\varphi) is not equivalent to any (first-order) sentence in L,ω\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 Lκ,κ\mathcal L_{\kappa,\kappa} and κ\kappa is ω\omega 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}
}
R2 v1 2026-06-23T08:05:50.713Z