A Computationally-Discovered Simplification of the Ontological Argument

@inproceedings{Oppenheimer2009ACS,
  title={A Computationally-Discovered Simplification of the Ontological Argument},
  author={Paul E. Oppenheimer and Edward N. Zalta},
  year={2009}
}
The authors investigate the ontological argument computationally. The premises and conclusion of the argument are represented in the syntax understood by the automated reasoning engine prover9. Though the authors used a valid representation of the argument that, in the context of the logic of definite descriptions, required three non-logical premises, prover9 discovered a simpler valid argument for God’s existence in that context from a single non-logical premise. Reducing the argument to one… CONTINUE READING

From This Paper

Topics from this paper.
12 Citations
9 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-9 of 9 references

The Ontological Argument, London: Macmillan

  • J. Barnes
  • 1972
1 Excerpt

Logisch-kombinatorische Untersuchungen über die Erfüllbarkeit oder Beweisbarkeit mathematischer Sätze nebst einem Theoreme über dichte Mengen’, Videnskapsselskapet Skrifter, I

  • T. Skolem
  • Matematisk-naturvidenskabelig Klasse,
  • 1920
1 Excerpt

Zalta , 2007 , ‘ Reflections on the Logic of the Ontological Argument

  • Oppenheimer, E Paul, N. Edward
  • Studia Neoaristotelica
  • 1920

On Denoting

  • B. Russell
  • Mind (new series),
  • 1905
1 Excerpt

Zalta , 1991 , ‘ On the Logic of the Ontological Argument ’

  • Oppenheimer, E. Paul, N. Edward
  • Philosophical Perspectives

Zalta , 2007 , ‘ Steps Towards a Computational Metaphysics

  • N. Edward
  • Journal of Philosophical Logic

Similar Papers

Loading similar papers…