62(Gödel 1986-2003 Vol. II 28-32).Gödel, K. 1940. The c<strong>on</strong>sistency <strong>of</strong> the axiom <strong>of</strong> choice and the generalized c<strong>on</strong>tinuumhypothesis with the axioms <strong>of</strong> set theory. Annals <strong>of</strong> mathematics studies, vol. 3(Princet<strong>on</strong> University Press), in: (Gödel 1986-2003 Vol. II 33-101).Gödel, K. 1944. “Russell’s mathematical logic”. In: (Gödel 1986-2003 Vol. II 119-141).Gödel, K. 1946. “Remarks before the Princet<strong>on</strong> bicentennial c<strong>on</strong>ference <strong>on</strong> problems inmathematics”. In: (Gödel 1986-2003 Vol. II 150-153).Gödel, K. 1947,1964. “What is Cantor’s c<strong>on</strong>tinuum problem?”. In: (Gödel 1986-2003Vol. II 1947 versi<strong>on</strong> 176-187 1964 versi<strong>on</strong> 254-270).Gödel, K. 1958. “On a hitherto unutilized extensi<strong>on</strong> <strong>of</strong> the finitary standpoint”. In:(Gödel 1986-2003 Vol. II 241-251).Gödel, K. 1972. “On an extensi<strong>on</strong> <strong>of</strong> finitary mathematics which has not yet beenused”. In: (Gödel 1986-2003 Vol. II 271-280).Gödel, K. 1986-2003. Collected works. Vol. I-V. Oxford: Oxford University Press (S.Feferman et al., editors).Gogol, D. 1979. “Sentences with three quantifiers are decidable in set theory”.Fundamenta Mathematicae, CII, 1-8.Goodstein, R.L. 1944. “On the restricted ordinal theorem”. Journal <strong>of</strong> Symbolic Logic 9,1944, 33-41.Grunewald, F.J., and Segal, D. 1981. “How to solve a quadratic equati<strong>on</strong> in integers”.Math. Proc. Cambridge Philos. Soc. 89 (1981) 1–5.Hajek, P., and P. Pudlak, P. 1993. Metamathematics <strong>of</strong> First-Order Arithmetic.Perspectives in Mathematical Logic, Springer.Hilbert, H. 1902. “Mathematical problems”. Lecture delivered before the Internati<strong>on</strong>alC<strong>on</strong>gress <strong>of</strong> Mathematicians at Paris in 1900. Bulletin <strong>of</strong> the American Mathematical
63Society, 8:437-479, 1902.Hilbert, D., and Bernays, P. 1934,1939. Grundlagen der Mathematik, Vol. 1 (1934), Vol II(1939), Berlin: Springer.Hosoi, T., and Ono, H. 1973. “Intermediate propositi<strong>on</strong>al logics (a survey)”. Journal <strong>of</strong>Tsuda College 5, 67-82.Jech, T. 2006. Set Theory, Third Editi<strong>on</strong>, Springer M<strong>on</strong>ographs in <strong>Mathematics</strong>. Springer.Jerosolow, R.G. 1973. “Redundancies in the Hilbert-Bernays derivability c<strong>on</strong>diti<strong>on</strong>s forGödel’s sec<strong>on</strong>d incompleteness theorem”. Journal <strong>of</strong> Symbolic Logic, Vol. 38, 1973,359-367.J<strong>on</strong>es, J.P. 1982. “Universal Diophantine equati<strong>on</strong>”. Journal <strong>of</strong> Symbolic Logic, 47(3):549-571.Kechris, A.S. 1994. Classical Descriptive Set Theory. Graduate Texts in <strong>Mathematics</strong>,Springer-Verlag, 1994.Kohlenbach, U. 2005. “Some logical metatheorems with applicati<strong>on</strong>s in functi<strong>on</strong>alanalysis”. Trans. Amer. Amth. Soc. vol. 357, no. 1, 89-128, 2005.Kohlenbach, U. To appear. “Effective bounds from pro<strong>of</strong>s in abstract functi<strong>on</strong>alanalysis”. In: B. Cooper, B. Loewe, A. Sorbi (eds.), CIE 2005 New Computati<strong>on</strong>alParadigms: Changing C<strong>on</strong>cepti<strong>on</strong>s <strong>of</strong> What is Computable, Springer, to appear.http://www.mathematik.tu-darmstadt.de/~kohlenbach/Kohlenbach, U., and P. Gerhardy, P. To appear. “General logical metatheorems forfuncti<strong>on</strong>al analysis”. Trans. Amer. Math. Soc. http://www.mathematik.tudarmstadt.de/~kohlenbach/Kohlenbach, U. 2007. Gödel's functi<strong>on</strong>al interpretati<strong>on</strong> and its use in currentmathematics, t<strong>his</strong> volume.Kohlenbach, U., and Oliva, P. 2003. “Pro<strong>of</strong> mining: a systematic way <strong>of</strong> analyzing
- Page 1:
1MY FORTY YEARS ON HIS SHOULDERSbyH
- Page 4 and 5:
4theorem is demonstrably implied by
- Page 6 and 7:
6At the outer limits, normal mathem
- Page 8 and 9:
8“Thus, according to Gödel, the
- Page 11 and 12: 11(Rosser 1936) is credited for sig
- Page 13 and 14: 13(Davis 1973), (Matiyasevich 1993)
- Page 15 and 16: 15For degree 3, the existence of an
- Page 17 and 18: 17v) connectives ¬,∧,∨,→,↔
- Page 19 and 20: 19PROV[x 1 /#(A)] → PROV[x 1 /PR(
- Page 21 and 22: 21FORMAL SECOND INCOMPLETENESS (PA(
- Page 23 and 24: 23function symbols, together with t
- Page 25 and 26: 25remarks by R. Parikh, it is likel
- Page 27 and 28: 27The same remarks can be made with
- Page 29 and 30: 29Harrington 1977), and are proved
- Page 31 and 32: 31¬ as ¬.∧ as ∧.→ as →.
- Page 33 and 34: 33the result of simultaneously repl
- Page 35 and 36: 35We believe that the Spector devel
- Page 37 and 38: 37P.J. Cohen proved that if ZF is c
- Page 39 and 40: 39My ideas are not very well develo
- Page 41 and 42: 41vertices of T i .It is natural to
- Page 43 and 44: 43An extremely interesting conseque
- Page 45 and 46: 45THEOREM 9.5. (Friedman 2005). The
- Page 47 and 48: 47Showing that all such statements
- Page 49 and 50: 49in E depends only on the order ty
- Page 51 and 52: 51Also consider the recursive unsol
- Page 53 and 54: 53used to prove statements in and a
- Page 55 and 56: 55statements represents an inevitab
- Page 57 and 58: 57Monographs, 24, Oxford: Clarendon
- Page 59 and 60: 59Vol. 41, No. 3, September pp. 209
- Page 61: 61Friedman, H., Robertson, N., and
- Page 65 and 66: 65Mostowski, A. 1952. Sentences und
- Page 67 and 68: 67Scott, D.S. 1961. “Measurable c
- Page 69: 69389.*This research was partially