Dear Friends,
For those in the world who mistakenly assume that science contradicts the existence of God, I present to you this scientifically 100% solid and indisputable proof that God's really exists.
I am aware there are a lot of Christians in the world who already figured this out, simply by reading the Holy Bible, but my hope is that this solid scientific proof will help those who so far have refused to take God's word seriously.
Yours in Christ,
Pastor J.C. Manning, M.D., Ph.D.
Summary: Goedel's ontological proof has been analysed for the first-time with an unprecedent degree of detail and formality with the help of higher-order theorem provers. The following has been done (and in this order): A detailed natural deduction proof. A formalization of the axioms, definitions and theorems in the TPTP THF syntax. Automatic verification of the consistency of the axioms and definitions with Nitpick. Automatic demonstration of the theorems with the provers LEO-II and Satallax. A step-by-step formalization using the Coq proof assistant. A formalization using the Isabelle proof assistant, where the theorems (and some additional lemmata) have been automated with Sledgehammer and Metis.
Subjects: Logic in Computer Science (cs.LO); Artificial Intelligence (cs.AI); Logic (math.LO)
MSC classes: 03Axx, 68T27, 68T30, 68T15
ACM classes: F.4.1; I.2.3; I.2.4
Cite as: arXiv:1308.4526 [cs.LO]

For those in the world who mistakenly assume that science contradicts the existence of God, I present to you this scientifically 100% solid and indisputable proof that God's really exists.
I am aware there are a lot of Christians in the world who already figured this out, simply by reading the Holy Bible, but my hope is that this solid scientific proof will help those who so far have refused to take God's word seriously.
Yours in Christ,
Pastor J.C. Manning, M.D., Ph.D.
Summary: Goedel's ontological proof has been analysed for the first-time with an unprecedent degree of detail and formality with the help of higher-order theorem provers. The following has been done (and in this order): A detailed natural deduction proof. A formalization of the axioms, definitions and theorems in the TPTP THF syntax. Automatic verification of the consistency of the axioms and definitions with Nitpick. Automatic demonstration of the theorems with the provers LEO-II and Satallax. A step-by-step formalization using the Coq proof assistant. A formalization using the Isabelle proof assistant, where the theorems (and some additional lemmata) have been automated with Sledgehammer and Metis.
Subjects: Logic in Computer Science (cs.LO); Artificial Intelligence (cs.AI); Logic (math.LO)
MSC classes: 03Axx, 68T27, 68T30, 68T15
ACM classes: F.4.1; I.2.3; I.2.4
Cite as: arXiv:1308.4526 [cs.LO]


Comment