Conjunctive normal form (CNF)

A Boolean function is in conjunctive normal form if it is a collection of or statements unified by and operations. The or statements can contain negated variables but no further nesting.

The following are in CNF:

• ,
• ,
• ,
• ,
• , and
• .

The following are not in CNFL:

• ,
• , and
• .