An Equivalence between Second Order Bounded Domain Bounded Arithmetic and First Order Bounded Arithmetic (1993)

Cached

Download Links

by Alexander A. Razborov
Citations:28 - 4 self

Documents Related by Co-Citation

29 RSUV isomorphism – G Takeuti - 1993
115 Feasibly constructive proofs and the propositional calculus – Stephen Cook - 1975
121 Bounded Arithmetic, Bibliopolis – S R Buss - 1986
27 Axiomatizations and Conservation Results for Fragments of Bounded Arithmetic – Samuel R. Buss - 1990
58 Notes on Polynomially Bounded Arithmetic – Domenico Zambella
57 Bounded arithmetic and the polynomial hierarchy – J Krajíček, P Pudlák, G Takeuti - 1991
27 Relating the Bounded Arithmetic and Polynomial Time Hierarchies – Samuel R. Buss, Then T - 1994
71 A.R.: Provability of the pigeonhole principle and the existence of infinitely many primes – J B Paris, A J Wilkie, Woods - 1988
107 Metamathematics of First-Order Arithmetic – Hájek, P Pudlák - 1993
35 Witnessing Functions in Bounded Arithmetic and Search Problems – Mario Chiari, Jan Krajicek - 1994
80 Counting problems in bounded arithmetic – Jeff B Paris, Alex J Wilkie
54 An application of boolean complexity to separation problems in bounded arithmetic – Samuel R. Buss, Jan Krajlcek - 1994
211 Bounded Arithmetic, Propositional Logic, and Complexity Theory – J Krajíček - 1995
66 The Boolean formula value problem is in ALOGTIME – Samuel R. Buss - 1987
274 Descriptive Complexity – Neil Immerman - 1998
30 Theories for Complexity Classes and their Propositional Translations – Stephen Cook - 2004
7 Exponentiation and second order bounded arithmetic – J Krajíček - 1990
12 Relating the provable collapse of P to NC 1 and the power of logical theories – Stephen A Cook - 1998
222 Parity, circuits, and the polynomial-time hierarchy – M Furst, J Saxe, M Sipser - 1984