Mechanized Analysis of Anselm's Modal Ontological Argument

05/17/2022
by   John Rushby, et al.
0

We use a mechanized verification system, PVS, to examine the argument from Anselm's Proslogion Chapter III, the so-called "Modal Ontological Argument." We consider several published formalizations for the argument and show they are all essentially similar. Furthermore, we show that the argument is trivial once the modal axioms are taken into account. This work is an illustration of computational philosophy and, in addition, shows how these methods can help detect and rectify errors in modal reasoning. This is a minor update with better typesetting and some small addenda to a paper published in the International Journal for Philosophy of Religion, vol. 89, pp. 135–152, April 2021.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/27/2022

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...
research
10/20/2019

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

Three variants of Kurt Gödel's ontological argument, as proposed byDana ...
research
01/14/2020

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

A simplified variant of Kurt Gödel's modal ontological argument is prese...
research
02/13/2022

A Simplified Variant of Gödel's Ontological Argument

A simplified variant of Gödel's ontological argument is presented. The s...
research
03/06/2013

Argument Calculus and Networks

A major reason behind the success of probability calculus is that it pos...
research
06/26/2023

Sciama's argument on life in a random universe: Distinguishing apples from oranges

Dennis Sciama argued that the existence of life depended on many quantit...

Please sign up or login with your details

Forgot password? Click here to reset