Article contents
Definability and simplicity
Published online by Cambridge University Press: 12 March 2014
Extract
In the following pages we wish to clarify some questions concerning definitions of relations in terms of other relations. A study is made of how a definition of a relation R1 in terms of another relation R2 works in a given specified universe U. The definition is regarded as a correlation rule between the “possible extensions” of R1 and R2. There are no difficulties in formulating necessary, and in a certain sense also sufficient, formal conditions for the existence of a definition relation between R1 and R2.
In particular, we are concerned with questions such as: “Is every relation of the form s1 definable in terms of some relation of the form s2?” (§ IV) A related question concerns the criterion used by Goodman1 for degrees of complexity, namely, whether for every relation R2 of the form s1 there is some relation R2 of the form s2 such that R1 and R2 are mutually definable (§ V). Some concrete results concerning this condition are stated in the theorems 22–24.
The “complexity function” which is defined (definition 17) and which very naturally suggests itself from the discussion of the definability conditions, seems to furnish an adequate measure of the sort of complexity discussed by Goodman.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 1955
References
1 Goodman, Nelson, The structure of appearance, pp. 59–75Google Scholar.
2 op. cit., p. 69.
- 6
- Cited by