Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-17T19:19:45.666Z Has data issue: false hasContentIssue false

The logical simplicity of predicates

Published online by Cambridge University Press:  12 March 2014

Nelson Goodman*
Affiliation:
University of Pennsylvania

Extract

In an earlier article, I proposed a way of determining the relative simplicity of different sets of extralogical primitives. The calculations assumed a fully platonistic logic, committed to an indefinite hierarchy of classes, with sequences and relations defined as classes. Recently it has been shown that a nominalistic logic, countenancing no entities other than individuals, can be made to serve many of the purposes for which a platonistic logic had been thought necessary. The question naturally arises how we are to determine the simplicity of extralogical bases of systems founded upon a nominalistic logic. In such bases, the only extralogical predicates will be predicates (of one or more places) of individuals. The present paper offers a general method of measuring the simplicity of such bases.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1949

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