Pith. sign in

REVIEW

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2205.14071 v2 pith:FKK7EDXE submitted 2022-05-27 cs.LO

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

classification cs.LO
keywords formalizationsquestionargumentbegginganselmmechanizedontologicalvacuity
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.