Advertisement

Computational aspects of arity hierarchies

  • Henrik Imhof
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1258)

Abstract

The logics LFP (least fixed point logic), SO (second order logic), and PFP (partial fixed point logic), are known to capture the complexity classes PTIME, PH, and PSPACE respectively. We investigate hierarchies within these logics which emerge from imposing boundaries on the arities of second order variables. The computational relevance of this genuinely logical concept is under study. As for PFP, arity levels can be closely related to degree levels of PSPACE. In the case of LFP, or SO, the arity hierarchies do not seem to have natural computational counterparts. However, both strictness as well as collapse of those hierarchies would solve long open problems of complexity theory.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    S. Abiteboul and V. Vianu. Fixpoint extensions of first order logic and datalog-like languages. In Proceedings of the 4th IEEE Symposium in Logic and Computer science, pages 71–79, 1989.Google Scholar
  2. 2.
    M. Ajtai. Σ 11-formulae on finite structures. Annals of pure and applied logic, 24:1–48, 1983.Google Scholar
  3. 3.
    U. Bosse. Zur Modelltheorie der Fixpunktlogik. PhD thesis, Universität Freiburg, 1994.Google Scholar
  4. 4.
    H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer, 1995.Google Scholar
  5. 5.
    E. Grandjean. Universal quantifiers and time complexity of random access machines. Mathematical System Theory, 13:171–187, 1985.Google Scholar
  6. 6.
    M. Grohe. The Structure of Fixed-Point Logics. PhD thesis, Albert-Ludwigs Universität Freiburg, 1994.Google Scholar
  7. 7.
    Y. Gurevich and S. Shelah. Fixed point extensions of first-order logic. Annals of pure and applied logic, 32:265–280, 1986.Google Scholar
  8. 8.
    N. Immerman. Relational queries computable in polynomial time. Information and Control, 68:86–104, 1986.Google Scholar
  9. 9.
    N. Immerman. Languages that capture complexity classes. SIAM Journal of Computing, 16:760–778, 1987.Google Scholar
  10. 10.
    N. Immerman. Dspace[n k]=var[k+1]. In Proc. 6th IEEE Symp. on Structure in Complexity Theory, pages 334–340, 1991.Google Scholar
  11. 11.
    J. F. Lynch. Complexity classes and theories of finite models. Mathematical System Theory, 15:127–144, 1982.Google Scholar
  12. 12.
    J.A. Makowsky and Y.B. Pnueli. Arity vs. alternation in second order logic. Annals of Pure and Applied Logic, 78:189–202, 1996. 1993. To appear.Google Scholar
  13. 13.
    L. J. Stockmeyer. The polynomial-time hierarchy. Theoretical Computer Science, 3:1–22, 1977.Google Scholar
  14. 14.
    M. Vardi. The complexity of relational query languages. In Proceedings of 14th ACM symposium on the theory of computing, pages 137–146, 1982.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Henrik Imhof
    • 1
  1. 1.Computer Science DepartmentUniversity of Wales SwanseaUK

Personalised recommendations