ORy> 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)