You are here: irt.org | FOLDOC | upper bound
An upper bound of two elements x and y under some relation
<= is an element z such that x <= z and y <= z.
("<=" is written in LaTeX as \sqsubseteq).
See also least upper bound.
Nearby terms: upgradeability « upload « UPMAIL Tricia Prolog « upper bound » Upper Layer Protocol » upper memory block » Upper Side-Band modulation
FOLDOC, Topics, A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, ?, ALL
©2018 Martin Webb