A simple proof of Parsons' theorem (0)

by Fernando Ferreira
Citations:3 - 2 self

Active Bibliography

3 Things that can and things that can't be done in PRA – Ulrich Kohlenbach - 1998
6 Forcing in Proof Theory – Jeremy Avigad - 2004
17 Number theory and elementary arithmetic – Jeremy Avigad - 2003
12 Theories With Self-Application and Computational Complexity – Thomas Strahm - 2002
5 "Clarifying the Nature of the Infinite": the development of metamathematics and proof theory – Jeremy Avigad, Erich H. Reck - 2001
2 Harrington’s conservation theorem redone – Fernando Ferreira, Gilda Ferreira - 2008
Hilbert and Set Theory – Burton Dreben , Akihiro Kanamori - 1997
4 Hilbert’s Program Then and Now – Richard Zach - 2005
1 Primitive Recursive Selection Functions for Existential Assertions over Abstract Algebras – Thomas Strahm, Jeffery Zucker
13 Elimination of Skolem functions for monotone formulas in analysis – Ulrich Kohlenbach
7 Saturated models of universal theories – Jeremy Avigad
A Note on the ...-Induction Rule – Ulrich Kohlenbach
3 A note on the Π 0 2-induction rule – Ulrich Kohlenbach - 1995
9 On the Arithmetical Content of Restricted Forms of Comprehension, Choice and General Uniform Boundedness – Ulrich Kohlenbach - 1997
3 Proof-theoretic analysis by iterated reflection – L. D. Beklemishev
8 Induction Rules, Reflection Principles, and Provably Recursive Functions – Lev D. Beklemishev - 1996
18 On the No-Counterexample Interpretation – Ulrich Kohlenbach - 1997
“PARAMETER FREE Π1–INDUCTION AND RESTRICTED EXPONENTIATION” AND “A MODEL THEORETIC APPROACH TO PARAMETER FREE Π2–INDUCTION” (EXTENDED ABSTRACT) – F. F. Lara–martín - 2009
1 EXAMINING FRAGMENTS OF THE QUANTIFIED PROPOSITIONAL CALCULUS – Steven Perron