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

An approach to universal (meta-)logical reasoning in classical higher-order\nlogic is employed to explore and study simplifications of Kurt G\\"odel's modal\nontological argument. Some argument premises are modified, others are dropped,\nmodal collapse is avoided and validity is shown already in weak modal logics K\nand T. Key to the gained simplifications of G\\"odel's original theory is the\nexploitation of a link to the notions of filter and ultrafilter from topology.\nThe paper illustrates how modern knowledge representation and reasoning\ntechnology for quantified non-classical logics can contribute new knowledge to\nother disciplines. The contributed material is also well suited to support\nteaching of non-trivial logic formalisms in classroom.\n