No Counter-Example Interpretation and Interactive Computation
暂无分享,去创建一个
No counter-example interpretation for bounded arithmetic is employed to derive recent witnessing theorem for S 2 i+1 , functions □ i+1 P −computable with counterexamples are shown to include all □ i+2 P −functions, and two separation results for fragments of S 2(α) are proved.
[1] Jan Krajícek,et al. Bounded Arithmetic and the Polynomial Hierarchy , 1991, Ann. Pure Appl. Log..
[2] Jeff B. Paris,et al. Provability of the Pigeonhole Principle and the Existence of Infinitely Many Primes , 1988, J. Symb. Log..
[3] Pavel Pudlák. Some Relations Between Subsystems of Arithmetic and Complexity of Computations , 1992 .