The Disjunctive Riddle and the Grue-Paradox
The paper explores the disjunctive riddle for induction: If we know the sample Ks to be P, we also know that they are P or F (for arbitrary F). Assuming that we also know that the future Ks are non-P, we can conclude that they are F, if only we can inductively infer the evidentially supported P-or-F...
Gespeichert in:
Veröffentlicht in: | Dialectica 2016-06, Vol.70 (2), p.185-200 |
---|---|
1. Verfasser: | |
Format: | Artikel |
Sprache: | eng |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | The paper explores the disjunctive riddle for induction: If we know the sample Ks to be P, we also know that they are P or F (for arbitrary F). Assuming that we also know that the future Ks are non-P, we can conclude that they are F, if only we can inductively infer the evidentially supported P-or-F hypothesis. Yet this is absurd. We cannot predict that future Ks are F based on the knowledge that the samples, and only they, are P. The ensuing challenge is to account for the unprojectibility of the disjunctive hypothesis. I provide an explanation in terms of epistemic dependence. The P-or-F hypothesis is unprojectible because the evidence supporting it depends epistemically on the evidence for the defeated P-hypothesis. The paper also shows that the disjunctive riddle covers the essence of Goodman's infamous grue-problem, which, therefore, can be resolved by the same means: In contrast to the green-hypothesis, the grue-hypothesis is unprojectible because the grue-evidence depends on the evidence for a defeated hypothesis. |
---|---|
ISSN: | 0012-2017 1746-8361 |
DOI: | 10.1111/1746-8361.12136 |