A simple proof of Parsons' theorem (0)

by Fernando Ferreira
Citations:3 - 2 self

Documents Related by Co-Citation

78 Lectures on Proof Theory – Samuel Buss, A. Maciel (mcgill, E. Allender (rutgers, P. Mckenzie - 1996
2 Harrington’s conservation theorem redone – Fernando Ferreira, Gilda Ferreira - 2008
193 Subsystems of Second Order Arithmetic – S G Simpson - 2009
4 Sistemas de Análise Fraca para a Integração (in Portuguese – G Ferreira - 2006
68 Bounded Arithmetic – Samuel R. Buss - 1986
3 R.: First order proof theory of arithmetic – Samuel Buss - 1998
37 Admissible sets and structures: An approach to definability theory – J Barwise - 1975
109 Proof theory – G Takeuti - 1975
3 Richman F.: Varieties of Constructive Mathematics, volume 97 – D S Bridges - 1987
4 Feferman S.: Gödel’s functional (“Dialectica”) interpretation – J Avigad - 1998
18 A Feasible Theory for Analysis – Fernando Ferreira - 1994
14 Models of Peano Arithmetic, volume 15 of Oxford Logic Guides – Richard Kaye - 1991
16 Formalizing forcing arguments in subsystems of secondorder arithmetic – Jeremy Avigad - 1996
41 On a number-theoretic choice schema and its relation to induction – C Parsons - 1970
26 Fragments of arithmetic – W Sieg - 1985
8 Herbrand analyses – W Sieg - 1991
35 Effective bounds from ineffective proofs in analysis: an application of functional interpretation and majorization – U Kohlenbach - 1992
11 Remarks on Herbrand normal forms and Herbrand realizations – U Kohlenbach - 1992
13 2005), Bounded functional interpretation – F Ferreira, P Oliva