Email this page to a friend

Upper bound

An upper bound of two elements x and y under some relation <= is an element z such that x <= z and y $lt;= z.

("<=" is written in LaTeX as \sqsubseteq).

See also least upper bound.

< Previous Terms	Terms Containing upper bound	Next Terms >
upgradability upgrade upgradeability upload UPMAIL Tricia Prolog	algebraic bounded boundedly complete complete lattice complete partial ordering	Upper Layer Protocol upper memory block Upper Side-Band modulation Upright Database Technology AB UPS