Skip to main content
SpringerLink
Log in

Generalized Quantifiers, an Introduction

  • Conference paper
  • First Online:
Book cover Generalized Quantifiers and Computation (ESSLLI 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1754))

Included in the following conference series:

Abstract

We review recent work in the field of generalized quantifiers on finite models. We give an idea of the methods that are available in this area. Main emphasis is on definability issues, such as whether there is a logic for the PTIME properties of unordered finite models

Reprinted with permission from the Bulletin of the European Association for Theo- retical Computer Science, 62 (1997), 115–136.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A.V. Aho and J.D. Ullman, Universality of data retrieval languages, Sixth ACM Symposium on Principles of Programming Languages, 1979, 110–117.

    Google Scholar 

  2. J. Cai, M. Fürer and N. Immerman, An Optimal Lower Bound on the Number of Variables for Graph Identification, Combinatorica 12:4 (1992), 389–410.

    Article  MATH  MathSciNet  Google Scholar 

  3. A. Chandra and D. Harel. Structure and complexity of relational queries. Journal of Computer and System Sciences, 25:99–128, 1982.

    Article  MATH  Google Scholar 

  4. E.F. Codd, Relational completeness of database sublanguages, in: Database Systems (R. Rustin, ed.), Prentice-Hall, 1972, 65–98.

    Google Scholar 

  5. E. Dahlhaus, Skolem normal forms concerning the least fixpoint, in: Computation theory and logic (E. Börger, ed.), 101–106, Lecture Notes in Comput. Sci., 270, Springer, Berlin-New York, 1987.

    Google Scholar 

  6. A. Dawar, Generalized quantifiers and logical reducibilities, Journal of Logic and Computation, 5(1995), 213–226.

    Article  MATH  MathSciNet  Google Scholar 

  7. A. Dawar and E. Grädel, Generalized quantifiers and 0–1 laws, Proc. 10th IEEE Symp. on Logic in Computer Science, 1995, 54–64.

    Google Scholar 

  8. R. Fagin, The number of finite relational structures, Discrete Mathematics 19(1977), 17–21.

    Article  MATH  MathSciNet  Google Scholar 

  9. R. Fagin, Generalized first-order spectra and polynomial-time recognizable sets, in: Complexity of Computation (R. Karp, ed.) SIAM-AMS Proc. 7, 1974, 27–41.

    Google Scholar 

  10. M. Grohe and L. Hella, A double arity hierarchy theorem for transitive closure logic, Archive for Mathematical Logic, 35(3): 157–172, 1996.

    MATH  MathSciNet  Google Scholar 

  11. Y. Gurevich. Toward logic tailored for computational complexity. In M. M. Richter et al., editor, Computation and Proof Theory, Lecture Notes in Mathematics 1104, pages 175–216. Springer-Verlag, 1984.

    Google Scholar 

  12. Y. Gurevich. Logic and the challenge of computer science. In E. Börger, editor, Current trends in theoretical computer science, pages 1–57. Computer Science Press, 1988.

    Google Scholar 

  13. Y. Gurevich, Zero-one laws, EATCS Bulletin 46 (1992), 90–106.

    MATH  Google Scholar 

  14. L. Hella, Logical hierarchies in PTIME, Information and Computation 129: 1–19, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  15. L. Hella and G. Sandu, Partially ordered connectives and finite graphs, in: Quantifiers: Logics, models and computation (M. Krynicki, M. Mostowski and L. Szczerba, eds.), vol II, Kluwer Academic Publishers 1995, 79–88.

    Google Scholar 

  16. L. Hella, Ph. Kolaitis and K. Luosto, Almost everywhere equivalence of logics infinite model theory, Bulletin of Symbolic Logic 2(4), 1996, 422–443.

    Article  MATH  MathSciNet  Google Scholar 

  17. L. Hella, K. Luosto and J. Väänänen, The hierarchy theorem for generalized quantifiers. Journal Symbolic Logic 61 (1996), no. 3, 802–817.

    Article  MATH  Google Scholar 

  18. L. Hella, J. Väänänen and D. Westerståhl, Definability of polyadic lifts of generalized quantifiers, Journal of Logic, Language and Information 6 (1997), no. 3, 305–335.

    Article  MATH  MathSciNet  Google Scholar 

  19. N. Immerman, Relational queries computable in polynomial time, Information and Control 68 (1986), 86–104.

    Article  MATH  MathSciNet  Google Scholar 

  20. N. Immerman, Languages that capture complexity classes, SIAM J. Comput. 16, No. 4 (1987), 760–778.

    Article  MATH  MathSciNet  Google Scholar 

  21. P. Lindström, First order predicate logic with generalized quantifiers, Theoria 32 (1966), 186–195.

    MathSciNet  Google Scholar 

  22. A. Mostowski, On a generalization of quantifiers. Fundamenta Mathematicae 44 (1957) 12–36.

    MathSciNet  Google Scholar 

  23. J. Nurmonen, On winning strategies with unary quantifiers, Journal of Logic and Computation, 6(6): 779–798, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  24. M. Vardi, Complexity of relational query languages, 14th ACM STOC Symposium (1982), 137–146.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Helsinki, P.O.Box 4, Yliopistonkatu 5, 00014, Finland

    Jouko Väänänen

Authors
  1. Jouko Väänänen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics, University of Helsinki, P.O. Box 4, Yliopistonkatu 5, 00014, Helsinki, Finland

    Jouko Väänänen

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Väänänen, J. (1999). Generalized Quantifiers, an Introduction. In: Väänänen, J. (eds) Generalized Quantifiers and Computation. ESSLLI 1997. Lecture Notes in Computer Science, vol 1754. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46583-9_1

Download citation

  • DOI: https://doi.org/10.1007/3-540-46583-9_1

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66993-7

  • Online ISBN: 978-3-540-46583-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation