(definition)
Definition: A set S2 is a proper subset of another set S1 if every element in S2 is in S1 and S1 has some elements which are not in S2.
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 17 December 2004.
HTML page formatted Mon Sep 11 09:46:06 2006.
Cite this as:
Paul E. Black, "proper subset", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 17 December 2004. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/propersubset.html