In domain theory, a predicate P : D -> Bool is incLUsive iff For any chain C, a subset of D, and for all c in C, P(c) => P(LUb C) In other words, if the predicate holds for all elements of an increasing sequence then it holds for their {least upper bound}. ("LUb is written in LaTeX as sqcup). (1995-02-03)