When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Gödel's ontological proof - Wikipedia

    en.wikipedia.org/wiki/Gödel's_ontological_proof

    A humorous variant of Gödel's ontological proof is mentioned in Quentin Canterel's novel The Jolly Coroner. [26] [page needed] The proof is also mentioned in the TV series Hand of God. [specify] Jeffrey Kegler's 2007 novel The God Proof depicts the (fictional) rediscovery of Gödel's lost notebook about the ontological proof. [27]

  3. Kurt Gödel - Wikipedia

    en.wikipedia.org/wiki/Kurt_Gödel

    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.

  4. Category:Works by Kurt Gödel - Wikipedia

    en.wikipedia.org/wiki/Category:Works_by_Kurt_Gödel

    Download as PDF; Printable version; ... The following 10 pages are in this category, out of 10 total. ... Gödel's ontological proof;

  5. Modal collapse - Wikipedia

    en.wikipedia.org/wiki/Modal_collapse

    In the context of philosophy, the term is commonly used in critiques of ontological arguments for the existence of God and the principle of divine simplicity. [1] [3] For example, Gödel's ontological proof contains as a theorem, which combined with the axioms of system S5 leads to modal collapse. [4]

  6. Gödel's proof - Wikipedia

    en.wikipedia.org/wiki/Gödel's_proof

    Download as PDF; Printable version ... move to sidebar hide. Gödel's proof may refer to: Gödel's incompleteness theorems ... Gödel's ontological proof; See also ...

  7. Talk:Gödel's ontological proof/Archive 2 - Wikipedia

    en.wikipedia.org/wiki/Talk:Gödel's_ontological...

    Help; Learn to edit; Community portal; Recent changes; Upload file; Special pages

  8. Proof sketch for Gödel's first incompleteness theorem

    en.wikipedia.org/wiki/Proof_sketch_for_Gödel's...

    Fx ↔ ∃y((y = [10] × [k]) ∧ Axy). k = the number of symbols appearing in Axy. Fx formalizes Berry's paradox. The balance of the proof, requiring but 12 lines of text, shows that the sentence ∀x(Fx↔(x = [n])) is true for some number n, but no algorithm M will identify it as true. Hence in arithmetic, truth outruns proof.

  9. Original proof of Gödel's completeness theorem - Wikipedia

    en.wikipedia.org/wiki/Original_proof_of_Gödel's...

    Kurt Gödel (1925) The proof of Gödel's completeness theorem given by Kurt Gödel in his doctoral dissertation of 1929 (and a shorter version of the proof, published as an article in 1930, titled "The completeness of the axioms of the functional calculus of logic" (in German)) is not easy to read today; it uses concepts and formalisms that are no longer used and terminology that is often obscure.