Mechanized Analysis of Anselm's Modal Ontological Argument
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:FUVH6LYSrecord.jsonopen to challenge →
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.