A Computationally-Discovered Simplification of the Ontological Argument

@article{Oppenheimer2011ACS,
  title={A Computationally-Discovered Simplification of the Ontological Argument},
  author={Paul E. Oppenheimer and E. Zalta},
  journal={Australasian Journal of Philosophy},
  year={2011},
  volume={89},
  pages={333 - 349}
}
  • Paul E. Oppenheimer, E. Zalta
  • Published 2011
  • Computer Science
  • Australasian Journal of Philosophy
  • 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… CONTINUE READING
    31 Citations
    On the PROVER9 Ontological Argument
    • 1
    The Ontological Argument in PVS
    • 20
    • Highly Influenced
    • PDF
    Variants of Gödel’s Ontological Proof in a Natural Deduction Calculus
    • 3
    • PDF
    A Case Study On Computational Hermeneutics: E. J. Lowe's Modal Ontological Argument
    • 12
    • PDF
    Can Computers Help to Sharpen our Understanding of Ontological Arguments
    • 4
    • PDF

    References

    SHOWING 1-10 OF 21 REFERENCES
    Steps Toward a Computational Metaphysics
    • 28
    • PDF
    Mace4 Reference Manual and Guide
    • W. McCune
    • Computer Science, Mathematics
    • ArXiv
    • 2003
    • 126
    • PDF
    OTTER 3.3 Reference Manual
    • W. McCune
    • Computer Science, Mathematics
    • ArXiv
    • 2003
    • 153
    • PDF
    2003b, Mace4 Reference Manual and Guide (Tech
    • Memo ANL/MCS-TM-264, Mathematics and Computer Science Division),
    • 2003
    II.—On Denoting
    • 1,045
    • PDF
    Logisch-kombinatorische Untersuchungen u¨ber die Erfu¨llbarkeit oder Beweisbarkeit mathematischer Sa¨tze nebst einem Theoreme u¨ber dichte Mengen
    • Videnskapsselskapet Skrifter, I. Matematisk-naturvidenskabelig Klasse
    • 1920
    Logisch-kombinatorische Untersuchungen über die Erfüllbarkeit oder Beweisbarkeit mathematischer Sätze nebst einem Theoreme über dichte Mengen’, Videnskapsselskapet Skrifter, I
    • Matematisk-naturvidenskabelig Klasse,
    • 1920
    Logisch-kombinatorische UntersuchungenUntersuchungen¨Untersuchungenüber die Erfüllbarkeit oder Beweisbarkeit mathematischer Sätze nebst einem Theoremë uber dichte Mengen
    • Videnskapsselskapet Skrifter, I. Matematisk-naturvidenskabelig Klasse
    • 1920