An axiomatization of family resemblance

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.