Hostname: page-component-7b7567c8c-slfcl Total loading time: 0 Render date: 2026-11-19T14:59:06.812Z Has data issue: false hasContentIssue false

PROBABILISTIC CONDITIONALS ARE ALMOST MONOTONIC

Published online by Cambridge University Press:  01 June 2008

MATTHEW P. JOHNSON*
Affiliation:
City University of New York
ROHIT PARIKH*
Affiliation:
City University of New York
*
*DEPARTMENT OF COMPUTER SCIENCE, CUNY GRADUATE CENTER, NEW YORK, NY 10016, USA. E-mail: mpjohnson@cs.gc.cuny.edu
†DEPARTMENTS OF COMPUTER SCIENCE, MATHEMATICS, AND PHILOSOPHY, CUNY GRADUATE CENTER, NEW YORK, NY 10016, USA. E-mail: rparikh@gc.cuny.edu
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

One interpretation of the conditional If P then Q is as saying that the probability of Q given P is high. This is an interpretation suggested by Adams (1966) and pursued more recently by Edgington (1995). Of course, this probabilistic conditional is nonmonotonic, that is, if the probability of Q given P is high, and R implies P, it need not follow that the probability of Q given R is high. If we were confident of concluding Q from the fact that we knew P, and we have stronger information R, we can no longer be confident of Q. We show nonetheless that usually we would still be justified in concluding Q from R. In other words, probabilistic conditionals are mostly monotonic.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2008