This paper deals with the problem of vindicating a particular type of inductive rule, a rule to govern inferences from observed frequencies to limits of relative frequencies. Reichenbach's rule of induction is defended. By application of two conditions, normalizing conditions and a criterion of linguistic invariance, it is argued that alternative rules lead to contradiction. It is then argued that the rule of induction does not lead to contradiction when suitable restrictions are placed upon the predicates admitted. Goodman's grue-bleen paradox (...) is considered, and an attempt to resolve it is offered. Finally, Reichenbach's pragmatic argument, hinging on convergence properties, is applied. (shrink)

Nelson Goodman's new riddle of induction wears many faces. In one of its guises the new riddle of induction appears as the problem of providing a general account of the distinction between projectible and non-projectible predicates. This is the form of the riddle which is supposed to point up a lacuna in the foundations of confirmation theories such as Carnap's which, Goodman charges, work only to the extent that one builds into them just the right predicates. As a new riddle (...) of induction, the problem of distinguishing projectible from non-projectible predicates has the virtue that it is in fact new—a virtue not shared by some other forms of the riddle.Philosophers had recognized previously that some predicates are more projectible than others in the sense that, for instance, the prediction that a certain toss of a die will turn up an even face is safer and more likely to be true than the prediction that the same toss will turn up six. (shrink)