Jump to content

Containment hierarchy

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Karada (talk | contribs) at 02:28, 4 January 2006 (more). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

A containment hierarchy is a 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. (See also: Taxonomy.)