论文信息 - Some Relations Between Subsystems of Arithmetic and Complexity of Computations

Some Relations Between Subsystems of Arithmetic and Complexity of Computations

We shall introduce a special mode of interactive computations of optimal solutions to optimization problems. A restricted version of such computations was used in [KPT] to show that T 2 i = S 2 i+1 implies ∑ i+2 p = П i+2 p . Here we shall reduce the question whether T 2 i = S 2 i to a question about interactive computations (in a more general sense) of some optimization problems.

Pavel Pudlák

[1] A. Selman. Structure in Complexity Theory , 1986, Lecture Notes in Computer Science.

[2] Jeff B. Paris,et al. On the scheme of induction for bounded arithmetic formulas , 1987, Ann. Pure Appl. Log..

[3] Rohit Parikh,et al. Existence and feasibility in arithmetic , 1971, Journal of Symbolic Logic.

[4] Jan Krajícek,et al. Bounded Arithmetic and the Polynomial Hierarchy , 1991, Ann. Pure Appl. Log..

[5] Pavel Pudlák,et al. A note on bounded arithmetic , 1990 .

[6] H. Keisler,et al. Handbook of mathematical logic , 1977 .

[7] Georg Kreisel,et al. On the interpretation of non-finitist proofs—Part I , 1951, Journal of Symbolic Logic.

[8] Stephen A. Cook,et al. Feasibly constructive proofs and the propositional calculus (Preliminary Version) , 1975, STOC.

[9] Berthold J. Maier. On countable locally described structures , 1987, Ann. Pure Appl. Log..

[10] Jan Krajícek,et al. Quantified propositional calculi and fragments of bounded arithmetic , 1990, Math. Log. Q..

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

[12] H. Schwichtenberg. Proof Theory: Some Applications of Cut-Elimination , 1977 .