Ad
related to: kurt godel proof of existence of christ book summary
Search results
Results From The WOW.Com Content Network
Gödel's ontological proof is a formal argument by the mathematician Kurt Gödel (1906–1978) for the existence of God. The argument is in a line of development that goes back to Anselm of Canterbury (1033–1109).
Gödel's ontological proof is a formal argument by the mathematician Kurt Gödel (1906–1978) for the existence of God. The argument is in a line of development that goes back to Anselm of Canterbury (1033–1109). St.
Versions of the story can also be found in Logical Dilemmas: The Life and Work of Kurt Gödel (1997) By John W. Dawson; E: His Life, His Thought and His Influence on Our Culture (2006), edited by Donald Goldsmith and Marcia Bartusiak; Incompleteness: The Proof and Paradox of Kurt Gödel (2006) by Rebecca Goldstein; Godel: A Life Of Logic, The ...
Thus one can define the Gödel number of a proof. Moreover, one may define a statement form Proof(x,y), which for every two numbers x and y is provable if and only if x is the Gödel number of a proof of the statement S and y = G(S). Proof(x,y) is in fact an arithmetical relation, just as "x + y = 6" is, though a much
From Frege to Gödel: A Source Book on Mathematical Logic 1879–1931. Harvard University Press. Bernard Meltzer (1962). On Formally Undecidable Propositions of Principia Mathematica and Related Systems. Translation of the German original by Kurt Gödel, 1931. Basic Books, 1962. Reprinted, Dover, 1992. ISBN 0-486-66980-7. Raymond Smullyan (1966).
In 2005 John Dawson published a biography, Logical Dilemmas: The Life and Work of Kurt Gödel. [54] Stephen Budiansky's book about Gödel's life, Journey to the Edge of Reason: The Life of Kurt Gödel, [55] was a New York Times Critics' Top Book of 2021. [56]
A more recent ontological argument came from Kurt Gödel, who proposed a formal argument for God's existence. Norman Malcolm also revived the ontological argument in 1960 when he located a second, stronger ontological argument in Anselm's work; Alvin Plantinga challenged this argument and proposed an alternative, based on modal logic.
In his 2nd problem he asked for a proof that "arithmetic" is "consistent". Kurt Gödel would prove in 1931 that, within what he called "P" (nowadays called Peano Arithmetic), "there exist undecidable sentences [propositions]". [4] Because of this, "the consistency of P is unprovable in P, provided P is consistent". [5]