Email this page to a friend

Inclusive

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

< Previous Terms	Terms Containing inclusive	Next Terms >
in-band inc incantation include include war	Boolean algebra file control block inclusive natural deduction NOR	incomparable incremental analysis incremental backup incremental constraint solver Incremental Prototyping Technology for Embedded Re