Let
be a set and
a collection of subsets of
. A set function
is said to possess
finite monotonicity provided that, whenever a set
is covered by a finite
collection
of sets in
,
A set function possessing finite monotonicity is said to be finitely monotone. Note that a set function which is countably
monotone is necessarily finitely monotone provided that
and
, where
is the empty set.