DeepAI AI Chat
Log In Sign Up

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

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

I use mechanized verification to examine several first- and higher-order formalizations of Anselm's Ontological Argument against the charge of begging the question. I propose three different but related criteria for a premise to beg the question in fully formal proofs and find that one or another applies to all the formalizations examined. I also show that all these formalizations entail variants that are vacuous, in the sense that they apply no interpretation to "than which there is no greater" and are therefore vulnerable to Gaunilo's refutation. My purpose is to demonstrate that mechanized verification provides an effective and reliable technique to perform these analyses; readers may decide whether the forms of question begging and vacuity so identified affect their interest in the Argument or its various formalizations. This version updates the paper that originally appeared as Chapter 13 in "Beyond Faith and Rationality: Essays on Logic, Religion and Philosophy" published by Springer to respond to criticisms by Oppenheimer and Zalta.

READ FULL TEXT

page 1

page 2

page 3

page 4

05/17/2022

Mechanized Analysis of Anselm's Modal Ontological Argument

We use a mechanized verification system, PVS, to examine the argument fr...
10/06/2021

A New Conjecture About Identity of Proofs

A central problem in proof-theory is that of finding criteria for identi...
05/06/2022

Wetzel: Formalisation of an Undecidable Problem Linked to the Continuum Hypothesis

In 1964, Paul Erdős published a paper settling a question about function...
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...
10/15/2019

Probability Logic

This chapter presents probability logic as a rationality framework for h...
08/28/2007

Formally Verified Argument Reduction with a Fused-Multiply-Add

Cody & Waite argument reduction technique works perfectly for reasonably...