Mechanized analysis of Anselm’s modal ontological argument

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 t...

Description complète

Enregistré dans:  
Détails bibliographiques
Auteur principal: Rushby, John (Auteur)
Type de support: Électronique Article
Langue:Anglais
Vérifier la disponibilité: HBZ Gateway
Journals Online & Print:
En cours de chargement...
Fernleihe:Fernleihe für die Fachinformationsdienste
Publié: Springer Science + Business Media B. V 2021
Dans: International journal for philosophy of religion
Année: 2021, Volume: 89, Numéro: 2, Pages: 135-152
Sujets / Chaînes de mots-clés standardisés:B Anselm, Canterbury, Erzbischof, Heiliger 1033-1109, Proslogion / Preuve ontologique de l’existence de Dieu
RelBib Classification:AB Philosophie de la religion
NBC Dieu
Sujets non-standardisés:B Proslogion III
B Ontological Argument
B Modal argument
B PVS
B existence of God
B Anselm
Accès en ligne: Accès probablement gratuit
Volltext (lizenzpflichtig)
Description
Résumé: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 Philiosophy and, in addition, shows how these methods can help detect and rectify errors in modal reasoning.
ISSN:1572-8684
Contient:Enthalten in: International journal for philosophy of religion
Persistent identifiers:DOI: 10.1007/s11153-020-09768-6