On G$\ddot{o}$del′s Program from Incompleteness to Speed-up

  • Published : 2002.12.01

Abstract

G$\ddot{o}$del's metamathematical program from Incompleteness to Speed-up theorems shows the necessity of ever higher systems beyond the fixed formal system and devises the relative consistency.

Keywords

References

  1. Brains, Machines, and Mathematics Arbib, M.
  2. Set Theory and the Continuum Hypothesis Cohen, P.;W. A. Benjamin
  3. A Profile of Mathematical Logic DeLong, H.
  4. The Universal Turing Machine: A Half-Century Survey Turing in the Land of O(z) Feferman, S.;R. Herken(ed.)
  5. In the Light of Logic Feferman, S.
  6. Collected Works I: Publications 1929-1936 On Formally Undecidable Propositions of Principia Mathematica and Related Systems I Godel, K.;S Ferferman(et al.)
  7. Collected Works I: Publications 1929-1936 On Completeness and Consistency(1932) Godel, K.;S Ferferman(et al)
  8. Collected Works I: Publications 1929-1936 On Undecidable Propositions of Formal mathematical Systems(1934) Godel, K.;S Ferferman(et al.)
  9. Collected Works I: Publications 1929-1936 On the Length of Proofs(1936) Godel, K.;S Ferferman(et al.)
  10. Collected Works II: Publications 1938-1974 Remarks before the Princeton bicentennial Conference of Problems in Mathematics(1946) Godel, K.;S. Ferferman(et al.)
  11. Proceeding of The American Mathematical Society v.121 On Godel's Second Incompleteness Theorem Jech, T.
  12. Introduction to Metamathematics Kleene, S
  13. Journal of Symbolic Logic v.1 Finite Combinatory Processes, Formulation 1 Post, E.