The great mathematician and logician Kurt Gödel, who died in 1978, left behind a series of equations that purport to prove the existence of God.

As I understand it (and I don’t understand the math!), the equations test the validity of St. Anselm’s ontological argument for God’s existence, which defines God as the greatest being that can be conceived. Such a being would have to have the property of existence; otherwise, we could conceive of a greater being, namely, one that exists. And that one would be God.

This sounds like a language game, but philosophers have wrestled with the argument for centuries, finding it more formidable than it might appear on the surface.

Now two European computer scientists have run Gödel’s mathematical proof on a computer and found it valid.

You do the math:

“Ax. 1. {P(φ)∧◻∀x[φ(x)→ψ(x)]} →P(ψ)Ax. 2.P(¬φ)↔¬P(φ)Th. 1.P(φ)→◊∃x[φ(x)]Df. 1.G(x)⟺∀φ[P(φ)→φ(x)]Ax. 3.P(G)Th. 2.◊∃xG(x)Df. 2.φ ess x⟺φ(x)∧∀ψ{ψ(x)→◻∀y[φ(y)→ψ(y)]}Ax. 4.P(φ)→◻P(φ)Th. 3.G(x)→G ess xDf. 3.E(x)⟺∀φ[φ ess x→◻∃yφ(y)]Ax. 5.P(E)Th. 4.◻∃xG(x)”.

After the jump, a news story on the computer scientists’ work. I also include Gödel’s proof and a link explaining the above mathematical notation. [Read more…]

## Follow Cranach!