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