DeepAI AI Chat
Log In Sign Up

A (Simplified) Supreme Being Necessarily Exists, says the Computer: Computationally Explored Variants of Gödel's Ontological Argument

by   Christoph Benzmüller, et al.
Freie Universität Berlin

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.


A (Simplified) Supreme Being Necessarily Exists – Says the Computer!

A simplified variant of Kurt Gödel's modal ontological argument is prese...

FMLtoHOL (version 1.0): Automating First-order Modal Logics with LEO-II and Friends

A converter from first-order modal logics to classical higher- order log...

A Simplified Variant of Gödel's Ontological Argument

A simplified variant of Gödel's ontological argument is presented. The s...

Expressivity of Quantitative Modal Logics: Categorical Foundations via Codensity and Approximation

A modal logic that is strong enough to fully characterize the behavior o...

Learning Ex Nihilo

This paper introduces, philosophically and to a degree formally, the nov...

Automating Quantified Multimodal Logics in Simple Type Theory -- A Case Study

In a case study we investigate whether off the shelf higher-order theore...