Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-14T22:17:50.401Z Has data issue: false hasContentIssue false

Predicates and Projectibility

Published online by Cambridge University Press:  01 January 2020

Michael H. Kelley*
Affiliation:
University of Alberta

Extract

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 (projectible) 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.

Information

Type
Research Article
Copyright
Copyright © The Authors 1971

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable