From Wikipedia, the free encyclopedia.
In set theory, any element of a partially ordered set P which is greater than or equal to every element of a given subset S of P is called an upper bound of S.
The term lower bound is similarly defined.
|
|
|
|
|
Websearch | |
Directory | |
Dictionary | |
FactBook | |
|  |
| |
Wikipedia: Upper bound |
|
|
|
Upper bound From Wikipedia, the free encyclopedia. In set theory, any element of a partially ordered set P which is greater than or equal to every element of a given subset S of P is called an upper bound of S. The term lower bound is similarly defined.
|
 |
|
|