论文标题
计算机说，（简化的）至尊必须存在：计算机探索了戈德尔本体论论点的变体
A (Simplified) Supreme Being Necessarily Exists, says the Computer: Computationally Explored Variants of Gödel's Ontological Argument
论文作者
论文摘要
经典高阶逻辑中通用（meta-）逻辑推理的一种方法用于探索和研究KurtGödel的模态本体论论点的简化。某些参数前提是修改的，其他参数倒塌，避免了模态崩溃，并且在弱模态逻辑K和T中已经显示了有效性。对Gödel的原始理论的简化为关键是对滤波器的链接的开发和超级替代者的链接的开发。本文说明了量化非古典逻辑的现代知识表示和推理技术如何为其他学科贡献新知识。该贡献的材料也非常适合支持课堂上非平凡的逻辑形式主义的教学。
An approach to universal (meta-)logical reasoning in classical higher-order logic is employed to explore and study simplifications of Kurt Gödel's modal ontological argument. Some argument premises are modified, others are dropped, modal collapse is avoided and validity is shown already in weak modal logics K and T. Key to the gained simplifications of Gödel's original theory is the exploitation of a link to the notions of filter and ultrafilter from topology. The paper illustrates how modern knowledge representation and reasoning technology for quantified non-classical logics can contribute new knowledge to other disciplines. The contributed material is also well suited to support teaching of non-trivial logic formalisms in classroom.
