Skip to main content Accessibility help
×
Home

GENERALIZATIONS OF GÖDEL’S INCOMPLETENESS THEOREMS FOR ∑ n -DEFINABLE THEORIES OF ARITHMETIC

  • MAKOTO KIKUCHI (a1) and TAISHI KURAHASHI (a2)

Abstract

It is well known that Gödel’s incompleteness theorems hold for ∑1-definable theories containing Peano arithmetic. We generalize Gödel’s incompleteness theorems for arithmetically definable theories. First, we prove that every ∑ n+1-definable ∑ n -sound theory is incomplete. Secondly, we generalize and improve Jeroslow and Hájek’s results. That is, we prove that every consistent theory having ∏ n+1 set of theorems has a true but unprovable ∏ n sentence. Lastly, we prove that no ∑ n+1-definable ∑ n -sound theory can prove its own ∑ n -soundness. These three results are generalizations of Rosser’s improvement of the first incompleteness theorem, Gödel’s first incompleteness theorem, and the second incompleteness theorem, respectively.

    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      GENERALIZATIONS OF GÖDEL’S INCOMPLETENESS THEOREMS FOR ∑ n -DEFINABLE THEORIES OF ARITHMETIC
      Available formats
      ×

      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

      GENERALIZATIONS OF GÖDEL’S INCOMPLETENESS THEOREMS FOR ∑ n -DEFINABLE THEORIES OF ARITHMETIC
      Available formats
      ×

      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

      GENERALIZATIONS OF GÖDEL’S INCOMPLETENESS THEOREMS FOR ∑ n -DEFINABLE THEORIES OF ARITHMETIC
      Available formats
      ×

Copyright

Corresponding author

*GRADUATE SCHOOL OF SYSTEM INFORMATICS KOBE UNIVERSITY 1-1 ROKKODAI, NADA, KOBE 657-8501, JAPAN E-mail: mkikuchi@kobe-u.ac.jp
DEPARTMENT OF NATURAL SCIENCE NATIONAL INSTITUTE OF TECHNOLOGY, KISARAZU COLLEGE 2-11-1 KIYOMIDAI-HIGASHI, KISARAZU, CHIBA 292-0041, JAPAN E-mail: kurahashi@n.kisarazu.ac.jp

References

Hide All
Beklemishev, L. D. (2005). Reflection principles and provability algebras in formal arithmetic. Russian Mathematical Surveys, 60(2), 197268.
Feferman, S. (1960). Arithmetization of metamathematics in a general setting. Fundamenta Mathematicae, 49, 3592.
Gödel, K. (1931). Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I. (in German). Monatshefte für Mathematik und Physik, 38(1), 173198. English translation in Kurt Gödel, Collected Works, Vol. 1. pp. 145–195.
Grzegorczyk, A., Mostowski, A., & Ryll-Nardzewski, C. (1958). The classical and the ω-complete arithmetic. The Journal of Symbolic Logic, 23(2), 188206.
Hájek, P. (1977). Experimental logics and ${\rm{\Pi }}_3^0$ theories. The Journal of Symbolic Logic, 42(4), 515522.
Isaacson, D. (2011). Necessary and sufficient conditions for undecidability of the Gödel sentence and its truth. In DeVidi, D., Hallett, M., and Clark, P., editors. Logic, Mathematics, Philosophy: Vintage Enthusiasms. Essays in Honour of John L. Bell. The Western Ontario Series in Philosophy of Science, Vol. 75. Dordrecht: Springer, pp. 135152.
Jeroslow, R. G. (1975). Experimental logics and ${\rm{\Delta }}_2^0$ -theories. Journal of Philosophical Logic, 4(3), 253267.
Kaså, M. (2012). Experimental logics, mechanism and knowable consistency. Theoria, 78(3), 213224.
Kaye, R. (1991). Models of Peano Arithmetic. Oxford Logic Guides, Vol. 15. New York: Oxford Science Publications.
Kreisel, G. (1957). A refinement of ω-consistency (abstract). The Journal of Symbolic Logic, 22, 108109.
Kreisel, G. & Lévy, A. (1968). Reflection principles and their use for establishing the complexity of axiomatic systems. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 14, 97142.
Lindström, P. (1997). Aspects of Incompleteness. Lecture Notes in Logic, Vol. 10. Berlin: Springer-Verlag.
Mostowski, A. (1952). On models of axiomatic systems. Fundamenta Mathematicae, 39, 133158.
Niebergall, K.-G. (2005). “Natural” representations and extensions of Gödel’s second theorem. In Baaz, M., Friedman, S.-D., and K., J., editors. Logic Colloquium ’01. Urbana, IL, and Wellesley, MA: Association for Symbolic Logic/A K Peters, pp. 350368.
Rosser, J. B. (1936). Extensions of some theorems of Gödel and Church. The Journal of Symbolic Logic, 1(3), 8791.
Rosser, J. B. (1937). Gödel theorems for nonconstructive logics. The Journal of Symbolic Logic, 2(3), 129137.
Smoryński, C. (1977a). The incompleteness theorems. In Barwise, J., editor. Handbook of Mathematical Logic. Studies in Logic and the Foundations of Mathematics, Vol. 90. Amsterdam: North-Holland Publishing, pp. 821865.
Smoryński, C. (1977b). ω-consistency and reflection. In Colloque International de Logique: Clermont-Ferrand, 18–25 juillet 1975. Paris: Editions du C.N.R.S., pp. 167181.
Smoryński, C. (1985). Self-reference and Modal Logic. Universitext. New York: Springer-Verlag.

Keywords

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed