56REFERENCESAtiyah, M. 2008a. Mind, Matter and <strong>Mathematics</strong>, The Royal Society <strong>of</strong> Edinburgh,Presidential Address, http://www.rse.org.uk/events/reports/2007-2008/presidential_address.pdfAtiyah, M. 2008b. Interview <strong>on</strong> "Mind, Matter and <strong>Mathematics</strong>",http://www.dailystar.com.lb/article.asp?editi<strong>on</strong>_id=1&categ_id=2&article_id=97190Avigad, J. 2003. “Number theory and elementary arithmetic”. Philosophia Mathematica,11:257-284, 2003.Barendregt, H., Wiedijk, F. 2005. “The Challenge <strong>of</strong> Computer <strong>Mathematics</strong>”. In:Transacti<strong>on</strong>s A <strong>of</strong> the Royal Society 363 no. 1835, 2351-2375.Basu, S., R. Pollack, R., M. Roy, M. 2006. Algorithms in Real Algebraic Geometry. SpringerVerlag. http://www.math.gatech.edu/~saugata/index.html#books_authoredBoolos, G. 1993. The Logic <strong>of</strong> Provability. Cambridge, England: Cambridge UniversityPress.Buchholz, W., S. Feferman, S., Pohlers, W., Seig, W. 1981. Iterated Inductive Definiti<strong>on</strong>sand Subsystems <strong>of</strong> Analysis: Recent Pro<strong>of</strong>-Theoretical Studies. Lecture Notes in<strong>Mathematics</strong>, no. 897, Springer-Verlag.Cohen, P.J. 1963-64. “The independence <strong>of</strong> the c<strong>on</strong>tinuum hypothesis”. Proc. Nat. Acad.Sci. U.S.A. 50 (1963), 1143-1148; 51, 105-110.Cohen, P.J. 1969. “Decisi<strong>on</strong> procedures for real and p-adic fields”. Comm. Pure Appl.Math., 22, 131-151.Dales, H.G. 2001. Banach algebras and automatic c<strong>on</strong>tinuity. L<strong>on</strong>d<strong>on</strong> Mathematical Society
57M<strong>on</strong>ographs, 24, Oxford: Clarend<strong>on</strong> Press.Dales, H.G., and W.H. Woodin, W.H. 1987. An introducti<strong>on</strong> to independence results foranalysts. L<strong>on</strong>d<strong>on</strong> Mathematical Society Lecture Note Series, vol. 115, Cambridge,England: Cambridge University Press.Davis, M. 1973. “Hilbert’s Tenth Problem is unsolvable”. The American MathematicalM<strong>on</strong>thly 80(3):233-269. Reprinted with correcti<strong>on</strong>s in the Dover editi<strong>on</strong> <strong>of</strong>Computability and Unsolvability, 1973.Daws<strong>on</strong>, J. 2005. Logical Dilemmas: The Life and Work <strong>of</strong> Kurt Gödel. Wellesley,Massachusetts: A.K. Peters.Debs, G. and Saint Raym<strong>on</strong>d, J. 1996. “Compact covering and game determinacy”.Topology Appl. 68 (1996), 153--185Debs, G., and Saint Raym<strong>on</strong>d, J. 1999. “C<strong>of</strong>inal Σ 1 1 and Π 1 1 subsets <strong>of</strong> N N ”. Fund. Math.159, 161-193.Debs, G., and Saint Raym<strong>on</strong>d, J. 2001. “Compact covering mappings and c<strong>of</strong>inalfamilies <strong>of</strong> compact subsets <strong>of</strong> a Borel set”. Fund. Math. 167, 213-249.Debs, G., and Saint Raym<strong>on</strong>d, J. 2004. “Compact covering mappings between Borelsets and the size <strong>of</strong> c<strong>on</strong>structible reals”. Transacti<strong>on</strong>s <strong>of</strong> the American MathematicalSociety, vol. 356, No. 1, 73-117.Debs, G., and Saint Raym<strong>on</strong>d, J. 2007. Borel Liftings <strong>of</strong> Borel Sets: Some Decidable andUndecidable Statements. American Mathematical Society Memoirs.Dimitracopoulus, C., and H. Gaifman, H. 1982. “Fragments <strong>of</strong> Peano’s arithmetic andthe MRDP theorem”. In: Logic and Algorithmic, An Internati<strong>on</strong>al Symposium Held inH<strong>on</strong>our <strong>of</strong> Ernst Specker, M<strong>on</strong>ogr. Ensign. Math. Univ. Geneve, 1982, 317-329.Dragalin, A. 1980. “New forms <strong>of</strong> realizability and Markov’s rule”. Russian: Doklady,251:534–537. Translati<strong>on</strong>: SM 21, pp. 461–464.
- 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: 55statements represents an inevitab
- Page 59 and 60: 59Vol. 41, No. 3, September pp. 209
- Page 61 and 62: 61Friedman, H., Robertson, N., and
- Page 63 and 64: 63Society, 8:437-479, 1902.Hilbert,
- 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