by Samuel R. Buss, T
Dept. Math., Seconda Univ
http://euclid.ucsd.edu/~sbuss/ResearchWeb/quaderni/paper.ps
Add To MetaCart
Abstract:
We discuss the Paris-Wilkie translation from bounded arithmetic proofs to bounded depth propositional proofs in both relativized and non-relativized forms. We describe normal forms for proofs in bounded arithmetic, and a definition of # #-depth for PK-proofs that makes the translation from bounded arithmetic to propositional logic particularly transparent. Using this, we give new proofs of the witnessing theorems for S 1
Citations
|
153
|
On the complexity of local search
– Papadimitriou, Schaffer, et al.
- 1990
|
|
98
|
Feasibly constructive proofs and the propositional calculus (preliminary version
– Cook
- 1975
|
|
92
|
Bounded Arithmetic. Bibliopolis
– Buss
- 1986
|
|
64
|
Existence and feasibility in arithmetic
– Parikh
- 1971
|
|
44
|
Lower bounds to the size of constant-depth propositional proofs
– Krajíček
- 1994
|
|
42
|
An application of boolean complexity to separation problems in bounded arithmetic
– Buss, Kraj'icek
- 1994
|
|
35
|
Quantified propositional calculi and fragments of bounded arithmetic
– Krajíček, Pudlák
- 1990
|
|
30
|
On the scheme of induction for bounded arithmetic formulas
– Wilkie, Paris
- 1987
|
|
25
|
Predicative arithmetic
– Nelson
- 1986
|
|
18
|
Propositional representation of arithmetic proofs
– Dowd
- 1979
|
|
13
|
Delta 0 sets and induction
– Paris, Wilkie
- 1981
|
|
12
|
cek, Lower bounds to the size of constant-depth propositional proofs
– Kraj
- 1994
|
|
10
|
Arithmetic Theories with Prenex Normal Form Induction
– Pollett
- 1997
|
|
9
|
Bounded arithmetic AID for Frege system
– Arai
|
|
8
|
Quantified Propositional Calculus and a Second-Order Theory for NC 1
– Cook, Morioka
|
|
7
|
Propositional Calculus and Complexity Theory
– Arithmetic
- 1995
|
|
4
|
Separation results for the size of constant-depth propositional proofs. Typeset manuscript
– Beckmann, Buss
- 2003
|
|
3
|
ajek and P. Pudl ak
– H
- 1993
|
|
2
|
0 sets and induction, inOpenDays in Model Theory and Set
– Paris, Wilkie
- 1981
|
|
1
|
arithmetic, cryptography and complexity
– Bounded
- 1997
|
|
1
|
cek and P. Pudl ak, Quantified propositional calculi and fragments of bounded arithmetic, Zeitschrift fur Mathematische Logik und Grundlagen der
– Kraj
- 1990
|
|
1
|
arithmetic and truth definition, Annals of Pure and Applied Logic
– Bounded
- 1988
|
