Ordered set
From Wikipedia, the free encyclopedia
 |
This article does not cite any references or sources. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. (August 2010) |
 |
This article needs attention from an expert on the subject. See the talk page for details. Consider associating this request with a WikiProject. (August 2010) |
In order theory in mathematics, a set with a binary relation R on its elements that is reflexive (for all a in the set, aRa), antisymmetric (if aRb and bRa, then a = b) and transitive (if aRb and bRc, then aRc) is described as a partially ordered set or poset. If the binary relation is antisymmetric, transitive and also total (for all a and b in the set, aRb or bRa), then the set is a totally ordered set. If every non-empty subset has a least element, then the set is a well-ordered set.
In information theory, an ordered set is a non-data carrying set of bits as used in 8b/10b encoding.
[edit] See also
- Array data structure (computing)
- List (computing)
