In 1947 Donald Cary Williams claimed in The Ground of Induction to have solved the Humean problem of induction, by means of an adaptation of reasoning first advanced by Bernoulli in 1713. Later on David Stove defended and improved upon Williams’ argument in The Rational- ity of Induction (1986). We call this proposed solution of induction the ‘Williams-Stove sampling thesis’. There has been no lack of objections raised to the sampling thesis, and it has not been widely accepted. In our (...) opinion, though, none of these objections has the slightest force, and, moreover, the sampling thesis is undoubtedly true. What we will argue in this paper is that one particular objection that has been raised on numerous occasions is misguided. This concerns the randomness of the sample on which the inductive extrapolation is based. (shrink)

Schurz (2019, ch. 4) argues that probabilistic accounts of induction fail. In particular, he criticises probabilistic accounts of induction that appeal to direct inference principles, including subjective Bayesian approaches (e.g., Howson 2000) and objective Bayesian approaches (see, e.g., Williamson 2017). In this paper, I argue that Schurz’ preferred direct inference principle, namely Reichenbach’s Principle of the Narrowest Reference Class, faces formidable problems in a standard probabilistic setting. Furthermore, the main alternative direct inference principle, Lewis’ Principal Principle, is also hard to (...) reconcile with standard probabilism. So, I argue, standard probabilistic approaches cannot appeal to direct inference to explicate the logic of induction. However, I go on to defend a non-standard objective Bayesian account of induction: I argue that this approach can both accommodate direct inference and provide a viable account of the logic of induction. I then defend this account against Schurz’ criticisms. (shrink)

David Armstrong argues that necessitation relations among universals are the best explanation of some of our observations. If we consequently accept them into our ontologies, then we can justify induction, because these necessitation relations also have implications for the unobserved. By embracing Armstrongian universals, we can vindicate some of our strongest epistemological intuitions and answer the Problem of Induction. However, Armstrong’s reasoning has recently been challenged on a variety of grounds. Critics argue against both Armstrong’s usage of inference to the (...) best explanation and even whether, by Armstrong’s own standards, necessitation relations offer a potential explanation of this explanandum, let alone the best explanation. I defend Armstrong against these particular criticisms. Firstly, even though there are reasons to think that Armstrong’s justification fails as a self-contained defence of induction, it can usefully complement several other answers to Hume. Secondly, I argue that Armstrong’s reasoning is consistent with his own standards for explanation. (shrink)

Epistemic injustice is injustice to a person qua knower. In one form of this phenomenon a speaker’s testimony is denied credence in a way that wrongs them. I argue that the received definition of this testimonial injustice relies too heavily on epistemic criteria that cannot explain why the moral concept of injustice should be invoked. I give an account of the nature of the wrong of epistemic injustice that has it depend not on the accuracy of judgments that are used (...) or made in the process of deciding whether to listen to or trust a speaker, but on whether the basis of the decision about a speaker is their reliability or their identity, and the account explains why the latter is a moral wrong. A key difference between the two accounts is how they classify the use of true statistical generalizations connecting identity and reliability. The received view implies that this cannot be an injustice, while the view proposed here implies that it can. As such the new view appears to imply a conflict between moral and epistemic obligations: it is morally wrong to use true statistical generalizations in certain contexts, yet they are part of our evidence, and we are epistemically obligated to take all of our evidence into account. I reconcile these two thoughts without adopting the currently popular view that a belief’s being morally wrong makes it epistemically unjustified, and I argue that following the principle of total evidence encourages epistemic justice rather than thwarting it. (shrink)

It is well known that there are, at least, two sorts of cases where one should not prefer a direct inference based on a narrower reference class, in particular: cases where the narrower reference class is gerrymandered, and cases where one lacks an evidential basis for forming a precise-valued frequency judgment for the narrower reference class. I here propose (1) that the preceding exceptions exhaust the circumstances where one should not prefer direct inference based on a narrower reference class, and (...) (2) that minimal frequency information for a narrower (non-gerrymandered) reference class is sufficient to yield the defeat of a direct inference for a broader reference class. By the application of a method for inferring relatively informative expected frequencies, I argue that the latter claim does not result in an overly incredulous approach to direct inference. The method introduced here permits one to infer a relatively informative expected frequency for a reference class R', given frequency information for a superset of R' and/or frequency information for a sample drawn from R'. (shrink)

With his new riddle of induction, Goodman raised a problem for enumerative induction which many have taken to show that only some ‘natural’ properties can be used for making inductive inferences. Arguably, however, (i) enumerative induction is not a method that scientists use for making inductive inferences in the first place. Moreover, it seems at first sight that (ii) Goodman’s problem does not affect the method that scientists actually use for making such inferences—namely, classical statistics. Taken together, this would indicate (...) that (iii) ‘naturalness’ is not such a relevant concept for the problem of induction, after all. I have no objections against (i) and (iii). But, contrary to (ii), I argue that classical statistics does face a version of Goodman’s problem, which I call the statistical riddle of induction. Given that his problem merely is an instance of the more general problem of underdetermination, this is hardly surprising. Perhaps more importantly, I also show how my riddle can be used for exposing a common fallacy in probabilistic reasoning, without relying on Bayesian assumptions. (shrink)

John D. Norton’s “Material Theory of Induction” has been one of the most intriguing recent additions to the philosophy of induction. Norton’s account appears to be a notably natural account of actual inductive practices, although his theory has attracted considerable criticism. I detail several novel issues for his theory but argue that supplementing the Material Theory with a theory of direct inference could address these problems. I argue that if this combination is possible, a stronger theory of inductive reasoning emerges, (...) which has a more propitious answer to the Problem of Induction. (shrink)

This article presents results from a simulation‐based study of inheritance inference, that is, inference from the typicality of a property among a “base” class to its typicality among a subclass of the class. The study aims to ascertain which kinds of inheritance inferences are reliable, with attention to the dependence of their reliability upon the type of environment in which inferences are made. For example, the study addresses whether inheritance inference is reliable in the case of “exceptional subclasses” (i.e., subclasses (...) that are known to be atypical in some respect) and attends to variations in reliability that result from variations in the entropy level of the environment. A further goal of the study is to show that the reliability of inheritance inference depends crucially on which sorts of base classes are used in making inferences. One approach to inheritance inference treats the extension of any atomic predicate as a suitable base class. A second approach identifies suitable base classes with the cells of a partition (of a preselected size k) of the domain of objects that satisfies the condition of maximizing the similarity of objects that are assigned to the same class. In addition to permitting more inferences, our study shows that the second approach results in inheritance inferences that are far more reliable, particularly in the case of exceptional subclasses. (shrink)

Stanford Encyclopedia article surveying the life and work of D.C. Williams, notably in defending realism in metaphysics in the mid-twentieth century and in justifying induction by the logic of statistical inference.