DeepAI AI Chat
Log In Sign Up

Computer-supported Analysis of Positive Properties, Ultrafilters and Modal Collapse in Variants of Gödel's Ontological Argument

by   Christoph Benzmüller, et al.

Three variants of Kurt Gödel's ontological argument, as proposed byDana Scott, C. Anthony Anderson and Melvin Fitting, are encoded and rigorously assessed on the computer. In contrast to Scott's version of Gödel's argument, the two variants contributed by Anderson and Fitting avoid modal collapse. Although they appear quite different on a cursory reading, they are in fact closely related, as our computer-supported formal analysis (conducted in the proof assistant system Isabelle/HOL) reveals. Key to our formal analysis is the utilization of suitably adapted notions of (modal) ultrafilters, and a careful distinction between extensions and intensions of positive properties.


page 1

page 2

page 3

page 4


Mechanized Analysis of Anselm's Modal Ontological Argument

We use a mechanized verification system, PVS, to examine the argument fr...

A (Simplified) Supreme Being Necessarily Exists – Says the Computer!

A simplified variant of Kurt Gödel's modal ontological argument is prese...

A Simplified Variant of Gödel's Ontological Argument

A simplified variant of Gödel's ontological argument is presented. The s...

A Mechanically Assisted Examination of Vacuity and Question Begging in Anselm's Ontological Argument

I use mechanized verification to examine several first- and higher-order...

AI, orthogonality and the Müller-Cannon instrumental vs general intelligence distinction

The by now standard argument put forth by Yudkowsky, Bostrom and others ...