66Theory <strong>of</strong> the Reals, Part I: Introducti<strong>on</strong>. Preliminaries. The Geometry <strong>of</strong> Semi-Algebraic Sets. The Decisi<strong>on</strong> Problem for the Existential Theory <strong>of</strong> the Reals. J.Symb. Comput. 13 (3): 255-300.Renegar, J. 1992b. On the Computati<strong>on</strong>al Complexity and Geometry <strong>of</strong> the First-OrderTheory <strong>of</strong> the Reals, Part II: The General Decisi<strong>on</strong> Problem. Preliminaries forQuantifier Eliminati<strong>on</strong>. J. Symb. Comput. 13 (3): 301-328.Renegar, J. 1992c. On the Computati<strong>on</strong>al Complexity and Geometry <strong>of</strong> the First-OrderTheory <strong>of</strong> the Reals, Part III: Quantifier Eliminati<strong>on</strong>. J. Symbolic Computati<strong>on</strong>, 13(3): 329-352.Roberts<strong>on</strong>, N., and Seymour, P.D. 1985. “Graph minors---a survey”. In: Surveys incombinatorics 1985 (Glasgow, 1985), 153--171, L<strong>on</strong>d<strong>on</strong> Math. Soc. Lecture Note Ser.,103. Cambridge, England: Cambridge Univ. Press.Roberts<strong>on</strong>, N., and Seymour, P.D. 2004. “Graph minors. XX. Wagner's c<strong>on</strong>jecture”. J.Combin. Theory Ser. B 92, no. 2, 325--357.Robins<strong>on</strong>, R.M. 1952. “An essentially undecidable axiom system”. In: Inernati<strong>on</strong>alC<strong>on</strong>gress <strong>of</strong> Mathematicians (II,6); 1950 Cambridge MA, Proceedings <strong>of</strong> theInternati<strong>on</strong>al C<strong>on</strong>gress <strong>of</strong> Mathematicians. Providence, Rhode Island: AmericanMathematical Society. 729-730.Rosser, J.B. 1936. “Extensi<strong>on</strong>s <strong>of</strong> some theorems <strong>of</strong> Gödel and Church”. Journal <strong>of</strong>Symbolic Logic, Vol. 1, 1936, 87-91.Rayo, A., and T. Wiliams<strong>on</strong>, T. 2003. “A Completeness Theorem for Unrestricted First-Order Languages”. In J.C. Beall, ed., Liars and Heaps (Oxford: Clarend<strong>on</strong> Press),pp. 331-356.Schütte, K. 1977. Pro<strong>of</strong> Theory. Grundlehren der mathematischen Wissenschaften 225.
67Scott, D.S. 1961. “Measurable cardinals and c<strong>on</strong>structible sets”. Bull. Acad. Pol<strong>on</strong>. Sci. 9(1961), 521-524.Shelah, S. 1969-2007. Shalah’s Archive. http://shelah.logic.at/Siegel, C.L. 1972. “Zur Theorie der quadratischen Formen. Nachricten der Akademieder Wissenschafen”. In Göttingen. II. Mathematisch-Physikalische Klasse, no.3:21-46 (German).Simps<strong>on</strong>, S.G. 1999. Subsystems <strong>of</strong> Sec<strong>on</strong>d Order Arithmetic. Perspectives inMathematical Logic, Springer, 444 pages.Skolem, T. 1922. “Some remarks <strong>on</strong> axiomatized set theory”. In: From Frege to Gödel: ASource Book in Mathematical Logic, 1879-1931. Cambridge, Massachusetts: HarvardUniversity Press, 1967, ed. J. van Heijenoort, 290-301.Smith, R.L. 1985. “The c<strong>on</strong>sistency strengths <strong>of</strong> some finite forms <strong>of</strong> the Higman andKruskal Theorems”. In: Harvey Friedman’s Research <strong>on</strong> the Foundati<strong>on</strong>s <strong>of</strong><strong>Mathematics</strong>, ed. L.A. Harringt<strong>on</strong> et al. New York: Elsevier Science Publishers,119-159.Solovay, R.M. 1970. “A model <strong>of</strong> set theory in which every set <strong>of</strong> reals is Lebesguemeasurable”. Annals <strong>of</strong> <strong>Mathematics</strong>, 1-56.Spector, C. 1962. “Provably recursive functi<strong>on</strong>s <strong>of</strong> analysis: A c<strong>on</strong>sistency pro<strong>of</strong> <strong>of</strong>analysis by an extensi<strong>on</strong> <strong>of</strong> principles formulated in current intuiti<strong>on</strong>isticmathematics”. In: Recursive Functi<strong>on</strong> Theory, Proceedings <strong>of</strong> symposia in puremathematics, vol. 5, ed. J.C.E. Dekker (Providence R.I.: American MathematicalSociety).Stanley, L.J. 1985. “Borel Diag<strong>on</strong>alizati<strong>on</strong> and Abstract Set Theory: Recent Results <strong>of</strong>Harvey Friedman”. In: Harvey Friedman’s Research <strong>on</strong> the Foundati<strong>on</strong>s <strong>of</strong><strong>Mathematics</strong>, ed. L.A. Harringt<strong>on</strong> et al. New York: Elsevier Science Publishers. 11-
- 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 and 62: 61Friedman, H., Robertson, N., and
- Page 63 and 64: 63Society, 8:437-479, 1902.Hilbert,
- Page 65: 65Mostowski, A. 1952. Sentences und
- Page 69: 69389.*This research was partially