Advertisement

Capturing complexity classes with Lindström quantifiers

  • J. A. Makowsky
Invited Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 841)

Abstract

We report on our efforts of unifying Descriptive Complexity Theory and Logic in the framework of axiomatic definitions of both Logics and Complexity Classes. (Joint work with Y.B. Pnueli)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BF85]
    J. Barwise and S. Feferman, editors. Model-Theoretic Logics. Perspectives in Mathematical Logic. Springer Verlag, 1985.Google Scholar
  2. [Bus88]
    J.F. Buss. Alternations and space-bounded computations. Journal of Computer and System Sciences, 36:351–378, 1988.Google Scholar
  3. [Daw94]
    A. Dawar. Generalized quantifiers and logical reducibilities. Logic and Computation, XX:xx–yy, 1994, to appear.Google Scholar
  4. [Fag74]
    R. Fagin. Generalized first-order spectra and polynomial time recognizable sets. In R. Karp, editor, Complexity of Computation, volume 7 of American Mathematical Society Proc, pages 27–41. Society for Industrial and Applied Mathematics, 1974.Google Scholar
  5. [Gro94]
    M. Grohe. Linström-quantifiers that capture fixed-point logics. Preprint, 1994.Google Scholar
  6. [Gur88]
    Y. Gurevich. Logic and the challenge of computer science. In E. Börger, editor, Trends in Theoretical Computer Science, Principles of Computer Science Series, chapter 1. Computer Science Press, 1988.Google Scholar
  7. [Hel89]
    L. Hella. Definability hierarchies of generalized quantifiers. Annals of Pure and Applied Logic, 43(3):235–271, 1989.Google Scholar
  8. [Hel92]
    Lauri Hella. Logical hierarchies in PTIME. In LiCS'92, pages 360–368. IEEE, 1992.Google Scholar
  9. [Imm87]
    N. Immerman. Languages that capture complexity classes. SIAM Journal on Computing, 16(4):760–778, Aug 1987.Google Scholar
  10. [Imm89]
    N. Immerman. Expressibility and parallel complexity. SIAM Journal on Computing, 18:625–638, 1989.Google Scholar
  11. [MP93]
    J.A. Makowsky and Y.B. Pnueli. Computable quantifiers and logics over finite structures. To appear in ‘Quantifiers: Generalizations, extensions and and variants of elementary logic', Kluwer Academic Publishers, preliminary version TR 768, Department of Computer Science, Technion-Israel Institute of Technology, Haifa, Israel, 1993.Google Scholar
  12. [MP94]
    J.A. Makowsky and Y.B. Pnueli. Oracles and quantifiers. In CSL'93, volume XX of Lecture Notes in Computer Science, pages xx–yy. Springer, 1994, to appear.Google Scholar
  13. [Sip82]
    M. Sipser. On relativization and the existence of complete sets. In ICALP'82, volume 140 of Lecture Notes in Computer Science, pages 523–531. Springer, 1982.Google Scholar
  14. [Ste91]
    I.A. Stewart. Comparing the expressibility of languages formed using NP-complete operators. Journal of Logic and Computation, 1(3):305–330, 1991.Google Scholar
  15. [Ste93a]
    I.A. Stewart. Logical characterizations of bounded query classes I: Logspace oracle machines. Fundamenta Informaticae, 18:65–92, 1993.Google Scholar
  16. [Ste93b]
    I.A. Stewart. Logical characterizations of bounded query classes II: Polynomial-time oracle machines. Fundamenta Informaticae, 18:93–105, 1993.Google Scholar
  17. [Sto87]
    L. Stockmeyer. Classifying the computational complexity of problems. Journal of Symbolic Logic, 52(1):1–43, 1987.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • J. A. Makowsky
    • 1
  1. 1.Department of Computer ScienceTechnion-Israel Institute of TechnologyHaifaIsrael

Personalised recommendations