ArticleslgStudy

science

Prenex normal form

Prenex normal form is a science 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 Prenex normal form rather than just read about it. In short: A formula of the predicate calculus is in prenex normal form (PNF) if it is written as a string of quantifiers and bound variables, called the prefix, followed by a quantifier-free part, called the matrix. Together with the normal forms in propositional logic (e.g. disjunctive normal form or conjunctive normal form), it provides a canonical normal form useful in automated theorem proving.

Key takeaways

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

Reference excerpt

A formula of the predicate calculus is in prenex normal form (PNF) if it is written as a string of quantifiers and bound variables, called the prefix, followed by a quantifier-free part, called the matrix. Together with the normal forms in propositional logic (e.g. disjunctive normal form or conjunctive normal form), it provides a canonical normal form useful in automated theorem proving. Every formula in classical logic is logically equivalent to a formula in prenex normal form. For example, if ϕ ( y ) {\displaystyle \phi (y)} , ψ ( z ) {\displaystyle \psi (z)} , and ρ ( x ) {\displaystyle \rho (x)} are quantifier-free formulas with the free variables shown then

∀ x ∃ y ∀ z ( ϕ ( y ) ∨ ( ψ ( z ) → ρ ( x ) ) ) {\displaystyle \forall x\exists y\forall z(\phi (y)\lor (\psi (z)\rightarrow \rho (x)))}

is in prenex normal form with matrix ϕ ( y ) ∨ ( ψ ( z ) → ρ ( x ) ) {\displaystyle \phi (y)\lor (\psi (z)\rightarrow \rho (x))} , while

∀ x ( ( ∃ y ϕ ( y ) ) ∨ ( ( ∃ z ψ ( z ) ) → ρ ( x ) ) ) {\displaystyle \forall x((\exists y\phi (y))\lor ((\exists z\psi (z))\rightarrow \rho (x)))}

is logically equivalent but not in prenex normal form.

Conversion to prenex form

Every first-order formula is logically equivalent (in classical logic) to some formula in prenex normal form. There are several conversion rules that can be recursively applied to convert a formula to prenex normal form. The rules depend on which logical connectives appear in the formula.

Conjunction and disjunction The rules for conjunction and disjunction say that

( ∀ x ϕ ) ∧ ψ {\displaystyle (\forall x\phi )\land \psi } is equivalent to ∀ x ( ϕ ∧ ψ ) {\displaystyle \forall x(\phi \land \psi )} under (mild) additional condition ∃ x ⊤ {\displaystyle \exists x\top } , or, equivalently, ¬ ∀ x ⊥ {\displaystyle \lnot \forall x\bot } (meaning that at least one individual exists),

( ∀ x ϕ ) ∨ ψ {\displaystyle (\forall x\phi )\lor \psi } is equivalent to ∀ x ( ϕ ∨ ψ ) {\displaystyle \forall x(\phi \lor \psi )} ; and

( ∃ x ϕ ) ∧ ψ {\displaystyle (\exists x\phi )\land \psi } is equivalent to ∃ x ( ϕ ∧ ψ ) {\displaystyle \exists x(\phi \land \psi )} ,

( ∃ x ϕ ) ∨ ψ {\displaystyle (\exists x\phi )\lor \psi } is equivalent to ∃ x ( ϕ ∨ ψ ) {\displaystyle \exists x(\phi \lor \psi )} under additional condition ∃ x ⊤ {\displaystyle \exists x\top } . The equivalences are valid when x {\displaystyle x} does not appear as a free variable of ψ {\displaystyle \psi } ; if x {\displaystyle x} does appear free in ψ {\displaystyle \psi } , one can rename the bound x {\displaystyle x} in ( ∃ x ϕ ) {\displaystyle (\exists x\phi )} and obtain the equivalent ( ∃ x ′ ϕ [ x / x ′ ] ) {\displaystyle (\exists x'\phi [x/x'])} . For example, in the language of rings,

( ∃ x ( x 2 = 1 ) ) ∧ ( 0 = y ) {\displaystyle (\exists x(x^{2}=1))\land (0=y)} is equivalent to ∃ x ( x 2 = 1 ∧ 0 = y ) {\displaystyle \exists x(x^{2}=1\land 0=y)} , but

( ∃ x ( x 2 = 1 ) ) ∧ ( 0 = x ) {\displaystyle (\exists x(x^{2}=1))\land (0=x)} is not equivalent to ∃ x ( x 2 = 1 ∧ 0 = x ) {\displaystyle \exists x(x^{2}=1\land 0=x)}

… excerpt ends here. Continue reading the full article.

Worked examples

Example 1 — a first encounter with Prenex normal form

Start with the simplest possible case. Write down what Prenex normal form claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In science, 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 Prenex 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 Prenex 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 Prenex normal form

In research
Prenex normal form appears in science 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 Prenex 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
Prenex normal form is common in secondary-school and first-year university syllabi. It links to neighbouring topics Normal forms (logic), so understanding it makes those chapters shorter.
In everyday life
Look for Prenex 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 Prenex normal form in 20 minutes

  1. Read the reference excerpt below once, without taking notes.
  2. Close the page and write down what Prenex 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 Prenex normal form out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Prenex normal form in simple terms?

A formula of the predicate calculus is in prenex normal form (PNF) if it is written as a string of quantifiers and bound variables, called the prefix, followed by a quantifier-free part, called the matrix. Together with the normal forms in propositional logic (e.g. disjunctive normal form or conjun…

Why does Prenex normal form matter?

Because it connects several science 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 Prenex 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 Prenex normal form.

Tags

  • Normal forms (logic)

Keep exploring