Is there a term for a boolean expression that only consists of atoms, negations of atoms, and a single unique logical operator?

Question

For example:

$a \vee b \vee c \vee \neg d$

$a \land \neg b \land \neg c \land d$

these could be described using the term I'm looking for. The following, however, could not be:

$(a \vee b) \land (c \vee \neg d)$

$a \vee (\neg b \land \neg c) \vee d$

as each contains two distinct operators (other than negation)

Answer 1

In logic, a clause is an expression formed from a finite collection of literals (atoms or their negations) that is true either whenever at least one of the literals that form it is true (a disjunctive clause), or when all of the literals that form it are true (a conjunctive clause).