On the Provability of Consistency of PV

On the Provability of Consistency of PV (2008)

by Ebrahim A Larijani

@MISC{Larijani08onthe,
    author = {Ebrahim A Larijani},
    title = {On the Provability of Consistency of PV},
    year = {2008}
}

637	The complexity of theorem-proving procedures - Cook
110	Feasibly constructive proofs and the propositional calculus - Cook - 1975
56	Bounded arithmetic and the polynomial hierarchy, APAL 52 - Krajíček, Pudlák, et al. - 1991
56	Notes on polynomially bounded arithmetic - Zambella - 1996
27	Relating the bounded arithmetic and the polynomial time hierarchies - Buss - 1995
25	The polynomial-time hierarchy, Theoret - Stockmeyer - 1976
22	Fragments of bounded arithmetic and bounded query classes - Krajíček - 1993
10	Bounded Arithmetic, volume 3 - Buss - 1986
10	Bounded arithmetic and propositional proof complexity - Buss - 1995
7	A note on bounded arithmetic - Pudlak - 1981
4	Handbook of Proof Theory, volume 137 - Buss, editor - 1998
3	and Aleksandar Ignjatovic. Unprovability of consistency statements in fragments of bounded arithmetic - Buss - 1995
3	Some relations among systems for bounded arithmetic - Takeuti - 1990
1	Proving consistency of equational theories in bounded arithmetic - Beckmann
1	proof theory, and computational complexity, volume 23 of Oxford Logic Guides - Arithmetic - 1993
1	Sanjeev Arora. Complexity Theory: A Modern Approach - Barak - 2009