|
|||||
|
|
Prover9's Simplification Explained Away |
|
| Authors: | Paweł Garbacz |
| Affiliation: | The John Paul II Catholic University of Lublin |
| 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 applied. |
| Keywords: | automatic theorem proving ontological argument logic |