Dynamic Probabilistic Entailment. Improving on Adams' Dynamic Entailment Relation

Logic and Logical Philosophy 31 (3):359-384 (2022)
  Copy   BIBTEX

Abstract

The inferences of contraposition (A ⇒ C ∴ ¬C ⇒ ¬A), the hypothetical syllogism (A ⇒ B, B ⇒ C ∴ A ⇒ C), and others are widely seen as unacceptable for counterfactual conditionals. Adams convincingly argued, however, that these inferences are unacceptable for indicative conditionals as well. He argued that an indicative conditional of form A ⇒ C has assertability conditions instead of truth conditions, and that their assertability ‘goes with’ the conditional probability p(C|A). To account for inferences, Adams developed the notion of probabilistic entailment as an extension of classical entailment. This combined approach (correctly) predicts that contraposition and the hypothetical syllogism are invalid inferences. Perhaps less well-known, however, is that the approach also predicts that the unconditional counterparts of these inferences, e.g., modus tollens (A ⇒ C, ¬C ∴ ¬A), and iterated modus ponens (A ⇒ B, B ⇒ C, A ∴ C) are predicted to be valid. We will argue both by example and by calling to the results from a behavioral experiment (N = 159) that these latter predictions are incorrect if the unconditional premises in these inferences are seen as new information. Then we will discuss Adams’ (1998) dynamic probabilistic entailment relation, and argue that it is problematic. Finally, it will be shown how his dynamic entailment relation can be improved such that the incongruence predicted by Adams’ original system concerning conditionals and their unconditional counterparts are overcome. Finally, it will be argued that the idea behind this new notion of entailment is of more general relevance.

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 103,885

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Probabilistic Default Reasoning with Conditional Constraints.Thomas Lukasiewicz - 2000 - Linköping Electronic Articles in Computer and Information Science 5.

Analytics

Added to PP
2025-02-23

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Author Profiles

Patricia Mirabile
Université Paris Sorbonne

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references