Formalization, Mechanization and Automation of Gödel's Proof of God's Existence

08/21/2013
by   Christoph Benzmüller, et al.
0

Gödel'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.

READ FULL TEXT

page 1

page 2

research
08/14/2022

Who Finds the Short Proof? An Exploration of Variants of Boolos' Curious Inference using Higher-order Automated Theorem Provers

This paper reports on an exploration of variants of Boolos' curious infe...
research
04/28/2021

A Mechanised Proof of Gödel's Incompleteness Theorems using Nominal Isabelle

An Isabelle/HOL formalisation of Gödel's two incompleteness theorems is ...
research
10/10/2018

Convex Functions in ACL2(r)

This paper builds upon our prior formalisation of R^n in ACL2(r) by pres...
research
05/24/2022

Syntheto: A Surface Language for APT and ACL2

Syntheto is a surface language for carrying out formally verified progra...
research
01/30/2020

Toward a Mechanized Compendium of Gradual Typing

The research on gradual typing has grown considerably over the last deca...
research
10/27/2019

Formalising perfectoid spaces

Perfectoid spaces are sophisticated objects in arithmetic geometry intro...
research
01/10/2019

Mechanization of Separation in Generic Extensions

We mechanize, in the proof assistant Isabelle, a proof of the axiom-sche...

Please sign up or login with your details

Forgot password? Click here to reset