Ad
related to: kurt gödel proof of existence of christ scripture study
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).
He formulated a formal proof for the existence of God known as Gödel's ontological proof. Gödel believed in an afterlife, saying, "Of course this supposes that there are many relationships which today's science and received wisdom haven't any inkling of.
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.
Kurt Gödel (1906–1978) was the preeminent mathematical logician of the twentieth century who described his theistic belief as independent of theology. [25] He also composed a formal argument for God's existence known as Gödel's ontological proof.
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.
Kurt Gödel created a formalization of Leibniz' version, known as Gödel's ontological proof. [ 1 ] A more recent argument was made by Stephen D. Unwin in 2003, who suggested the use of Bayesian probability to estimate the probability of God's existence.
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]
Gödel shows that many properties of these proofs can be defined within any theory of arithmetic that is strong enough to define the primitive recursive functions. (The contemporary terminology for recursive functions and primitive recursive functions had not yet been established when the paper was published; Gödel used the word rekursiv ...