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