ArticleslgStudy

mathematics

Negation normal form

Negation normal form is a mathematics topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Negation normal form rather than just read about it. In short: In mathematical logic, a formula is in negation normal form (NNF) if the negation operator ( ¬ {\displaystyle \lnot } , not) is only applied to variables and the only other allowed Boolean operators are conjunction ( ∧ {\displaystyle \land } , and) and disjunction ( ∨ {\displaystyle \lor } , or). Negation normal form is not a canonical form: for example, a ∧ ( b ∨ ¬ c ) {\displaystyle a\land (b\lor \lnot c)} and ( a…

Key takeaways

  • Negation normal form belongs to mathematics; place it in that map before memorising details.
  • Learn the definition first, then one example that makes the definition concrete.
  • Connect Negation normal form to a quantity you can measure, compute or draw — that is where exam questions come from.
  • Reproduce the core statement of Negation normal form from memory before moving on to harder problems.

Reference excerpt

In mathematical logic, a formula is in negation normal form (NNF) if the negation operator ( ¬ {\displaystyle \lnot } , not) is only applied to variables and the only other allowed Boolean operators are conjunction ( ∧ {\displaystyle \land } , and) and disjunction ( ∨ {\displaystyle \lor } , or). Negation normal form is not a canonical form: for example, a ∧ ( b ∨ ¬ c ) {\displaystyle a\land (b\lor \lnot c)} and ( a ∧ b ) ∨ ( a ∧ ¬ c ) {\displaystyle (a\land b)\lor (a\land \lnot c)} are equivalent, and are both in negation normal form.

Definition The following is a context-free grammar for NNF:

where Variable is any variable.

Examples and counterexamples

The following formulae are all in negation normal form:

( ( A ∨ B ) ∧ C ) ( A ∨ ¬ B ) ( A ∧ ¬ B ) ( ( A ∧ ( ¬ B ∨ C ) ) ∧ ¬ C ) {\displaystyle {\begin{aligned}&((A\lor B)\land C)\\&(A\lor \lnot B)\\&(A\land \lnot B)\\&((A\land (\lnot B\lor C))\land \lnot C)\end{aligned}}}

The first example is also in conjunctive normal form, the next two are in both conjunctive normal form and disjunctive normal form, but the last example is in neither. The following formulae are not in negation normal form:

( A → B ) ¬ ( A ∨ B ) ¬ ( A ∧ B ) ¬ ( A ∨ ¬ C ) {\displaystyle {\begin{aligned}(A&\to B)\\\lnot (A&\lor B)\\\lnot (A&\land B)\\\lnot (A&\lor \lnot C)\end{aligned}}}

They are however respectively equivalent to the following formulae in negation normal form:

( ¬ A ∨ B ) ( ¬ A ∧ ¬ B ) ( ¬ A ∨ ¬ B ) ( ¬ A ∧ C ) {\displaystyle {\begin{aligned}(\lnot A&\lor B)\\(\lnot A&\land \lnot B)\\(\lnot A&\lor \lnot B)\\(\lnot A&\land C)\end{aligned}}}

Conversion to NNF In classical logic and many modal logics, every formula can be brought into this form by replacing implications ( → {\displaystyle \to } ) and equivalences ( ↔ {\displaystyle \leftrightarrow } ) by their definitions, using De Morgan's laws to push negation inwards, and eliminating double negations. This process can be represented using the following rewrite rules:

… excerpt ends here. Continue reading the full article.

Worked examples

Example 1 — a first encounter with Negation normal form

Start with the simplest possible case. Write down what Negation normal form claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In mathematics, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Negation normal form before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Negation normal form ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Negation normal form

In research
Negation normal form appears in mathematics research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry
Engineering practice reuses Negation normal form in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom
Negation normal form is common in secondary-school and first-year university syllabi. It links to neighbouring topics Knowledge compilation, Normal forms (logic), Propositional calculus, so understanding it makes those chapters shorter.
In everyday life
Look for Negation normal form outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Negation normal form in 20 minutes

  1. Read the reference excerpt below once, without taking notes.
  2. Close the page and write down what Negation normal form means in your own words.
  3. Compare your version with the excerpt and mark what you missed.
  4. Work through the three examples above with pen and paper.
  5. Explain Negation normal form out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Negation normal form in simple terms?

In mathematical logic, a formula is in negation normal form (NNF) if the negation operator ( ¬ {\displaystyle \lnot } , not) is only applied to variables and the only other allowed Boolean operators are conjunction ( ∧ {\displaystyle \land } , and) and disjunction ( ∨ {\displaystyle \lor } , or). N…

Why does Negation normal form matter?

Because it connects several mathematics ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Negation normal form?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Negation normal form.

Tags

  • Knowledge compilation
  • Normal forms (logic)
  • Propositional calculus

Keep exploring