The bounded arithmetic theory S 2 is nitely axiomatized if and only if the polynomial hierarchy provably collapses. If T i 2 equals S i+1 2 then T i 2 is equal to S 2 and proves that the polynomial time hierarchy collapses to p i+3 , and, in fact, to the Boolean hierarchy over p i+2 and to p i+1 =poly .