Jump to content

Containment hierarchy

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 62.216.152.66 (talk) at 17:55, 20 October 2006. 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 taxonomy is a classic example of a containment hierarchy:

See also


dsfsdfsdf