Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
166 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Generalizations of the Los-Tarski Preservation Theorem (1302.4350v2)

Published 18 Feb 2013 in cs.LO

Abstract: We present new preservation theorems that semantically characterize the $\existsk \forall*$ and $\forallk \exists*$ prefix classes of first order logic, for each natural number $k$. Unlike preservation theorems in the literature that characterize the $\exists* \forall*$ and $\forall* \exists*$ prefix classes, our theorems relate the count of quantifiers in the leading block of the quantifier prefix to natural quantitative properties of the models. As special cases of our results, we obtain the classical Los-Tarski preservation theorem for sentences in both its extensional and substructural versions. For arbitrary finite vocabularies, we also generalize the extensional version of the Los-Tarski preservation theorem for theories. We also present an interpolant-based approach towards these results. Finally, we present partial results towards generalizing to theories, the substructural version of the Los-Tarski theorem and in the process, we give a preservation theorem that provides a semantic characterization of $\Sigma0_n$ theories for each natural number $n$.

Citations (1)

Summary

We haven't generated a summary for this paper yet.