Creation Moment 11/2/2013 - Computer "Proof" of GOD

But God hath revealed them unto us by his Spirit: for the Spirit searcheth all things, yea, the deep things of God.

1 Corinthians 2:10

Holy Logic: Computer Scientists 'Prove' God Exists

"When Gödel died in 1978, he left behind a tantalizing theory based on principles of modal logic -- that a higher being must exist. The details of the mathematics involved in Gödel's ontological proof are complicated, but in essence the Austrian was arguing that, by definition, God is that for which no greater can be conceived. And while God exists in the understanding of the concept, we could conceive of him as greater if he existed in reality. Therefore, he must exist.

That is where Christoph Benzmüller of Berlin's Free University and his colleague, Bruno Woltzenlogel Paleo of the Technical University in Vienna, come in. Using an ordinary MacBook computer, they have shown that Gödel's proof was correct -- at least on a mathematical level -- by way of higher modal logic.
The name Gödel may not mean much to some, but among scientists he enjoys a reputation similar to the likes of Albert Einstein -- who was a close friend.
Ultimately, the formalization of Gödel's ontological proof is unlikely to win over many atheists, nor is it likely to comfort true believers, who might argue the idea of a higher power is one that defies logic by definition. For mathematicians looking for ways to break new ground, however, the news could represent an answer to their prayers." SpiegelOnline

"Sometime between 1941 and the 1970s, Gödel wrote a brief mathematical proof that God exists----five axioms that we assume to be true:

1. Any “property”, or the negation of that property, is “positive”; but it is impossible that both the property and negation are positive.
2. If one positive property implies that some property necessarily exists, then the implied property is positive.
3. The property of being God-like is positive.
4. Positive properties are necessarily positive.
5. The property of necessarily existing is positive.

Gödel added three definitions along the way:

1. A “God-like” being has all positive properties.
2. An “essence” of a being is a property that the being possesses, and that property necessarily implies any property of that being.
3. The “necessary existence” of a being means that it is necessary that all the essences of that being exist (“are exemplified”).

The ancient Greek philosopher and mathematician Euclid laid the foundations of geometry in exactly the same way that Gödel constructed his proof that God exists. Euclid also provided axioms and definitions, then built theorem upon theorem by applying logic. Euclid’s results are still valid; mathematicians still use his approach.

A team of logicians and computer scientists collaborated to encode Gödel’s proof and verify it with several computer programs. These particular programs had to deal with “modal logic”, which can handle statements about “possibility” and “necessity.”
These sophisticated programs have somewhat understated names such as “Nitpick,” “Sledgehammer” and “Metis.” Apparently a MacBook computer can be powerful enough to run them.

Benzmüller and Paleo’s paper states that they used several different modal logic systems to verify Gödel’s proof. Those are different logic systems, not just different computer programs. The logic systems were:

• ‘K’, a “weak” logical system named for logician Saul Kripke;
• ‘B’ logic adds “A implies the necessity of the possibility of A” to ‘K’ logic.
• ‘S4′ and ‘S5′ logic allow some simplification of repeated “possibility” and “necessity” operations; see below.

‘K’ logic extends typical propositional logic by adding two axioms for necessity and also the concept of possibility:

• If A is a theorem in ‘K’, then “the necessity of A” is also a theorem in ‘K’.
• If it is necessary that “A implies B“, then “the necessity of A ” implies “B is necessary”.
• The “possibility of A” is equivalent to “it is not necessary that A is false”.

‘S4′ logic permits reducing a string of repeated necessities to one necessity, and a string of repeated possibilities to a single possibility." DecodedScience

"Mathematician KURT GODEL

He turned the lens of mathematics on itself and hit upon his famous incompleteness theorem--driving a stake through the heart of formalism

 

Kurt Godel was born in 1906 in Brunn, then part of the Austro-Hungarian Empire and now part of the Czech Republic, to a father who owned a textile factory and had a fondness for logic and reason and a mother who believed in starting her son's education early. By age 10, Godel was studying math, religion and several languages. By 25 he had produced what many consider the most important result of 20th century mathematics: his famous "incompleteness theorem." Time

 

 

"Gödel based his argument on an early argument of St. Anselm's. St. Anselm defined God as the greatest being in the universe. No greater being could be imagined. However, if God did not exist, then a greater being had to be possible to imagine - one which exists. Since it wasn't possible, by definition, to imagine a greater being than the greatest being imaginable, God had to exist.

Gödel twisted this argument a little. He used modal logic to prove his point. Modal logic distinguishes between certain different states that certain suppositions have. Some suppositions are possible in some worlds, some possible only in a certain world, and some true in all possible worlds. If they are true in all possible worlds, they are considered to be always 'necessary'.

God can either necessarily exist, or necessarily not exist. If God is an all-powerful being, and he exists, he necessarily exists in all possible worlds. If he doesn't exist, he necessarily doesn't exist in any possible worlds. It is not possible to say that God does not exist in any possible world. No matter how slim the chance is, God might exist. That means that God can't necessarily not exist. Since the choices are either God necessarily does exist, or necessarily doesn't, and we have eliminated the possibility that he necessarily doesn't, the only possibility left is that he necessarily does." WelcomeToTheFuture

 

 

"IF it is possible for a rational omniscient being to exist THEN necessarily a rational omniscient being exists.

We can write this in the symbolism of modal logic as g g where g is the statement that a rational omniscient being exists. The symbol that looks like a magnet on its side represents material implication. The statement ab is true for material implication if it is not the case that a is true and b is false. We can also write the conclusion above as ~g g where denotes weak disjunction -- equivalent to "and/or" in ordinary parlance, and ~ denotes negation. Other operators include ab, "a is equivalent to b" and a&b, "a and b". The symbols and are called modal operators, and denote the concept of necessary (as opposed to contingent or accidental) truth, and possible truth. For example, the statement (there is a prime number between n and 2n for all positive integers n) is true because the statement is provable, and hence necessarily true. However (a tree grows in Brooklyn) is false, as I understand trees and Brooklyn. That a tree grows in Brooklyn is a contingent or accidental truth, best formalized as t & ~t where t is the statement that "a tree grows in Brooklyn." We don't really need two modal operators, because it is possible to write in terms of and vice versa. Thus (a ~~a)& (a ~~a) is a tautology. We must not presume that the only necessary truths are those which we can prove. Gödel showed the weakness of that presumption with his first and second incompleteness theorems." CS