Upper bound
Summary
Let be a subset of a partially ordered set. An upper bound of is an element that is at least as large as each element of .
What this node needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
The writing levels say how complete the text of a node is. They do not measure its truth.
Sources
- Web https://en.wikipedia.org/wiki/Upper_and_lower_bounds, lead section
What links here
Definitions
- Upper bound 0H5J02P8S9