INdomaiN 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 iNLaTeX as sqcup). (1995-02-03)