1. In some applications of logic such as programming, a finite set of literals, i.e., a finite set in which each element is an atomic formula or a negation of an atomic formula. Such sets are interpreted as disjunctions.
2. A disjunction over a clause in the foregoing sense, i.e., a formula of the form:
where each is a literal. This notion of clause is sometimes encountered as an elementary disjunction.