Individual elements of a hierarchy are often called levels and a hierarchy is said to be infinite if it has infinitely many distinct levels but said to collapse if it has only finitely many distinct levels.
In theoretical computer science, the time hierarchy is a classification of decision problems according to the amount of time required to solve them.
Tree related topics:
Effective complexity hierarchies:
Ineffective complexity hierarchies:
In set theory or logic:
We may need a bigger topos. /wiki/Topos ↩