Probabilistic inferences from conjoined to iterated conditionals

Download Edit this record How to cite View on PhilPapers
Abstract
There is wide support in logic, philosophy, and psychology for the hypothesis that the probability of the indicative conditional of natural language, $P(\textit{if } A \textit{ then } B)$, is the conditional probability of $B$ given $A$, $P(B|A)$. We identify a conditional which is such that $P(\textit{if } A \textit{ then } B)= P(B|A)$ with de Finetti's conditional event, $B|A$. An objection to making this identification in the past was that it appeared unclear how to form compounds and iterations of conditional events. In this paper, we illustrate how to overcome this objection with a probabilistic analysis, based on coherence, of these compounds and iterations. We interpret the compounds and iterations as conditional random quantities which, given some logical dependencies, may reduce to conditional events. We show how the inference to $B|A$ from $A$ and $B$ can be extended to compounds and iterations of both conditional events and biconditional events. Moreover, we determine the respective uncertainty propagation rules. Finally, we make some comments on extending our analysis to counterfactuals.
PhilPapers/Archive ID
SANPIF-3
Upload history
Archival date: 2021-03-15
View other versions
Added to PP index
2021-03-15

Total views
39 ( #58,868 of 64,211 )

Recent downloads (6 months)
23 ( #29,417 of 64,211 )

How can I increase my downloads?

Downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.