Expressive power of unary counters

  • Michael Benedikt
  • H. Jerome Keisler
Contributed Papers Session 5: Logic and Databases II
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1186)

Abstract

We compare the expressive power on finite models of two extensions of first order logic L with equality. L(Ct) is formed by adding an operator count{x:φ}, which builds a term of sort ℕ that counts the number of elements of the finite model satisfying a formula ϕ. Our main result shows that the stronger operator count{t(x): ϕ}, where t(x) is a term of sort ℕ, cannot be expressed in L(Ct). That is, being able to count elements does not allow one to count terms.

This paper also continues our interest in new proof techniques in database theory. The proof of the unary counter combines a number of model-theoretic techniques that give powerful tools for expressivity bounds: in particular, we discuss here the use of indiscernibles, the Paris-Harrington form of Ramsey's theorem, and nonstandard models of arithmetic.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    S. Abiteboul, R. Hull, V. Vianu. Foundations of Databases. Addison-Wesley, 1995.Google Scholar
  2. 2.
    M. Benedikt, T. Griffin, and L. Libkin Verifiable properties of database transactions. In Proceedings of 15th ACM Symposium on Principles of Database Systems, pages 117–128, Montreal Canada, June 1996.Google Scholar
  3. 3.
    M. Benedikt, G. Dong, L. Libkin, L. Wong. Relational expressive power of constraint query languages. In Proceedings of 15th ACM Symposium on Principles of Database Systems, pages 5–17, Montreal Canada, June 1996.Google Scholar
  4. 4.
    M. Benedikt and L. Libkin. On the structure of queries in constraint query languages. In Proceedings of 11th IEEE Symposium on Logic in Computer Science, New Brunswick, New Jersey 1996.Google Scholar
  5. 5.
    P. Buneman, S. Naqvi, V. Tannen, L. Wong. Principles of programming with complex objects and collection types. Theoretical Computer Science, 149(1):3–48, 1995.Google Scholar
  6. 6.
    C. C. Chang and H. Jerome Keisler. Model Theory. North-Holland Elsevier 1990.Google Scholar
  7. 7.
    H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer Verlag, 1995.Google Scholar
  8. 8.
    A. Ehrenfeucht. An application of games to the completeness problem for formalized theories. Fundamentae Mathematicae, 49:129–141, 1961.Google Scholar
  9. 9.
    K. Etessami. Counting quantifiers, successor relations, and logarithmic space. In Proceedings of 10th IEEE Conference on Structure in Complexity Theory May 1995, pages 2–11.Google Scholar
  10. 10.
    K. Etassami and N. Immerman. Tree canonization and transitive closure. Tenth Annual IEEE Symposium on Logic in Computer Science. 1995.Google Scholar
  11. 11.
    H. Gaifman. On local and nonlocal properties. In J. Stem, editor, Logic Colloquium '81, pages 105–135. North-Holland, 1982.Google Scholar
  12. 12.
    Gradel, E. and Otto, M. Inductive definability with counting on finite structures. In E. Borger (ed.), Computer Science Logic, LNCS 702 Springer (1993), 231–247.Google Scholar
  13. 13.
    Erich Gradel and Yuri Gurevich. Metafinite model theory. In Logic and Computational Complexity, International Workshop LCC'94 Indianapolis, IN,313–366.Google Scholar
  14. 14.
    T. Griffin and H. Trickey. Integrity Maintenance in a Telecommunications Switch. In IEEE Data Engineering Bulletin V. 17, No. 2., June 1994.Google Scholar
  15. 15.
    T. Griffin, H. Trickey, and C. Tuckey. Update constraints for relational databases. Technical Memorandum AT&T Bell Laboratories, 1992Google Scholar
  16. 16.
    S. Grumbach and C. Tollu. On the expressive power of counting. Fourth International Conference on Database Theory. 1992.Google Scholar
  17. 17.
    N. Immerman, E.S. Lander. Describing graphs: a first-order approach to graph canonization. In Complexity Theory Retrospective, pp. 59–81. Springer, 1990.Google Scholar
  18. 18.
    C. Karp. Finite quantifier equivalence. In The Theory of Models, edited by J. Addison, L. Henkin, and A. Tarski, North-Holland 1965, 407–412.Google Scholar
  19. 19.
    L. Libkin and L. Wong. New techniques for studying set languages, bag languages and aggregate functions. In Proceedings of the 13th Conference on Principles of Database Systems, Minneapolis MN, May 1994, pages 155–166.Google Scholar
  20. 20.
    L. Libkin and L. Wong. On representation and querying incomplete information in databases with bags. Information Processing Letters 56 (1995), 209–214.Google Scholar
  21. 21.
    J. Paredaens, J. Van den Bussche, and D. Van Gucht. First-order queries on finite structures over the reals. In Proceedings of 10th IEEE Symposium on Logic in Computer Science, San Diego, California, pages 79–87, 1995.Google Scholar
  22. 22.
    X. Qian. An effective method for integrity constraint simplification. In Fourth International Conference on Data Engineering, 1988.Google Scholar
  23. 23.
    X. Qian. The Deductive Synthesis of Database Transactions. PhD thesis, Stanford University, 1989.Google Scholar
  24. 24.
    O.Belagradek, A. Stolboushkin, M. Tsaitlin. On order-generic queries. Manuscript. To appear.Google Scholar
  25. 25.
    V. Tannen, Tutorial: Languages for collection types, in “Proceedings of 13th Symposium on Principles of Database Systems,” Minneapolis, May 1994.Google Scholar
  26. 26.
    J. Van Den Bussche and M. Otto. First-order queries on databases embedded in an infinite. structure. Information Processing Letters, to appear.Google Scholar

Copyright information

© Springer-Verlag 1997

Authors and Affiliations

  • Michael Benedikt
    • 1
  • H. Jerome Keisler
    • 2
  1. 1.Bell LaboratoriesNapervilleUSA
  2. 2.University of WisconsinMadison

Personalised recommendations