Advertisement

Gödel’s Second Theorem and the Provability of God’s Existence

  • Meir BuzagloEmail author
Article
  • 18 Downloads

Abstract

According to a common view, belief in God cannot be proved and is an issue that must be left to faith. Kant went even further and argued that he can prove this unprovability. But any argument implying that a certain sentence is not provable is challenged by Gödel’s second theorem (GST). Indeed, one trivial consequence of GST is that for any formal system F that satisfies certain conditions and for every sentence K that is formulated in F it is impossible to prove, from F, that K is not provable. In the article, I explore the general issue of proving the unprovability of the existence of God. Of special interest is the question of the relation between the existence of God and the conditions that F must satisfy in order to allow for its subjection to GST.

Keywords

Gödel’s second theorem Theology Unprovability Kant Al-Ghazâlî 

Mathematics Subject Classification

Primary 03B35 Secondary 03B25 03B42 01A30 01A50 

Notes

References

  1. 1.
    Al-Ghazâlî, A.H.: The Incoherence of the Philosophers / Tahâfut al-falâsifa, a Parallel English–Arabic Text. M.E. Marmura (ed. and tr.) 2nd edn. Brigham Young University Press, Provo (2000)Google Scholar
  2. 2.
    Boolos, G.S.: Gödel’s second incompleteness theorem explained in words of one syllable. Mind 103, 1–3 (1994)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Boolos, G.S., Burges, J.P., Jeffery, R.C.: Computability and Logic, 5th edn. Cambridge University Press, Cambridge (2007)CrossRefGoogle Scholar
  4. 4.
    Franzén, T.: Gödel’s Theorem: An Incomplete Guide to Its Use and Abuse. A K Peters, Wellesley (2005)CrossRefGoogle Scholar
  5. 5.
    Kant, I.: Critique of Pure Reason. Norman Kemp Smith (tr.). St. Martin’s, New York (1965)Google Scholar
  6. 6.
    Meyer, R.K.: God Exists!. Noûs 3, 345–361 (1987)CrossRefGoogle Scholar
  7. 7.
    Oppenheimer, P.E., Zalta, E.N.: On the logic of the ontological argument. Philos. Perspect. 5, 509–529 (1991)CrossRefGoogle Scholar
  8. 8.
    Oppenheimer, P.E., Zalta, E.N.: A computationally-discovered simplification of the ontological argument. Australas. J. Philos. 89, 333–349 (2011)CrossRefGoogle Scholar
  9. 9.
    Plantinga, A.: God and Other Minds. Cornell University Press, New York (1967)Google Scholar
  10. 10.
    Raattkainen, P.: On the philosophical relevance of Gödel’s incompleteness theorems. Rev. Int. Philos. 4, 513–534 (2005) Google Scholar
  11. 11.
    Ramharter, R., Eder, G.: Formal reconstructions of St. Anselm’s ontological argument. Synthese 192, 2795–2825 (2015)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Steiner, M.: The Applicability of Mathematics as a Philosophical Problem. Harvard University Press, Cambridge (2002)zbMATHGoogle Scholar
  13. 13.
    Wigner, E.P.: The Unreasonable Effectiveness of Mathematics in the Natural Sciences. Richard Courant lecture in mathematical sciences. New York University, New York (1959) Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Department of PhilosophyThe Hebrew University of Jerusalem (Mt Scopus Campus)JerusalemIsrael

Personalised recommendations