On Trivalent Logics, Compound Conditionals, and Probabilistic Deduction Theorems

• URL: http://arxiv.org/abs/2303.10268v1
• Date: Fri, 17 Mar 2023 22:35:06 GMT
• Title: On Trivalent Logics, Compound Conditionals, and Probabilistic Deduction Theorems
• Authors: Angelo Gilio, David E. Over, Niki Pfeifer, Giuseppe Sanfilippo
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this paper we recall some results for conditional events, compound conditionals, conditional random quantities, p-consistency, and p-entailment. Then, we show the equivalence between bets on conditionals and conditional bets, by reviewing de Finetti's trivalent analysis of conditionals. But our approach goes beyond de Finetti's early trivalent logical analysis and is based on his later ideas, aiming to take his proposals to a higher level. We examine two recent articles that explore trivalent logics for conditionals and their definitions of logical validity and compare them with our approach to compound conditionals. We prove a Probabilistic Deduction Theorem for conditional events. After that, we study some probabilistic deduction theorems, by presenting several examples. We focus on iterated conditionals and the invalidity of the Import-Export principle in the light of our Probabilistic Deduction Theorem. We use the inference from a disjunction, "$A$ or $B$", to the conditional,"if not-$A$ then $B$", as an example to show the invalidity of the Import-Export principle. We also introduce a General Import-Export principle and we illustrate it by examining some p-valid inference rules of System P. Finally, we briefly discuss some related work relevant to AI.

Related papers

• Temporal Fair Division of Indivisible Items [61.235172150247614]
  We study a fair division model where indivisible items arrive sequentially, and must be allocated immediately and irrevocably. Previous work on online fair division has shown impossibility results in achieving approximate envy-freeness under these constraints. We aim to ensure that the cumulative allocation at each round satisfies approximate temporal envy-freeness up to one item (TEF1)
  arXiv  Detail & Related papers  (2024-10-18T16:43:36Z)
• Phenomenal Yet Puzzling: Testing Inductive Reasoning Capabilities of Language Models with Hypothesis Refinement [92.61557711360652]
  Language models (LMs) often fall short on inductive reasoning, despite achieving impressive success on research benchmarks. We conduct a systematic study of the inductive reasoning capabilities of LMs through iterative hypothesis refinement. We reveal several discrepancies between the inductive reasoning processes of LMs and humans, shedding light on both the potentials and limitations of using LMs in inductive reasoning tasks.
  arXiv  Detail & Related papers  (2023-10-12T17:51:10Z)
• Normative Conditional Reasoning as a Fragment of HOL [0.0]
  We discuss the mechanization of (preference-based) conditional normative reasoning. Our focus is on Aqvist's system E for conditional obligation, and its extensions. We consider two possible uses of the framework.
  arXiv  Detail & Related papers  (2023-08-21T12:47:30Z)
• A probabilistic analysis of selected notions of iterated conditioning under coherence [0.0]
  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.
  arXiv  Detail & Related papers  (2023-08-20T18:48:37Z)
• Logic meets Wigner's Friend (and their Friends) [49.1574468325115]
  We take a fresh look at Wigner's Friend thought-experiment and some of its more recent variants and extensions. We discuss various solutions proposed in the literature, focusing on a few questions.
  arXiv  Detail & Related papers  (2023-07-04T13:31:56Z)
• 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)
• No contextual advantage in non-paradoxical scenarios of two state vector formalism [4.291616110077346]
  We consider the application of the two state vector formalism (TSVF) to unearth quantum contextuality. We classify the resultant pre- and post-selection scenarios as either paradoxical or non-paradoxical. We argue that these do not constitute a proper test of contextuality.
  arXiv  Detail & Related papers  (2022-06-06T15:21:39Z)
• 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)
• 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)
• Two definitions of maximally $\psi$-epistemic ontological model and preparation non-contextuality [0.0]
  We argue that 1M$psi$E and 2M$psi$E capture in notion of maximal $psi$-epistemicity. This leads one to conclude that 1M$psi$E and 2M$psi$E capture in notion of maximal $psi$-epistemicity.
  arXiv  Detail & Related papers  (2020-12-27T07:02:39Z)
• A Weaker Faithfulness Assumption based on Triple Interactions [89.59955143854556]
  We propose a weaker assumption that we call $2$-adjacency faithfulness. We propose a sound orientation rule for causal discovery that applies under weaker assumptions.
  arXiv  Detail & Related papers  (2020-10-27T13:04:08Z)

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.