Modus TollensProbabilized
Author(s) -
Carl Wagner
Publication year - 2004
Publication title -
the british journal for the philosophy of science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.703
H-Index - 54
eISSN - 1464-3537
pISSN - 0007-0882
DOI - 10.1093/bjps/55.4.747
Subject(s) - modus ponens , mathematics , fuzzy logic , computer science , artificial intelligence
We establish a probabilized version of modus tollens, deriving from p(E|H)=a and p(Ē)=b the best possible bounds on p(H̄). In particular, we show that p(H̄) → 1 as a, b → 1, and also as a, b → 0. 1. Introduction2. Probabilities of conditionals3. Conditional probabilities 3.1 Adams' thesis 3.2 Modus ponens for conditional probabilities 3.3 Modus tollens for conditional probabilities Introduction Probabilities of conditionals Conditional probabilities 3.1 Adams' thesis 3.2 Modus ponens for conditional probabilities 3.3 Modus tollens for conditional probabilities 3.1 Adams' thesis 3.2 Modus ponens for conditional probabilities 3.3 Modus tollens for conditional probabilities
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom