A Simplified Variant of G\"odel's Ontological Argument

• URL: http://arxiv.org/abs/2202.06264v3
• Date: Fri, 25 Aug 2023 08:50:34 GMT
• Title: A Simplified Variant of G\"odel's Ontological Argument
• Abstract summary: The presented work exemplifies a fruitful human-computer interaction in computational metaphysics. Whether the presented result increases or decreases the attractiveness and persuasiveness of the ontological argument is a question I would like to pass on to philosophy and theology.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: A simplified variant of G\"odel's ontological argument is presented. The simplified argument is valid already in basic modal logics K or KT, it does not suffer from modal collapse, and it avoids the rather complex predicates of essence (Ess.) and necessary existence (NE) as used by G\"odel. The variant presented has been obtained as a side result of a series of theory simplification experiments conducted in interaction with a modern proof assistant system. The starting point for these experiments was the computer encoding of G\"odel's argument, and then automated reasoning techniques were systematically applied to arrive at the simplified variant presented. The presented work thus exemplifies a fruitful human-computer interaction in computational metaphysics. Whether the presented result increases or decreases the attractiveness and persuasiveness of the ontological argument is a question I would like to pass on to philosophy and theology.

Related papers

• On the Complexity of the Grounded Semantics for Infinite Argumentation Frameworks [0.0]
  We use methods from mathematical logic, specifically computability and set theory, to analyze the grounded extension.<n>Finding this fixed-point requires transfinite iterations.<n>This shows a marked distinction from the finite case where the grounded extension is-time computable.
  arXiv  Detail & Related papers  (2025-11-27T12:13:30Z)
• Quantum Abduction: A New Paradigm for Reasoning under Uncertainty [0.0]
  This paper introduces quantum abduction, a paradigm that models hypotheses in superposition, allowing them to interfere constructively or destructively.<n>Case studies span historical mysteries, literary demonstrations, medical diagnosis, and scientific theory change.
  arXiv  Detail & Related papers  (2025-09-21T07:41:49Z)
• Reasoning is about giving reasons [55.56111618153049]
  We show that we can identify and extract the logical structure of natural language arguments in three popular reasoning datasets with high accuracies.<n>Our approach supports all forms of reasoning that depend on the logical structure of the natural language argument.
  arXiv  Detail & Related papers  (2025-08-20T07:26:53Z)
• A Survey on Latent Reasoning [100.54120559169735]
  Large Language Models (LLMs) have demonstrated impressive reasoning capabilities.<n>CoT reasoning that verbalizes intermediate steps limits the model's expressive bandwidth.<n>Latent reasoning tackles this bottleneck by performing multi-step inference entirely in the model's continuous hidden state.
  arXiv  Detail & Related papers  (2025-07-08T17:29:07Z)
• Controllable Logical Hypothesis Generation for Abductive Reasoning in Knowledge Graphs [54.596180382762036]
  Abductive reasoning in knowledge graphs aims to generate plausible logical hypotheses from observed entities.<n>Due to a lack of controllability, a single observation may yield numerous plausible but redundant or irrelevant hypotheses.<n>We introduce the task of controllable hypothesis generation to improve the practical utility of abductive reasoning.
  arXiv  Detail & Related papers  (2025-05-27T09:36:47Z)
• A Fine-Grained Complexity View on Propositional Abduction -- Algorithms and Lower Bounds [6.6362553223890535]
  We analyze the complexity of intractable abduction problems under the seemingly overlooked but natural parameter n.<n>We obtain several positive results for $SigmaP$ as well as NP- and coNP-complete fragments.<n>We complement this with lower bounds and for many fragments rule out improvements under the (strong) exponential-time hypothesis.
  arXiv  Detail & Related papers  (2025-05-15T11:56:19Z)
• Counterfactual and Semifactual Explanations in Abstract Argumentation: Formal Foundations, Complexity and Computation [19.799266797193344]
  Argumentation-based systems often lack explainability while supporting decision-making processes. Counterfactual and semifactual explanations are interpretability techniques. We show that counterfactual and semifactual queries can be encoded in weak-constrained Argumentation Framework.
  arXiv  Detail & Related papers  (2024-05-07T07:27:27Z)
• A Hybrid System for Systematic Generalization in Simple Arithmetic Problems [70.91780996370326]
  We propose a hybrid system capable of solving arithmetic problems that require compositional and systematic reasoning over sequences of symbols. We show that the proposed system can accurately solve nested arithmetical expressions even when trained only on a subset including the simplest cases.
  arXiv  Detail & Related papers  (2023-06-29T18:35:41Z)
• MetaLogic: Logical Reasoning Explanations with Fine-Grained Structure [129.8481568648651]
  We propose a benchmark to investigate models' logical reasoning capabilities in complex real-life scenarios. Based on the multi-hop chain of reasoning, the explanation form includes three main components. We evaluate the current best models' performance on this new explanation form.
  arXiv  Detail & Related papers  (2022-10-22T16:01:13Z)
• NELLIE: A Neuro-Symbolic Inference Engine for Grounded, Compositional, and Explainable Reasoning [59.16962123636579]
  This paper proposes a new take on Prolog-based inference engines. We replace handcrafted rules with a combination of neural language modeling, guided generation, and semi dense retrieval. Our implementation, NELLIE, is the first system to demonstrate fully interpretable, end-to-end grounded QA.
  arXiv  Detail & Related papers  (2022-09-16T00:54:44Z)
• Logical Satisfiability of Counterfactuals for Faithful Explanations in NLI [60.142926537264714]
  We introduce the methodology of Faithfulness-through-Counterfactuals. It generates a counterfactual hypothesis based on the logical predicates expressed in the explanation. It then evaluates if the model's prediction on the counterfactual is consistent with that expressed logic.
  arXiv  Detail & Related papers  (2022-05-25T03:40:59Z)
• Abstract Reasoning via Logic-guided Generation [65.92805601327649]
  Abstract reasoning, i.e., inferring complicated patterns from given observations, is a central building block of artificial general intelligence. This paper aims to design a framework for the latter approach and bridge the gap between artificial and human intelligence. We propose logic-guided generation (LoGe), a novel generative DNN framework that reduces abstract reasoning as an optimization problem in propositional logic.
  arXiv  Detail & Related papers  (2021-07-22T07:28:24Z)
• Systematic Evaluation of Causal Discovery in Visual Model Based Reinforcement Learning [76.00395335702572]
  A central goal for AI and causality is the joint discovery of abstract representations and causal structure. Existing environments for studying causal induction are poorly suited for this objective because they have complicated task-specific causal graphs. In this work, our goal is to facilitate research in learning representations of high-level variables as well as causal structures among them.
  arXiv  Detail & Related papers  (2021-07-02T05:44:56Z)
• Why Adversarial Interaction Creates Non-Homogeneous Patterns: A Pseudo-Reaction-Diffusion Model for Turing Instability [10.933825676518195]
  We observe Turing-like patterns in a system of neurons with adversarial interaction. We present a pseudo-reaction-diffusion model to explain the mechanism that may underlie these phenomena.
  arXiv  Detail & Related papers  (2020-10-01T16:09:22Z)
• A Quantum G\"odelian Hunch [0.0]
  This essay aims at arguing for such G"odelian hunch via two case studies. The theological motivational origin of quantum contextuality is introduced in order to show how this result might be related to a Liar-like undecidability. A personal analysis of the related Wigner's friend thought experiment and and a recent paradox by Frauchiger and Renner is presented.
  arXiv  Detail & Related papers  (2020-05-07T11:22:20Z)
• A (Simplified) Supreme Being Necessarily Exists, says the Computer: Computationally Explored Variants of G\"odel's Ontological Argument [0.0]
  Some argument premises are modified, others are dropped, modal collapse is avoided and validity is shown already in weak modal logics K and T. The paper illustrates how modern knowledge representation and reasoning technology for quantified non-classical logics can contribute new knowledge to other disciplines.
  arXiv  Detail & Related papers  (2020-01-14T10:26:51Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.