A Computationally-Discovered Simplification of the Ontological Argument

Australasian Journal of Philosophy 89 (2):333-349 (2011)
  Copy   BIBTEX

Abstract

The authors investigated the ontological argument computationally. The premises and conclusion of the argument are represented in the syntax understood by the automated reasoning engine PROVER9. Using the logic of definite descriptions, the authors developed a valid representation of the argument that required three non-logical premises. PROVER9, however, discovered a simpler valid argument for God's existence from a single non-logical premise. Reducing the argument to one non-logical premise brings the investigation of the soundness of the argument into better focus. Also, the simpler representation of the argument brings out clearly how the ontological argument constitutes an early example of a ‘diagonal argument’ and, moreover, one used to establish a positive conclusion rather than a paradox.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,636

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2017-02-20

Downloads
20 (#1,046,673)

6 months
6 (#879,768)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Paul Edward Oppenheimer
Stanford University

References found in this work

No references found.

Add more references