Abstract
Gaifman’s locality theorem states that every first-order sentence is equivalent to a local sentence. We show that there is no elementary bound on the length of the local sentence in terms of the original.
The classical Łoś-Tarski theorem states that every first-order sentence preserved under extensions is equivalent to an existential sentence. We show that there is no elementary bound on the length of the existential sentence in terms of the original. Recently, variants of the Łoś-Tarski theorem have been proved for certain classes of finite structures, among them the class of finite acyclic structures and more generally classes of structures of bounded tree width. Our lower bound also applies to these variants.
We further prove that a version of the Feferman-Vaught theorem based on a restriction by formula length necessarily entails a non-elementary blow-up in formula size.
All these results are based on a similar technique of encoding large numbers by trees of small height in such a way that small formulas can speak about these numbers. Notably, our lower bounds do not apply to restrictions of the results to structures of bounded degree. For such structures, we obtain elementary upper bounds in all cases. However, even there we can prove at least doubly exponential lower bounds.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Atserias, A., Dawar, A., Grohe, M.: Preservation under extensions on well-behaved finite structures. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1437–1449. Springer, Heidelberg (2005)
Compton, K., Henson, C.W.: A uniform method for proving lower bounds on the computational complexity of logical theories. In: Abramsky, S., Gabbay, D.M., Maibaum, T. (eds.) Handbook of Logic in Computer Science. Logic and Algebraic Methods, vol. 5, pp. 129–216. Oxford University Press, Oxford (2000)
Cutland, N.J.: Computability. Cambridge University Press, Cambridge (1980)
Dawar, A., Grohe, M., Kreutzer, S., Schweikardt, N.: Approximation schemes for first-order definable optimisation problems. In: Proc. LICS 2006, pp. 411–420 (2006)
Ebbinghaus, H.-D., Flum, J.: Finite Model Theory, 2nd edn. Springer, Heidelberg (1999)
Feferman, S., Vaught, R.: The first order properties of products of algebraic systems. Fundamenta Mathematicae 47, 57–103 (1959)
Ferrante, J., Rackoff, C.: Computational Complexity of Logical Theories. Lecture Notes in Mathematics, vol. 718. Springer, Heidelberg (1979)
Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)
Frick, M., Grohe, M.: Deciding first-order properties of locally tree-decomposable structures. Journal of the ACM 48, 1184–1206 (2001)
Frick, M., Grohe, M.: The complexity of first-order and monadic second-order logic revisited. Annals of Pure and Applied Logic 130, 3–31 (2004)
Gaifman, H.: On local and non-local properties. In: Stern, J. (ed.) Proceedings of the Herbrand Symposium, Logic Colloquium ‘81, pp. 105–135. North-Holland, Amsterdam (1982)
Grohe, M., Schweikardt, N.: Comparing the succinctness of monadic query languages over finite trees. RAIRO: Theoretical Informatics and Applications (ITA) 38, 343–373 (2005)
Grohe, M., Schweikardt, N.: The succinctness of first-order logic on linear orders. Logical Methods in Computer Science 1(1:6), 1–25 (2005)
Gurevich, Y.: Toward logic tailored for computational complexity. In: Richter, M., et al. (eds.) Computation and Proof Theory. Lecture Notes in Mathematics, vol. 1104, pp. 175–216. Springer, Heidelberg (1984)
Hodges, W.: Model Theory. Cambridge University Press, Cambridge (1993)
Libkin, L.: On forms of locality over finite models. In: Proceedings of the 12th IEEE Symposium on Logic in Computer Science, pp. 204–215. IEEE Computer Society Press, Los Alamitos (1997)
Libkin, L.: Logics with counting and local properties. Transaction on Computational Logic 1, 33–59 (2000)
Pan, G., Vardi, M.: Fixed-parameter hierarchies inside pspace. In: Proceedings of the 21th IEEE Symposium on Logic in Computer Science, pp. 27–36. IEEE Computer Society Press, Los Alamitos (2006)
Rabin, M.: Decidability of second order theories and automata on infinite trees. Transactions of the American Mathematical Society 141, 1–35 (1969)
Rossman, B.: Existential positive types and preservation under homomorphisisms. In: 20th IEEE Symposium on Logic in Computer Science, pp. 467–476. IEEE Computer Society Press, Los Alamitos (2005)
Stockmeyer, L., Meyer, A.: Word problems requiring exponential time. In: Proceedings of the 5th ACM Symposium on Theory of Computing, pp. 1–9. ACM Press, New York (1973)
Tait, W.W.: A counterexample to a conjecture of Scott and Suppes. Journal of Symbolic Logic 24, 15–16 (1959)
Thatcher, J., Wright, J.: Generalised finite automata theory with an application to a decision problem of second-order logic. Mathematical Systems Theory 2, 57–81 (1968)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dawar, A., Grohe, M., Kreutzer, S., Schweikardt, N. (2007). Model Theory Makes Formulas Large. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds) Automata, Languages and Programming. ICALP 2007. Lecture Notes in Computer Science, vol 4596. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73420-8_78
Download citation
DOI: https://doi.org/10.1007/978-3-540-73420-8_78
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73419-2
Online ISBN: 978-3-540-73420-8
eBook Packages: Computer ScienceComputer Science (R0)