A Generalization of the {\L}o\'s-Tarski Preservation Theorem - Dissertation Summary

Abstract We present new parameterized preservation properties that provide for each natural number k, semantic characterizations of the ∃ k ∀ ⁎ and ∀ k ∃ ⁎ prefix classes of first order logic sentences, over the class of all structures and for arbitrary finite vocabularies. These properties, that we call preservation under substructures modulo k-cruxes and preservation under k-ary covered extensions respectively, correspond exactly to the classical properties of preservation under substructures and preservation under extensions, when k equals 0. As a consequence, we get a parameterized generalization of the Łoś–Tarski preservation theorem for sentences, in both its substructural and extensional forms. We call our characterizations collectively the generalized Łoś–Tarski theorem for sentences. We generalize this theorem to theories, by showing that theories that are preserved under k-ary covered extensions are characterized by theories of ∀ k ∃ ⁎ sentences, and theories that are preserved under substructures modulo k-cruxes, are equivalent, under a well-motivated model-theoretic hypothesis, to theories of ∃ k ∀ ⁎ sentences. In contrast to existing preservation properties in the literature that characterize the Σ 2 0 and Π 2 0 prefix classes of FO sentences, our preservation properties are combinatorial and finitary in nature, and stay non-trivial over finite structures as well.