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. (1995-02-15)

In addition suitable contents:
[ 2 ] [ = ] [ al ] [ am ] [ an ] [ ar ] [ arc ] [ as ] [ at ] [ b ] [ bo ] [ bs ] [ ch ] [ de ] [ du ] [ ee ] [ element ] [ er ] [ et ] [ fi ] [ file ] [ h ] [ hat ] [ hr ] [ id ] [ il ] [ in ] [ io ] [ is ] [ it ] [ la ] [ LaTeX ] [ least upper bound ] [ Lex ] [ ls ] [ mo ] [ mod ] [ module ] [ na ] [ om ] [ pe ] [ ph ] [ query ] [ rc ] [ re ] [ relation ] [ S ] [ se ] [ set ] [ so ] [ sqsubseteq ] [ st ] [ su ] [ subseteq ] [ T ] [ th ] [ tt ] [ tw ] [ up ] [ X ]