Forcing in Proof Theory (2004)

Cached

Download Links

by Jeremy Avigad
Venue:BULL SYMB LOGIC
Citations:6 - 0 self

Active Bibliography

17 Number theory and elementary arithmetic – Jeremy Avigad - 2003
5 The metamathematics of ergodic theory – Jeremy Avigad - 2009
10 Disjoint NP-Pairs and . . . – Olaf Beyersdorff
7 Saturated models of universal theories – Jeremy Avigad
10 Proof complexity of pigeonhole principles – Alexander A. Razborov - 2002
7 Weak theories of nonstandard arithmetic and analysis – Jeremy Avigad - 2001
5 "Clarifying the Nature of the Infinite": the development of metamathematics and proof theory – Jeremy Avigad, Erich H. Reck - 2001
4 On the form of witness terms – Stefan Hetzl - 2010
4 Hilbert’s Program Then and Now – Richard Zach - 2005
7 Functional interpretation and inductive definitions – Jeremy Avigad, Henry Towsner
27 Local stability of ergodic averages – Jeremy Avigad, Henry Towsner
37 Two party immediate response disputes: properties and efficiency – Paul E. Dunne, T. J. M. Bench-capon - 2001
Feasible Proofs and Computations: Partnership and Fusion – Alexander A. Razborov
8 The Realm of Ordinal Analysis – Michael Rathjen - 1997
On the Lengths of Proofs of Consistency - a Survey of Results – Pavel Pudlák
30 Theories for Complexity Classes and their Propositional Translations – Stephen Cook - 2004
17 The Proof Complexity of Linear Algebra – Michael Soltys, Stephen Cook - 2002
4 Constant-depth frege systems with counting axioms polynomially simulate nullstellensatz refutations. August 05 2003 – Russell Impagliazzo, Nathan Segerlind - 1998
TERM EXTRACTION AND RAMSEY’S THEOREM FOR PAIRS – Alexander P. Kreuzer, Ulrich Kohlenbach