have as components only members of the group g; and any member of the second grade can have as components only members of the first grade, and members of g; and so on for the higher grades.
The third condition to be satisfied by an abstractive hierarchy will be called the condition of connexity. Thus an abstractive hierarchy springs from its base; it includes every successive grade from its base either indefinitely onwards, or to its maximum grade; and it is ‘connected’ by the reappearance (in a higher grade) of any set of its members belonging to lower grades, in the function of a set of components or derivative components of at least one member of the hierarchy.
An abstractive hierarchy is called ‘finite’ if it stops at a finite grade of complexity. It is called ‘infinite’ if it includes members belonging respectively to all degrees of complexity.
It is to be noted that the base of an abstractive hierarchy may contain any number of members, finite or infinite. Further, the infinity of the number of the members of the base has nothing to do with the question as to whether the hierarchy be finite or infinite.
A finite abstractive hierarchy will, by definition, possess a grade of maximum complexity. It is characteristic of this grade that a member of it is a component of no other eternal object belonging to any grade of the hierarchy. Also it is evident that this grade of maximum complexity must possess only one member; for otherwise the condition of connexity would not be satisfied. Conversely any complex eternal object defines a finite abstractive hierarchy to be discovered by a process of analysis. This complex
