Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4663220 | Journal of Applied Logic | 2007 | 9 Pages |
Abstract
We invoke concepts from the theory of hypergraphs to give a measure of the closeness of family resemblance, and to make precise the idea of a composite likeness. It is shown that for any positive integer m, for any general term possessing any extent of family resemblance strictly greater than m, there is a taxonomical representation of the term whereby each subordinate taxon has an extent of family resemblance strictly greater than m.
Related Topics
Physical Sciences and Engineering
Mathematics
Logic
Authors
R.E. Jennings, D.X. Nicholson,