Forty years ago, Bayesian philosophers were just catching a new wave of technical innovation, ushering in an era of scoring rules, imprecise credences, and infinitesimal probabilities. Meanwhile, down the hall, Gettier’s 1963 paper [28] was shaping a literature with little obvious interest in the formal programs of Reichenbach, Hempel, and Carnap, or their successors like Jeffrey, Levi, Skyrms, van Fraassen, and Lewis. And how Bayesians might accommodate the discourses of full belief and knowledge was but a glimmer in the eye (...) of Isaac Levi. Forty years later, scoring rules, imprecise credences, and infinitesimal probabilities are all the rage. And the formal and “informal” traditions are increasingly coming together as Bayesian arguments spill over into debates about the foundations of empirical knowledge, skepticism, and more. Relatedly, Bayesian interest in full belief and knowledge has never been greater. Much more besides has happened in the last forty years of Bayesian philosophy, .. (shrink)

Bootstrapping is a suspicious form of reasoning that verifies a source's reliability by checking it against itself. Theories that endorse such reasoning face the bootstrapping problem. This article considers which theories face the problem, and surveys potential solutions. The initial focus is on theories like reliabilism and dogmatism, which allow one to gain knowledge from a source without knowing that it is reliable. But the discussion quickly turns to a more general version of the problem that does not depend on (...) this allowance. Five potential solutions to the general problem are evaluated, and some implications for the literature on peer disagreement are considered. (shrink)

The bootstrapping problem poses a general challenge, afflicting even strongly internalist theories. Even if one must always know that one’s source is reliable to gain knowledge from it, bootstrapping is still possible. I survey some solutions internalists might offer and defend the one I find most plausible: that bootstrapping involves an abuse of inductive reasoning akin to generalizing from a small or biased sample. I also argue that this solution is equally available to the reliabilist. The moral is that the (...) issues raised by bootstrapping are orthogonal to questions about internalism and basic knowledge, having more to do with the nature of good inductive reasoning. (shrink)

To remedy the lack of precision attached to the concept of coherence, a plethora of probabilistic measures has been developed. To broaden the perspective, we do not focus on the differences between these quantitative but the differences between qualitative approaches to coherence by comparing three probabilistic definitions for the relation denoted by ‘coheres with’. To reveal the different logics underlying these relations, we introduce a considerable number of formal properties and examine whether the given coherence relations possess them. Among these (...) properties are not only the classics reflexivity, symmetry and transitivity, but also a variety of features that concern propositions containing negation, conjunction and disjunction, as well as features that concern inconsistency, entailment and equivalence. (shrink)

Proposals for rigorously explicating the concept of confirmation in probabilistic terms abound. To foster discussions on the formal properties of the proposed measures, recent years have seen the upshot of a number of representation theorems that uniquely determine a confirmation measure based on a number of desiderata. However, the results that have been presented so far focus exclusively on the concept of incremental confirmation. This leaves open the question whether similar results can be obtained for the concept of absolute confirmation. (...) This article closes the gap by providing a representation theorem for absolute confirmation measures. (shrink)

Igor Douven establishes several new intransitivity results concerning evidential support. I add to Douven’s very instructive discussion by establishing two further intransitivity results and a transitivity result.

I argue that coherence is truth-conducive in that coherence implies an increase in the probability of truth. Central to my argument is a certain principle for transitivity in probabilistic support. I then address a question concerning the truth-conduciveness of coherence as it relates to (something else I argue for) the truth-conduciveness of consistency, and consider how the truth-conduciveness of coherence bears on coherentist theories of justification.

Bayesian confirmation theory is rife with confirmation measures. Many of them differ from each other in important respects. It turns out, though, that all the standard confirmation measures in the literature run counter to the so-called “Reverse Matthew Effect” (“RME” for short). Suppose, to illustrate, that H1 and H2 are equally successful in predicting E in that p(E | H1)/p(E) = p(E | H2)/p(E) > 1. Suppose, further, that initially H1 is less probable than H2 in that p(H1) < p(H2). (...) Then by RME it follows that the degree to which E confirms H1 is greater than the degree to which it confirms H2. But by all the standard confirmation measures in the literature, in contrast, it follows that the degree to which E confirms H1 is less than or equal to the degree to which it confirms H2. It might seem, then, that RME should be rejected as implausible. Festa (2012), however, argues that there are scientific contexts in which RME holds. If Festa’s argument is sound, it follows that there are scientific contexts in which none of the standard confirmation measures in the literature is adequate. Festa’s argument is thus interesting, important, and deserving of careful examination. I consider five distinct respects in which E can be related to H, use them to construct five distinct ways of understanding confirmation measures, which I call “Increase in Probability”, “Partial Dependence”, “Partial Entailment”, “Partial Discrimination”, and “Popper Corroboration”, and argue that each such way runs counter to RME. The result is that it is not at all clear that there is a place in Bayesian confirmation theory for RME. (shrink)

There is a long-standing debate in epistemology on the structure of justification. Some recent work in formal epistemology promises to shed some new light on that debate. I have in mind here some recent work by David Atkinson and Jeanne Peijnenburg, hereafter “A&P”, on infinite regresses of probabilistic support. A&P show that there are probability distributions defined over an infinite set of propositions {\ such that \ is probabilistically supported by \ for all i and \ has a high probability. (...) Let this result be “APR”. A&P oftentimes write as though they believe that APR runs counter to foundationalism. This makes sense, since there is some prima facie plausibility in the idea that APR runs counter to foundationalism, and since some prominent foundationalists argue for theses inconsistent with APR. I argue, though, that in fact APR does not run counter to foundationalism. I further argue that there is a place in foundationalism for infinite regresses of probabilistic support. (shrink)

An important question in the current debate on the epistemic significance of peer disagreement is whether evidence of evidence is evidence. Fitelson argues 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 condition and show that under this condition evidence of evidence is evidence.

Is 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) > 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. (shrink)

It is well known that the probabilistic relation of confirmation is not transitive in that even if E confirms H1 and H1 confirms H2, E may not confirm H2. In this paper we distinguish four senses of confirmation and examine additional conditions under which confirmation in different senses becomes transitive. We conduct this examination both in the general case where H1 confirms H2 and in the special case where H1 also logically entails H2. Based on these analyses, we argue that (...) the Screening-Off Condition is the most important condition for transitivity in confirmation because of its generality and ease of application. We illustrate our point with the example of Moore’s “proof” of the existence of a material world, where H1 logically entails H2, the Screening-Off Condition holds, and confirmation in all four senses turns out to be transitive. (shrink)

It is well known that the probabilistic relation of confirmation is not transitive in that even if E confirms H1 and H1 confirms H2, E may not confirm H2. In this paper we distinguish four senses of confirmation and examine additional conditions under which confirmation in different senses becomes transitive. We conduct this examination both in the general case where H1 confirms H2 and in the special case where H1 also logically entails H2. Based on these analyses, we argue that (...) the Screening-Off Condition is the most important condition for transitivity in confirmation because of its generality and ease of application. We illustrate our point with the example of Moore’s ‘‘proof’’ of the existence of a material world, where H1 logically entails H2, the Screening-Off Condition holds, and confirmation in all four senses turns out to be transitive. (shrink)

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. (shrink)

There are many scientific and everyday cases where each of Pr and Pr is high and it seems that Pr is high. But high probability is not transitive and so it might be in such cases that each of Pr and Pr is high and in fact Pr is not high. There is no issue in the special case where the following condition, which I call “C1”, holds: H 1 entails H 2. This condition is sufficient for transitivity in high (...) probability. But many of the scientific and everyday cases referred to above are cases where it is not the case that H 1 entails H 2. I consider whether there are additional conditions sufficient for transitivity in high probability. I consider three candidate conditions. I call them “C2”, “C3”, and “C2&3”. I argue that C2&3, but neither C2 nor C3, is sufficient for transitivity in high probability. I then set out some further results and relate the discussion to the Bayesian requirement of coherence. (shrink)

The probabilistic support relation is known to violate transitivity. But over the years, philosophers have identified various conditions under which it does not, most notably screening-off and weak screening-off. In this short discussion note, I wish to highlight another condition that, unfortunately, is often neglected in the literature. This condition is due to Mary Hesse who recognized its transitivity-ensuring property long before other conditions entered the stage. I show that her condition is logically independent of screening-off and weak screening-off, but (...) that, just like the two aforementioned, it entails the recently proposed very weak screening-off condition due to Jeanne Peijnenburg and David Atkinson. (shrink)

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. (shrink)