In the description of any formally defined set, the rules by which an object may be defined as included in the set are referred to as rules of inclusion or inclusive rules.
In the description of a mathematical set, the term inclusive denotes that the endpoints of a range are included within the set. For example, "the integers -2 to 2 inclusive" refers to the set {-2,-1,0,1,2}; the endpoints, -2 and 2, are included. The term is generally applied to discrete elements.
In Boolean logic the inclusive or (or simply or) operator is true if either or both arguments are true. Distinct from exclusive or, which refers to exclusive disjunction, which has a true value if either but not both arguments are true.