1. Background: Garber, Jeffrey, and Earman
By the time Einstein had formulated the general theory of relativity (H), the evidence regarding the perihelion of Mercury (E)—which Newtonian theory was unable to adequately explain—had long been known (Roseveare Reference Roseveare1982). Indeed, it is not implausible to suppose that Einstein was certain (in 1915) that E was true. Nonetheless, it is widely accepted that Einstein learned some proposition X (in 1915) that had the effect of confirming H (i.e., rationally raising Einstein’s credence in H).
Garber (Reference Garber and Earman1983) proposes that what Einstein learned was a logical fact (i.e., that X = “H entails E”). By adding an additional atomic statement X to the H, E language (and interpreting X extrasystematically as “H entails E”), Garber showed how it was possible to write down Bayesian models of this sort, having the following desired confirmation-theoretic property:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220105123411263-0840:S0031824800008096:S0031824800008096_df1.png?pub-status=live)
Garber did not, however, endorse specific constraints on Pr(·) that would ensure (1). Subsequently, Earman (Reference Earman1992) and Jeffrey (Reference Jeffrey1992) offered such constraints. Their approaches require the addition of X and a fourth atomic statement Y to the H, E language, where Y is extrasystematically interpreted as “H entails ¬E” (i.e., H refutes E). In these traditional Garber-style approaches, the background extrasystematic constraints on Pr(·) consist of the following pair of modus ponens principles for the extrasystematic entailment relation.Footnote 1
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220105123411263-0840:S0031824800008096:S0031824800008096_df3.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220105123411263-0840:S0031824800008096:S0031824800008096_df4.png?pub-status=live)
In addition to (2) and (3), Jeffrey offers the following extrasystematic constraint:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220105123411263-0840:S0031824800008096:S0031824800008096_df5.png?pub-status=live)
Informally, (4) expresses certainty in the disjunction: either H entails E or H refutes E. Given the background assumption that Pr(E) = 1, it is straightforward to show that (2)–(4) jointly entail the desired confirmation-theoretic conclusion (1). This, in essence, was Jeffrey’s Garber-style approach to the old evidence problem.
As Earman rightly points out, Jeffrey’s constraint (4) is not very plausible as a rational stricture on Einstein’s credences, before his learning X (in 1915). There was no good reason for Einstein to be certain (before learning X) that H either entails or refutes E. Earman offers the following alternative additional extrasystematic constraint:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220105123411263-0840:S0031824800008096:S0031824800008096_df6.png?pub-status=live)
Earman shows that—given the background assumption that Pr(E) = 1—(2), (3), and (5) jointly entail (1), and he argues that (5) is a plausible assumption regarding Einstein’s credences (in 1915). We agree that (5) is more plausible than Jeffrey’s (4). For one thing, (5) is not a numerical constraint but merely an ordinal constraint on Einstein’s 1915 credences. Moreover, because Einstein was (antecedently) certain of E, it is reasonable to suppose that he would have judged that X confers a greater probability on H than ¬X&¬Y does. Having said that, we would prefer a more general approach, which (a) does not presuppose that Pr(E) = 1 and (b) does not require interpreting X and Y in terms of entailment relations.
2. A New Garber-Style Approach
We like Garber’s idea of adding a pair of extrasystematic statements (and extrasystematic credal constraints) to the H, E language. But, we think the existing implementation of this general strategy has two main shortcomings. First, we think interpreting X and Y as “H entails E” and “H refutes E” is unduly restrictive. It is more plausible to suppose that what is learned in cases of old evidence (i.e., X) may not (always) be a logical fact. To be more precise, let X and Y be interpreted as follows:
•
adequately explains (or accounts for) E.Footnote 2
•
’s best competitor (H′) adequately explains (or accounts for) E.Footnote 3
What really matters here is not whether H entails E (or ¬E) but whether H adequately explains (or accounts for) E and whether some alternative theory H′ (which is H’s best competitor; see n. 3) adequately explains (or accounts for) E. It may be that H adequately explains E in a deductive-nomological sense. But why not allow for the possibility that H (or H′) explains E in a non-deductive-nomological way? In this regard, we think that the original Garber-style approaches are too narrow in their explanatory scope.
A second problem with the traditional Garber-style approaches is that they have required extrasystematic credal constraints (e.g., Pr(E) = 1 and eq. [4]) that are implausibly strong. This defect is also remedied by moving to our alternative, explanatory extrasystematic interpretation of X and Y. Consider the following four ordinal constraints on Pr(·|·).
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220105123411263-0840:S0031824800008096:S0031824800008096_df7.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220105123411263-0840:S0031824800008096:S0031824800008096_df8.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220105123411263-0840:S0031824800008096:S0031824800008096_df9.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220105123411263-0840:S0031824800008096:S0031824800008096_df10.png?pub-status=live)
Let’s examine each of four constraints, in turn. Suppose that H adequately explains E, but its best competitor H′ does not. Constraints (6) and (7) assert that H is more probable, given this supposition (X&¬Y), than it is given either the supposition that neither H nor H′ adequately explains E (i.e., given ¬X&¬Y) or the supposition that H’s best competitor (H′) adequately explains E but H does not (¬X&Y). These two constraints seem uncontroversial.
Constraint (8) also seems quite plausible. It asserts that H is less probable, given the supposition that its best competitor (H′) adequately explains E but H does not (¬X&Y), than it is given the supposition that both H and its best competitor (H′) adequately explain E (i.e., given X&Y).
The fourth and final credal comparison (9) says that H is at least as probable, given the supposition that both H and its best competitor (H′) adequately explain E (i.e., given X&Y), as it is given the supposition that neither H nor H′ adequately explains E (i.e., given ¬X&¬Y). One might maintain that it would be reasonable to rank strictly higher in one’s comparative confidence ranking than
. After all, X&Y implies that H does adequately explain E (which is already known), whereas ¬X&¬Y implies that H does not adequately explain E. But one might also reasonably argue that these two suppositions (X&Y and ¬X&¬Y) place H and H′ on a par with respect to explaining E, and so they should not confer different probabilities on H. Both of these positions are compatible with (9). The only thing (9) rules out is the claim that H is more probable given ¬X&¬Y than it is given X&Y. As such, (9) is also eminently reasonable.
As it happens, the desired (Garberian) confirmation-theoretic conclusion (1) follows from (6) to (9) alone. To be more precise, we can prove the following general result.
Proof. Let ,
,
,
,
, and
. Given these assignments, (6)–(9) are as follows.
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220105123411263-0840:S0031824800008096:S0031824800008096_df11.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220105123411263-0840:S0031824800008096:S0031824800008096_df12.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220105123411263-0840:S0031824800008096:S0031824800008096_df13.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220105123411263-0840:S0031824800008096:S0031824800008096_df14.png?pub-status=live)
Suppose that x > 0 and y < 1. Then, (6)–(9) jointly entail
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220105123411263-0840:S0031824800008096:S0031824800008096_df15.png?pub-status=live)
And, by the law of total probability, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220105123411263-0840:S0031824800008096:S0031824800008096_df16.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220105123411263-0840:S0031824800008096:S0031824800008096_df17.png?pub-status=live)
We think our theorem undergirds a superior Garber-style approach to the problem of old evidence. Specifically, our approach has the following two distinct advantages over traditional Garber-style approaches.
i) Unlike previous Garber-style approaches, ours does not require the assumption that Pr(E) = 1. It may be true that our constraints (6)–(9) are most plausible given the background assumption that E is (antecedently) known with certainty. But we think (6)–(9) retain enough of their plausibility, given only the weaker assumption that E is (antecedently) known with high credence.Footnote 4
ii) Our approach is not restricted to cases in which H (or H′) explains E in a deductive-nomological way. That is, our approach covers all cases in which scientists come to learn that their theory adequately explains E, not only those cases in which scientists learn that their theory entails E (or explains E deductive nomologically).Footnote 5