Modus Ponens and Modus Tollens for Conditional Probabilities,and Updating on Uncertain Evidence

There are narrowest bounds for P(h) when P(e)  =  y and P(h/e)  =  x, which bounds collapse to x as y goes to 1. A theorem for these bounds – Bounds for Probable Modus Ponens – entails a principle for updating on possibly uncertain evidence subject to these bounds that is a generalization of the principle for updating by conditioning on certain evidence. This way of updating on possibly uncertain evidence is appropriate when updating by ‘probability kinematics’ or ‘Jeffrey-conditioning’ is, and apparently in countless other cases as well. A more complicated theorem due to Karl Wagner – Bounds for Probable Modus Tollens – registers narrowest bounds for P(∼h) when P(∼e) =  y and P(e/h)  =  x. This theorem serves another principle for updating on possibly uncertain evidence that might be termed ‘contraditioning’, though it is for a way of updating that seems in practice to be frequently not appropriate. It is definitely not a way of putting down a theory – for example, a random-chance theory of the apparent fine-tuning for life of the parameters of standard physics – merely on the ground that the theory made extremely unlikely conditions of which we are now nearly certain. These theorems for bounds and updating are addressed to standard conditional probabilities defined as ratios of probabilities. Adaptations for Hosiasson-Lindenbaum ‘free-standing’ conditional probabilities are provided. The extended on-line version of this article (URL: ) includes appendices and expansions of several notes. Appendix A contains demonstrations and confirmations of elements of those adaptations. Appendix B discusses and elaborates analogues of modus ponens and modus tollens for probabilities and conditional probabilities found in Elliott Sober’s “Intelligent Design and Probability Reasoning.” Appendix C adds to observations made below regarding relations of Probability Kinematics and updating subject to Bounds for Probable Modus Ponens.