Relating the bounded arithmetic and polynomial time hierarchies

Buss, 1994, The witness function method and fragments of Peano arithmetic, 29 Buss, 1986 Buss, 1990, Axiomatizations and conservation results for fragments of bounded arithmetic, Vol. 106, 57 Buss, 1991, On truth-table reducibility to SAT, Inform. Comput., 91, 86, 10.1016/0890-5401(91)90075-D Buss, 1994, An application of Boolean complexity to separation problems in bounded arithmetic, 69, 1 Chang, 1990, The boolean hierarchy and the polynomial hierarchy: a closer connection, 169 Karp, 1982, Turing machines that take advice, L'Enseignement Mathematique, 28, 191 Krajíček, 1992, No counter-example interpretation and interactive computation, 287 Krajíček, 1993, Fragments of bounded arithmetic and bounded query classes, Trans. AMS, 338, 587, 10.1090/S0002-9947-1993-1124169-X Krajíček, 1991, Bounded arithmetic and the polynomial hierarchy, Ann. Pure Appl. Logic, 52, 143, 10.1016/0168-0072(91)90043-L Parikh, 1971, Existence and feasibility in arithmetic, J. Symbolic Logic, 36, 494, 10.2307/2269958 Pudlák, 1992, Some relations between subsystems of arithmetic and the complexity of computations, 499 Takeuti, 1990, Sharply bounded arithmetic and the function a ∸ 1, Vol. 106, 281 Wilkie, 1987, On the scheme of induction for bounded arithmetic formulas, Ann. Pure Appl. Logic, 35, 261, 10.1016/0168-0072(87)90066-2 D. Zambella, Notes on polynomially bounded arithmetic, J. Symbolic Logic, to appear.