Take the plainest inductive argument there is: the sun has risen on each of the last ten days, so it will rise on the eleventh. Write R₁ for “the sun rises on day 1”, and so on. The argument has ten premises and one conclusion, and “Validity by Truth Table” gives the test: look for a row on which every premise is true and the conclusion false.
day 1 day 2 ... day 10 | day 11
-----------------------------------------
T T ... T | F <- every premise true, conclusion false
The row exists. Nothing in the ten premises mentions day 11, so the sentence about day 11 is free to be false, and the argument is invalid. Replace ten by ten thousand and the row is still there: the premises grow, the conclusion does not move into them.
Definition · Enumerative inductionEnumerative induction is the inference from “all observed cases of F have been G” to “the next case of F will be G”. As a form it is invalid, so whatever force it has comes from a premise it does not state.
The missing premise can be written as a probability. Suppose the sun rises each day with some fixed chance, and consider five hypotheses about that chance: 1, 3/4, 1/2, 1/4 and 0. Put an equal prior of 1/5 on each. This is the rule of succession reduced to five points, which keeps every number an exact fraction; it is a discretisation and it says nothing about hypotheses in between.
Ten sunrises in a row have probability chance¹⁰ under each hypothesis, so they favour the high chances heavily. After the data, the hypothesis that the sun always rises carries the posterior the lab prints in its first tile, and the probability of an eleventh sunrise is each hypothesis's chance weighted by its posterior.
chance prior weight after ten sunrises (units of 1/1048576)
---------------------------------------------------------------
1 1/5 1048576
3/4 1/5 59049
1/2 1/5 1024
1/4 1/5 1
0 1/5 0
Theorem · The predictive probabilityThe probability that the next case is a success is the sum, over the hypotheses, of the posterior of each times its chance of a success: P(next | data) = Σ P(h | data)·chance(h). It is below 1 whenever some hypothesis with a chance under 1 keeps any posterior.
Example · Same data, other priorGive a skeptic a prior of 1/1000 on a chance of 1, 1/10 on each of 3/4, 1/2 and 1/4, and 699/1000 on a chance of 0. The ten sunrises are the same, the likelihoods are the same, and the predictive probability falls from just under 1 to about 0.78. The data did not change; the prior did.
That is the force of Hume's point. His argument can be set out as a valid argument, and its premises are worth stating at full strength:
- An argument from observed cases to an unobserved one is either deductive or rests on the assumption that the unobserved resembles the observed.
- It is not deductive: the row above shows that.
- The assumption of resemblance is not a necessary truth, since a world in which the sun stops is describable without contradiction. So if anything supports it, experience does; Hume allowed no third source.
- Any argument from experience for it is itself an argument from observed cases to unobserved ones, and so already assumes it.
- So nothing non-circular supports the assumption, and nothing non-circular supports enumerative induction.
The lab does not answer this. It shows exactly where the answer would have to go. Reject the third premise and you owe an account of a third source of support, or of why resemblance is necessary after all; reject the fourth and you owe an account of why a circular defence is not vicious; accept the conclusion and you owe an account of why anyone should expect the sun at all. Either way the reader decides, and the arithmetic is the same.