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

Active Bibliography

18 Structure and Definability in General Bounded Arithmetic Theories – Chris Pollett - 1999
46 Bounded Arithmetic and Lower Bounds in Boolean Complexity – Alexander A. Razborov - 1993
5 The Witness Function Method and Provably Recursive Functions of Peano – Samuel R. Buss - 1994
68 Bounded Arithmetic – Samuel R. Buss - 1986
37 Computation Models and Function Algebras – P. Clote
45 Predicative Recursion and Computational Complexity – Stephen J. Bellantoni - 1992
Logic Group Preprint Series – Atbo T Vizz Ea, Albert Visser - 1987
Czechoslovak Academy of Sciences Prague – J. B. Paris, A. J. Wilkie, G. M. Wiliners (editors, Pave Pudlgk
A Propositional Proof System for. . . – Chris Pollett
1 On the $\Delta^b_1$-Bit-Comprehension Rule – Jan Johannsen, Bit-comprehension Rule, Chris Pollett - 2000
8 A Bounded Arithmetic Theory for Constant Depth Threshold Circuits – Jan Johannsen - 1996
7 A Model-Theoretic Property of Sharply Bounded Formulae, with some Applications – Jan Johannsen - 1998
5 On the b 1 -bit-comprehension rule – Jan Johannsen, Chris Pollett - 2000
CONCATENATION AS A BASIS FOR Q AND THE INTUITIONISTIC VARIANT OF NELSON’S CLASSIC RESULT – Rachel Sterken - 2008
WHAT IS THE RIGHT NOTION OF SEQUENTIALITY? – Albert Visser
THE ARITHMETICS OF A THEORY – Albert Visser
5 Can we make the Second Incompleteness Theorem coordinate free? – Albert Visser
1 Consistency and Games|in Search of New Combinatorial Principles – Pavel Pudlák - 2004
3 Bounded Arithmetic and Constant Depth Frege Proofs – Samuel R. Buss - 2004