Hierarchy (mathematics)
From Wikipedia, the free encyclopedia
 |
This article does not cite any references or sources. (December 2007) Please help improve this article by adding citations to reliable sources. Unverifiable material may be challenged and removed. |
In mathematics, a hierarchy is a preorder, i.e. an ordered set. The term is used to stress a natural hierarchical relation among the elements. In particular, it is the preferred terminology for posets whose elements are classes of objects of increasing complexity. In that case, the preorder defining the hierarchy is the class-containment relation. Containment hierarchies are thus special cases of hierarchies.
[edit] Related terminology
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.
[edit] Example
In theoretical computer science, the time hierarchy is a classification of decision problems according to the amount of time required to solve them.
[edit] See also
- Analytical hierarchy
- Arithmetical hierarchy
- Borel hierarchy
- Wadge hierarchy
- Chomsky hierarchy
- Difference hierarchy
- Polynomial hierarchy
- Abstract Algebraic Hierarchy or the Leibniz Hierarchy
 |
This mathematics-related article is a stub. You can help Wikipedia by expanding it. |
