Prover9's Simplification Explained Away
Paweł Garbacz · Australasian Journal of Philosophy · 2011
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.