Papers
Topics
Authors
Recent
Search
2000 character limit reached

Generalizations of the Los-Tarski Preservation Theorem

Published 18 Feb 2013 in cs.LO | (1302.4350v2)

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

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.