- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Prover9's Simplification Explained Away
Australasian Journal of Philosophy 90 (3):585 - 592 (2012)
Abstract
This note discusses P. Oppenheimer and E. Zalta's ?A Computationally-Discovered Simplification of the Ontological Argument? [this journal, 2011]. I try to explain why the simplification presented there was successful and comment on the technical aspects of the method they appliedAuthor's Profile
Other Versions
No versions found
My notes
Similar books and articles
A Computationally-Discovered Simplification of the Ontological Argument.Paul E. Oppenheimer - 2011 - Australasian Journal of Philosophy 89 (2):333-349.
A computationally-discovered simplification of the ontological argument.Paul Oppenheimer & Edward N. Zalta - 2011 - Australasian Journal of Philosophy 89 (2):333 - 349.
Artificial Intelligence and in God's Existence: Connecting Philosophy of Religion and Computation.Andrea Vestrucci - 2022 - Zygon 57 (4):1000-1018.
Why is conjunctive simplification invalid?Bruce E. R. Thompson - 1991 - Notre Dame Journal of Formal Logic 32 (2):248-254.
A simplification of the Bachmann method for generating large countable ordinals.Jane Bridge - 1975 - Journal of Symbolic Logic 40 (2):171-185.
The Simplification of Life: From the Writings of E. Carpenter Selected by H. Roberts.Edward Carpenter & Harry Roberts - 1905
Flexible heuristics for simplification with conditional lemmas by marking formulas as forbidden, mandatory, obligatory, and generous.Tobias Schmidt-Samoa - 2006 - Journal of Applied Non-Classical Logics 16 (1-2):209-239.
Aspects of simplification in mathematics teaching.Arnold Kirsch & John Scherk - 2000 - In Ian Westbury, Stefan Hopmann & Kurt Riquarts (eds.), Teaching as a reflective practice: the German Didaktik tradition. Mahwah, N.J.: L. Erlbaum Associates. pp. 267--284.
A Simplified Variant of Gödel’s Ontological Argument.Christoph Benzmüller - 2023 - In Vestrucci Andrea (ed.), Beyond Babel: Religion and Linguistic Pluralism. Springer Verlag. pp. 271-286.
Explain it as simple as possible, but no simpler – Explanation via model simplification for addressing inferential gap.Sarath Sreedharan, Siddharth Srivastava & Subbarao Kambhampati - 2025 - Artificial Intelligence 340 (C):104279.
Analytics
Added to PP
2011-12-16
Downloads
64 (#332,430)
6 months
13 (#264,153)
2011-12-16
Downloads
64 (#332,430)
6 months
13 (#264,153)
Historical graph of downloads
Author's Profile
Citations of this work
On Anselm’s Ontological Argument in Proslogion II.Paul E. Oppenheimer & Edward N. Zalta - 2021 - History of Philosophy & Logical Analysis 25 (2):327-351.
Artificial Intelligence and in God's Existence: Connecting Philosophy of Religion and Computation.Andrea Vestrucci - 2022 - Zygon 57 (4):1000-1018.
References found in this work
A computationally-discovered simplification of the ontological argument.Paul Oppenheimer & Edward N. Zalta - 2011 - Australasian Journal of Philosophy 89 (2):333 - 349.
A Computationally-Discovered Simplification of the Ontological Argument.Paul E. Oppenheimer - 2011 - Australasian Journal of Philosophy 89 (2):333-349.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-648784bb4d-ls7fw uwo