A probabilistic analysis of selected notions of iterated conditioning under coherence

• URL: http://arxiv.org/abs/2308.10338v1
• Date: Sun, 20 Aug 2023 18:48:37 GMT
• Title: A probabilistic analysis of selected notions of iterated conditioning under coherence
• Authors: Lydia Castronovo and Giuseppe Sanfilippo
• Abstract summary: We consider de Finetti's notion of conditional as a three-valued object and as a conditional random quantity in the betting framework. We show that the compound probability theorem and other basic properties are not preserved by these objects. We observe that all the basic properties are satisfied only by the iterated conditional mainly developed by Gilio and Sanfilippo.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: It is well know that basic conditionals satisfy some desirable basic logical and probabilistic properties, such as the compound probability theorem, but checking the validity of these becomes trickier when we switch to compound and iterated conditionals. We consider de Finetti's notion of conditional as a three-valued object and as a conditional random quantity in the betting framework. We recall the notions of conjunction and disjunction among conditionals in selected trivalent logics. First, in the framework of specific three-valued logics we analyze the notions of iterated conditioning introduced by Cooper-Calabrese, de Finetti and Farrell, respectively. We show that the compound probability theorem and other basic properties are not preserved by these objects, by also computing some probability propagation rules. Then, for each trivalent logic we introduce an iterated conditional as a suitable random quantity which satisfies the compound prevision theorem and some of the desirable properties. We also check the validity of two generalized versions of Bayes' Rule for iterated conditionals. We study the p-validity of generalized versions of Modus Ponens and two-premise centering for iterated conditionals. Finally, we observe that all the basic properties are satisfied only by the iterated conditional mainly developed in recent papers by Gilio and Sanfilippo in the setting of conditional random quantities.

Related papers

• Hidden variable theory for non-relativistic QED: the critical role of selection rules [0.0]
  We propose a hidden variable theory compatible with non-relativistic quantum electrodynamics. Our approach introduces logical variables to describe propositions about the occupation of stationary states. It successfully describes the essential properties of individual trials.
  arXiv  Detail & Related papers  (2024-10-23T23:25:53Z)
• Connecting classical finite exchangeability to quantum theory [69.62715388742298]
  Exchangeability is a fundamental concept in probability theory and statistics. We show how a de Finetti-like representation theorem for finitely exchangeable sequences requires a mathematical representation which is formally equivalent to quantum theory.
  arXiv  Detail & Related papers  (2023-06-06T17:15:19Z)
• On Trivalent Logics, Compound Conditionals, and Probabilistic Deduction Theorems [0.0]
  We recall some results for conditional events, compound conditionals, conditional random quantities, p-consistency, and p-entailment. We show the equivalence between bets on conditionals and conditional bets, by reviewing de Finetti's trivalent analysis of conditionals.
  arXiv  Detail & Related papers  (2023-03-17T22:35:06Z)
• Certain and Uncertain Inference with Indicative Conditionals [0.3437656066916039]
  We develop a trivalent semantics for the truth conditions and the probability of the natural language conditional. We show systematic correspondences between trivalent and probabilistic representations of inferences in either framework. The result is a unified account of the semantics and indicative of conditionals that can be fruitfully applied to analyzing the validity of conditional inferences.
  arXiv  Detail & Related papers  (2022-07-17T20:06:00Z)
• 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)
• Situated Conditional Reasoning [10.828616610785524]
  We show that situation-based conditionals can be described in terms of a set of postulates. We then define a form of entailment for situated conditional knowledge bases, which we refer to as minimal closure.
  arXiv  Detail & Related papers  (2021-09-03T14:23:18Z)
• Nested Counterfactual Identification from Arbitrary Surrogate Experiments [95.48089725859298]
  We study the identification of nested counterfactuals from an arbitrary combination of observations and experiments. Specifically, we prove the counterfactual unnesting theorem (CUT), which allows one to map arbitrary nested counterfactuals to unnested ones.
  arXiv  Detail & Related papers  (2021-07-07T12:51:04Z)
• Transitional Conditional Independence [0.0]
  We introduce transition probability spaces and transitional random variables. These constructions will generalize, strengthen and previous notions of (conditional) random variables and non-stochastic variables.
  arXiv  Detail & Related papers  (2021-04-23T11:52:15Z)
• Tractable Inference in Credal Sentential Decision Diagrams [116.6516175350871]
  Probabilistic sentential decision diagrams are logic circuits where the inputs of disjunctive gates are annotated by probability values. We develop the credal sentential decision diagrams, a generalisation of their probabilistic counterpart that allows for replacing the local probabilities with credal sets of mass functions. For a first empirical validation, we consider a simple application based on noisy seven-segment display images.
  arXiv  Detail & Related papers  (2020-08-19T16:04:34Z)
• 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)
• Best Arm Identification for Cascading Bandits in the Fixed Confidence Setting [81.70513857417106]
  We design and analyze CascadeBAI, an algorithm for finding the best set of $K$ items. An upper bound on the time complexity of CascadeBAI is derived by overcoming a crucial analytical challenge. We show, through the derivation of a lower bound on the time complexity, that the performance of CascadeBAI is optimal in some practical regimes.
  arXiv  Detail & Related papers  (2020-01-23T16:47:52Z)

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.