Abstract
Recently Samuel Richmond, generalizing Nelson Goodman, has proposed a measure of the simplicity of a theory that takes into account not only the polymorphicity of its models but also their internal homogeneity. By this measure a theory is simple if small subsets of its models exhibit only a few distinct (i.e., non-isomorphic) structures. Richmond shows that his measure, unlike that given by Goodman's theory of simplicity of predicates, orders the order relations in an intuitively satisfactory manner. In this note I formalize his presentation and suggest an improvement designed to overcome certain technical difficulties.
Similar content being viewed by others
References
Chang, C. C., and Keisler, H. J.: 1973, Model Theory, American Elsevier Publishing Company, Inc., NY.
Goodman, N.: 1961, ‘Safety, Strength, and Simplicity’, Philosophy of Science 28, 150–1. Reprinted in 1972, Problems and Projects, pp. 334–336.
Goodman, N.: 1977, The Structure of Appearance, 3rd edition, D. Reidel, Boston.
Goodman, N.: 1983, Fact, Finction, and Forecast, Harvard University Press, Cambridge, MA.
Harary, F.: 1969, Graph Theory, Addison-Wesley Publishing Co., Reading, MA.
Richmond, Samuel A.: 1996, ‘A Simplification of the Theory of Simplicity’, Synthese 107, 373–393.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Scott, B.M. Technical notes on a theory of simplicity. Synthese 109, 281–289 (1996). https://doi.org/10.1007/BF00413770
Issue Date:
DOI: https://doi.org/10.1007/BF00413770