Is evidence of evidence evidence? Screening-off vs. no-defeaters

I argue elsewhere (Roche 2014) that evidence of evidence is evidence under screening-off. Tal and Comesaña (2017) argue that my appeal to screening-off is subject to two objections. They then propose an evidence of evidence thesis involving the notion of a defeater. There is much to learn from their very careful discussion. I argue, though, that their objections fail and that their evidence of evidence thesis is open to counterexample

Explanation, confirmation, and Hempel's paradox

Hempel’s Converse Consequence Condition (CCC), Entailment Condition (EC), and Special Consequence Condition (SCC) have some prima facie plausibility when taken individually. Hempel, though, shows that they have no plausibility when taken together, for together they entail that E confirms H for any propositions E and H. This is “Hempel’s paradox”. It turns out that Hempel’s argument would fail if one or more of CCC, EC, and SCC were modified in terms of explanation. This opens up the possibility that Hempel’s paradox can be solved by modifying one or more of CCC, EC, and SCC in terms of explanation. I explore this possibility by modifying CCC and SCC in terms of explanation and considering whether CCC and SCC so modified are correct. I also relate that possibility to Inference to the Best Explanation

Evidence of evidence is evidence under screening-off

AbstractAn important question in the current debate on the epistemic significance of peer disagreement is whether evidence of evidence is evidence. Fitelson argues (persuasively in my view) that, at least on some renderings of the thesis that evidence of evidence is evidence, there are cases where evidence of evidence is not evidence. I introduce a ‘screening-off’ condition and show that under this condition evidence of evidence is evidence.</jats:p

Dwindling Confirmation

We show that as a chain of confirmation becomes longer, confirmation dwindles under screening-off. For example, if E confirms H1, H1 confirms H2, and H1 screens off E from H2, then the degree to which E confirms H2 is less than the degree to which E confirms H1. Although there are many measures of confirmation, our result holds on any measure that satisfies the Weak Law of Likelihood. We apply our result to testimony cases, relate it to the Data-Processing Inequality in information theory, and extend it in two respects so that it covers a broader range of cases.</jats:p

Evidential support, transitivity, and screening-off

AbstractIs evidential support transitive? The answer is negative when evidential support is understood as confirmation so that X evidentially supports Y if and only if p(Y | X) &gt; p(Y). I call evidential support so understood “support” (for short) and set out three alternative ways of understanding evidential support: support-t (support plus a sufficiently high probability), support-t* (support plus a substantial degree of support), and support-tt* (support plus both a sufficiently high probability and a substantial degree of support). I also set out two screening-off conditions (under which support is transitive): SOC1 and SOC2. It has already been shown that support-t is non-transitive in the general case (where it is not required that SOC1 holds and it is not required that SOC2 holds), in the special case where SOC1 holds, and in the special case where SOC2 holds. I introduce two rather weak adequacy conditions on support measures and argue that on any support measure meeting those conditions it follows that neither support-t* nor support-tt* is transitive in the general case, in the special case where SOC1 holds, or in the special case where SOC2 holds. I then relate some of the results to Douven’s evidential support theory of conditionals along with a few rival theories.</jats:p