Jump to content

Containment hierarchy

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Tompw (talk | contribs) at 21:59, 21 January 2008 (remove Category:Mathematics - it's in sub-cat Category:Set families). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

A containment hierarchy is a hierarchical collection of strictly nested sets. Each entry in the hierarchy designates a set such that the previous entry is a strict superset, and the next entry is a strict subset. For example, all rectangles are quadrilaterals, but not all quadrilaterals are rectangles, and all squares are rectangles, but not all rectangles are squares. A hierarchy of this kind is to be contrasted with a more general notion of a partially ordered set.

A taxonomy is a classic example of a containment hierarchy:

See also