Skip to main content

The polynomial hierarchy and intuitionistic Bounded Arithmetic

  • Conference paper
  • First Online:
Structure in Complexity Theory

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

  • 158 Accesses

Abstract

Intuitionistic theories IS i2 of Bounded Arithmetic are introduced and it is shown that the definable functions of IS i2 are precisely the □ pi functions of the polynomial hierarchy. This is an extension of earlier work on the classical Bounded Arithmetic and was first conjectured by S. Cook. In contrast to the classical theories of Bounded Arithmetic where Σ bi -definable functions are of interest, our results for intuitionistic theories concern all the definable functions.

The method of proof uses □ pi -realizability which is inspired by the recursive realizability of S.C. Kleene [3] and D. Nelson [5]. It also involves polynomial hierarchy functionals of finite type which are introduced in this paper.

Research supported in part by NSF Grant DMS 85-11465.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. S.R. Buss, Bounded Arithmetic, Ph.D. dissertation, Princeton University, 1985.

    Google Scholar 

  2. S.R. Buss, "The polynomial hierarchy and fragments of Bounded Arithmetic", 17th Annual ACM Symp. on Theory of Computing, Providence, R.I., pp. 285–290.

    Google Scholar 

  3. S.C. Kleene, "On the interpretation of intuitionistic number theory", Journal of Symbolic Logic, 10(1945), 109–124.

    Google Scholar 

  4. J.C.C. McKinsey, "Proof of the independence of the primitive symbols of Heyting's calculus of propositions", Journal of Symbolic Logic 4(1939), 155–158.

    Google Scholar 

  5. D. Nelson, "Recursive functions and intuitionistic number theory", Transactions of the American Mathematical Society, 61(1947), 307–368.

    Google Scholar 

  6. G. Takeuti, Proof Theory, North-Holland, 1975.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Alan L. Selman

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Buss, S.R. (1986). The polynomial hierarchy and intuitionistic Bounded Arithmetic. In: Selman, A.L. (eds) Structure in Complexity Theory. Lecture Notes in Computer Science, vol 223. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16486-3_91

Download citation

  • DOI: https://doi.org/10.1007/3-540-16486-3_91

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16486-9

  • Online ISBN: 978-3-540-39825-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics