Model Theory Makes Formulas Large

  • Anuj Dawar
  • Martin Grohe
  • Stephan Kreutzer
  • Nicole Schweikardt
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4596)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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)Google Scholar
  2. 2.
    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)Google Scholar
  3. 3.
    Cutland, N.J.: Computability. Cambridge University Press, Cambridge (1980)MATHGoogle Scholar
  4. 4.
    Dawar, A., Grohe, M., Kreutzer, S., Schweikardt, N.: Approximation schemes for first-order definable optimisation problems. In: Proc. LICS 2006, pp. 411–420 (2006)Google Scholar
  5. 5.
    Ebbinghaus, H.-D., Flum, J.: Finite Model Theory, 2nd edn. Springer, Heidelberg (1999)MATHGoogle Scholar
  6. 6.
    Feferman, S., Vaught, R.: The first order properties of products of algebraic systems. Fundamenta Mathematicae 47, 57–103 (1959)MATHMathSciNetGoogle Scholar
  7. 7.
    Ferrante, J., Rackoff, C.: Computational Complexity of Logical Theories. Lecture Notes in Mathematics, vol. 718. Springer, Heidelberg (1979)MATHGoogle Scholar
  8. 8.
    Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)Google Scholar
  9. 9.
    Frick, M., Grohe, M.: Deciding first-order properties of locally tree-decomposable structures. Journal of the ACM 48, 1184–1206 (2001)CrossRefMathSciNetGoogle Scholar
  10. 10.
    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)MATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    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)Google Scholar
  12. 12.
    Grohe, M., Schweikardt, N.: Comparing the succinctness of monadic query languages over finite trees. RAIRO: Theoretical Informatics and Applications (ITA) 38, 343–373 (2005)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Grohe, M., Schweikardt, N.: The succinctness of first-order logic on linear orders. Logical Methods in Computer Science 1(1:6), 1–25 (2005)MathSciNetGoogle Scholar
  14. 14.
    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)CrossRefGoogle Scholar
  15. 15.
    Hodges, W.: Model Theory. Cambridge University Press, Cambridge (1993)MATHGoogle Scholar
  16. 16.
    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)Google Scholar
  17. 17.
    Libkin, L.: Logics with counting and local properties. Transaction on Computational Logic 1, 33–59 (2000)CrossRefMathSciNetGoogle Scholar
  18. 18.
    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)Google Scholar
  19. 19.
    Rabin, M.: Decidability of second order theories and automata on infinite trees. Transactions of the American Mathematical Society 141, 1–35 (1969)MATHCrossRefMathSciNetGoogle Scholar
  20. 20.
    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)CrossRefGoogle Scholar
  21. 21.
    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)CrossRefGoogle Scholar
  22. 22.
    Tait, W.W.: A counterexample to a conjecture of Scott and Suppes. Journal of Symbolic Logic 24, 15–16 (1959)MATHCrossRefMathSciNetGoogle Scholar
  23. 23.
    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)CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Anuj Dawar
    • 1
  • Martin Grohe
    • 2
  • Stephan Kreutzer
    • 2
  • Nicole Schweikardt
    • 2
  1. 1.University of Cambridge, U.K 
  2. 2.Institut für Informatik, Humboldt Universität zu Berlin 

Personalised recommendations