Results 1 
3 of
3
Relating the Bounded Arithmetic and Polynomial Time Hierarchies
 Annals of Pure and Applied Logic
, 1994
"... The bounded arithmetic theory S 2 is finitely axiomatized if and only if the polynomial hierarchy provably collapses. If T 2 equals S then T 2 is equal to S 2 and proves that the polynomial time hierarchy collapses to # , and, in fact, to the Boolean hierarchy over # and to # i+1 / ..."
Abstract

Cited by 27 (1 self)
 Add to MetaCart
The bounded arithmetic theory S 2 is finitely axiomatized if and only if the polynomial hierarchy provably collapses. If T 2 equals S then T 2 is equal to S 2 and proves that the polynomial time hierarchy collapses to # , and, in fact, to the Boolean hierarchy over # and to # i+1 /poly .
Comparing Constructive Arithmetical Theories Based On NPPIND and coNPPIND
"... In this note we show that the intuitionistic theory of polynomial induction on Π b+ 1formulas does not imply the intuitionistic theory IS1 2 of polynomial induction on Σ b+ 1formulas. We also show the converse assuming the Polynomial Hierarchy does not collapse. Similar results hold also for lengt ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
In this note we show that the intuitionistic theory of polynomial induction on Π b+ 1formulas does not imply the intuitionistic theory IS1 2 of polynomial induction on Σ b+ 1formulas. We also show the converse assuming the Polynomial Hierarchy does not collapse. Similar results hold also for length induction in place of polynomial induction. We also investigate the relation between various other intuitionistic firstorder theories of bounded arithmetic. Our method is mostly semantical, we use Kripke models of the theories.