A Computationally-Discovered Simplification of the Ontological Argument
A Computationally-Discovered Simplification of the Ontological Argument
复制标题
本体论论证的计算发现的简化
DOI：
10.1080/00048401003674482
复制
发表时间：
2011
影响因子：
1
通讯作者：
E. Zalta
中科院分区：
文献类型：
--
作者：
P. Oppenheimer;E. Zalta
作者研究了计算的本体论的论点。论证的前提和结论以自动推理引擎PROVER9理解的语法表示。使用明确描述的逻辑，作者开发了一个有效的表示的论点，需要三个非逻辑前提。然而，PROVER9从一个非逻辑的前提中发现了一个更简单的有效论证。将论证简化为一个非逻辑前提，可以更好地关注论证的合理性。此外，更简单的表示的论点清楚地带出如何本体论的论点构成了一个早期的例子，一个“对角线的论点”，而且，一个用来建立一个积极的结论，而不是一个悖论。
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 brings the investigation of the soundness of the argument into better focus. Also, the simpler representation of the argument brings out clearly how the ontological argument constitutes an early example of a ‘diagonal argument’ and, moreover, one used to establish a positive conclusion rather than a paradox.