Abstract
We present an abstract framework in which we give simple proofs for Gödel’s First and Second Incompleteness Theorems and obtain, as consequences, Davis’, Chaitin’s and Kritchman-Raz’s Theorems.
This is a preview of subscription content, log in via an institution to check access.
We’re sorry, something doesn't seem to be working properly.
Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.
References
Avigad, J., Computability and Incompleteness-Lectures Notes, https://www.andrew.cmu.edu/user/avigad/Teaching/candinotes.pdf, 2007.
Calude, C., Information and Randomness—An Algorithmic Perspective, 2nd ed., Springer, Berlin, 2002.
Calude, C., and G. Păun, Independent instances for some undecidable problems, RAIRO-Theoretical Informatics and Applications-Informatique Théorique et Applications 17(1):49–54, 1983.
Calude, C. S., and S. Rudeanu, Proving as a computable procedure, Fundamenta Informaticae 64(1–4):43–52, 2005.
Chaitin, G. J., Computational complexity and Gödel’s incompleteness theorem, ACM SIGACT News 9:11–12, 1971.
Chaitin, G. J., Information-Theoretic Incompleteness, World Scientific, Singapore, 1992.
Copeland, B. J., (ed.), The Essential Turing: Seminal Writings in Computing, Logic, Philosophy, Artificial Intelligence, and Artificial Life plus The Secrets of Enigma, Oxford University Press, Oxford, 2004.
Davis, M., Here There Be Monsters, Presentation at Courant Institute, NYU.
Davis, M., Computability and Unsolvability, McGraw-Hill, New York, 1958.
Davis, M., What is a computation?, in C. S. Calude, Randomness and Complexity. From Leibniz to Chaitin, World Scientific Publishing, Singapore, 2007, pp. 89–113.
Davis, M., The Universal Computer: the Road from Leibniz to Turing, W. W. Norton Company, New York, 2017.
Gödel, K., Über die Vollständigkeit des Logikkalküls, Ph.D. thesis, University of Vienna, 1929.
Gödel, K., Uber formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I, Monatshefte für Mathematik 38:173–198, 1931.
Gödel, K., Postscriptum, in M. Davis, (ed.), The Undecidable. Basic Papers on Undecidable, Unsolvable Problems and Computable Functions, Raven Press, Hewlett, N.Y., 1965, pp. 71–72.
Hintikka, J., On Gödel, Wadsworth, 2000.
Kleene, S. C., Introduction to Metamathematics, North-Holland, Amsterdam, 1952.
Kritchman, S., and R. Raz, The surprise examination paradox and the second incompleteness theorem, Notices of the AMS 57(11):1454–1458, 2010.
Longo, G., Interfaces of incompleteness, in G. Minati, M. R. Abram, and E. Pessa, (eds.), Systemics of Incompleteness and Quasi-Systems, Springer Nature, 2019, pp. 3–55.
Murawski, R., Undefinability of truth. the problem of the priority: Tarski vs. Gödel, History and Philosophy of Logic 19:153–160, 1998.
Post, E. L., Introduction to a general theory of elementary propositions, American Journal of Mathematics 43(3):163–185, 1921.
Sipser, M., Introduction to the Theory of Computation, 3rd ed., Cengage Learning, 2013.
Smith, P., An Introduction to Gödel’s Theorems, Cambridge University Press, Cambridge, UK, 2013.
Tarski, A., Pojęscie prawdy w językach nauk dedukcyjnych, Towarzystwo Naukowe Warszawskie, Warszawa, 1933.
Acknowledgements
This paper was inspired by many discussions on Gödel’s incompleteness with G. Longo and, particularly, his recent paper [18]. I am grateful to M. Davis, F. Kroon, L. Staiger, K. Svozil and A. Withy for comments which improved the paper.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Calude, C.S. Incompleteness and the Halting Problem. Stud Logica 109, 1159–1169 (2021). https://doi.org/10.1007/s11225-021-09945-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11225-021-09945-2