The polynomial hierarchy and intuitionistic bounded arithmetic

31Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Intuitionistic theories IS2i of Bounded Arithmetic are introduced and it is shown that the definable functions of IS2i are precisely the □ip 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 Σib-definable functions are of interest, our results for intuitionistic theories concern all the definable functions. The method of proof uses □ip-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.

Cite

CITATION STYLE

APA

Buss, S. R. (1986). The polynomial hierarchy and intuitionistic bounded arithmetic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 223 LNCS, pp. 77–103). Springer Verlag. https://doi.org/10.1007/3-540-16486-3_91

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free