Type 2 Polynomial Hierarchies

In this paper we examine type 2 analogs of the type 1 polynomial hierarchy and show some limitations on finding a completely faithful type 2 analog. We survey most of the notions of type 2 poly-hierarchies already proposed in the literature and present two natural definitions of type 2 poly-hierarchies. We also introduce various resource bounded reductions between functionals of type 2.

[1]  Samuel R. Buss,et al.  The Polynomial Hierarchy and Intuitionistic Bounded Arithmetic , 1986, SCT.

[2]  José L. Balcázar,et al.  Structural Complexity I , 1995, Texts in Theoretical Computer Science An EATCS Series.

[3]  Andrew Chi-Chih Yao,et al.  Separating the Polynomial-Time Hierarchy by Oracles (Preliminary Version) , 1985, FOCS.

[4]  Victor Harnik Provably Total Functions of Intuitionistic Bounded Arithmetic , 1992, J. Symb. Log..

[5]  Stephen A. Cook,et al.  Functional Interpretations of Feasibly Constructive Arithmetic , 1993, Ann. Pure Appl. Log..

[6]  Stephen A. Cook,et al.  Computability and Complexity of Higher Type Functions , 1992 .

[7]  Bruce M. Kapron,et al.  A new characterization of Mehlhorn's polynomial time functionals , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[8]  Anil Seth,et al.  There is no recursive axiomatization for feasible functionals of type 2 , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[9]  Anil Seth,et al.  Some desirable conditions for feasible functionals of type 2 , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[10]  Bruce M. Kapron,et al.  Characterizations of the basic feasible functionals of finite type , 1989, 30th Annual Symposium on Foundations of Computer Science.

[11]  Mike Townsend,et al.  Complexity for Type-2 Relations , 1990, Notre Dame J. Formal Log..

[12]  Larry J. Stockmeyer,et al.  The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

[13]  Anil Seth Turing Machine Characterizations of Feasible Functionals of All Finite Types , 1995 .