Transfinite Modal Logic: a Semi-quantitative Explanation for Bayesian Reasoning

• URL: http://arxiv.org/abs/2204.03563v1
• Date: Sat, 2 Apr 2022 17:58:14 GMT
• Title: Transfinite Modal Logic: a Semi-quantitative Explanation for Bayesian Reasoning
• Authors: Xinyu Wang
• Abstract summary: We introduce transfinite modal logic, which combines modal logic with ordinal arithmetic. We suggest that transfinite modal logic captures the essence of Bayesian reasoning in a rather clear and simple form.
• Score: 1.6916260027701393
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Bayesian reasoning plays a significant role both in human rationality and in machine learning. In this paper, we introduce transfinite modal logic, which combines modal logic with ordinal arithmetic, in order to formalize Bayesian reasoning semi-quantitatively. Technically, we first investigate some nontrivial properties of ordinal arithmetic, which then enable us to expand normal modal logic's semantics naturally and elegantly onto the novel transfinite modal logic, while still keeping the ordinary definition of Kripke models totally intact. Despite all the transfinite mathematical definition, we argue that in practice, this logic can actually fit into a completely finite interpretation as well. We suggest that transfinite modal logic captures the essence of Bayesian reasoning in a rather clear and simple form, in particular, it provides a perfect explanation for Sherlock Holmes' famous saying, "When you have eliminated the impossible, whatever remains, however improbable, must be the truth." We also prove a counterpart of finite model property theorem for our logic.

Related papers

• LogicBench: Towards Systematic Evaluation of Logical Reasoning Ability of Large Language Models [52.03659714625452]
  Recently developed large language models (LLMs) have been shown to perform remarkably well on a wide range of language understanding tasks. But, can they really "reason" over the natural language? This question has been receiving significant research attention and many reasoning skills such as commonsense, numerical, and qualitative have been studied.
  arXiv  Detail & Related papers  (2024-04-23T21:08:49Z)
• G\"odel-Dummett linear temporal logic [0.0]
  We investigate a version of linear temporal logic whose propositional fragment is G"odel-Dummett logic. We define the logic using two natural semantics first a real-valued semantics, where statements have a degree of truth in the real unit interval. We show that these two semantics indeed define one and the same logic. This G"odel temporal logic does not have any form of the finite model property for these two semantics.
  arXiv  Detail & Related papers  (2023-06-27T21:19:52Z)
• The Transformation Logics [58.35574640378678]
  We introduce a new family of temporal logics designed to balance the trade-off between expressivity and complexity. Key feature is the possibility of defining operators of a new kind that we call transformation operators. We show them to yield logics capable of creating hierarchies of increasing expressivity and complexity.
  arXiv  Detail & Related papers  (2023-04-19T13:24:04Z)
• An elementary belief function logic [6.091096843566857]
  duality between possibility and necessity measures, belief and plausibility functions and imprecise probabilities share a common feature with modal logic. This paper shows that a simpler belief function logic can be devised by adding Lukasiewicz logic on top of MEL.
  arXiv  Detail & Related papers  (2023-03-23T10:39:18Z)
• 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)
• Logical Credal Networks [87.25387518070411]
  This paper introduces Logical Credal Networks, an expressive probabilistic logic that generalizes many prior models that combine logic and probability. We investigate its performance on maximum a posteriori inference tasks, including solving Mastermind games with uncertainty and detecting credit card fraud.
  arXiv  Detail & Related papers  (2021-09-25T00:00:47Z)
• A natural deduction system for orthomodular logic [0.0]
  Orthomodular logic is a weakening of quantum logic in the sense of Birkhoff and von Neumann. It is shown to be a nonlinear noncommutative logic. It is extended to two systems of predicate logic: the first is sound for Takeuti's quantum set theory, and the second is sound for a variant of Weaver's quantum logic.
  arXiv  Detail & Related papers  (2021-09-11T22:28:17Z)
• Foundations of Reasoning with Uncertainty via Real-valued Logics [70.43924776071616]
  We give a sound and strongly complete axiomatization that can be parametrized to cover essentially every real-valued logic. Our class of sentences are very rich, and each describes a set of possible real values for a collection of formulas of the real-valued logic.
  arXiv  Detail & Related papers  (2020-08-06T02:13:11Z)
• Logical Neural Networks [51.46602187496816]
  We propose a novel framework seamlessly providing key properties of both neural nets (learning) and symbolic logic (knowledge and reasoning) Every neuron has a meaning as a component of a formula in a weighted real-valued logic, yielding a highly intepretable disentangled representation. Inference is omni rather than focused on predefined target variables, and corresponds to logical reasoning.
  arXiv  Detail & Related papers  (2020-06-23T16:55:45Z)

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.