Definition:Negation Normal Form

Definition
A logical formula $$P$$ is in negation normal form (NNF) iff:
 * The only logical connectives connecting substatements of $$P$$ are Not, And and Or, that is, elements of the set $$\left\{{\neg, \and, \or}\right\}$$;
 * The Not sign $$\neg$$ appears only in front of atomic statements.

That is $$P$$ is in negation normal form iff it consists of literals, conjunctions and disjunctions.

Examples

 * $$\left({\neg p \or q \or r}\right) \and \left({\neg q \or r}\right) \and \left({\neg r}\right)$$

is in NNF, and also in Conjunctive Normal Form (CNF).


 * $$\left({\neg p \or q \or r}\right) \and \left({\left({p \and \neg q}\right) \or r}\right) \and \left({\neg r}\right)$$

is in NNF, but not in CNF because there is a conjunction buried in the second disjunction.


 * $$\left({\neg p \or q \or r}\right) \and \neg \left({\neg q \or r}\right) \and \left({\neg r}\right)$$

is not in NNF because there is a Not before the second disjunction (only atoms are allowed to be negated).


 * $$\left({\neg p \and q \and r}\right) \or \left({\neg q \and r}\right) \or \left({\neg r}\right)$$

is in NNF, and also in Disjunctive Normal Form (DNF).


 * $$\left({\neg p \and q \and r}\right) \or \left({\left({p \or \neg q}\right) \and r}\right) \or \left({\neg r}\right)$$

is in NNF, but not in DNF because there is a disjunction buried in the second conjunction.


 * $$\left({\neg p \and q \and r}\right) \or \neg \left({\neg q \and r}\right) \or \left({\neg r}\right)$$

is not in NNF because there is a Not before the second conjunction.