# Prenex normal form

A formula of the predicate calculus is in **prenex ^{[1]} normal form** if it is written as a string of quantifiers and bound variables, called the

**prefix**, followed by a quantifier-free part, called the

**matrix**.

^{[2]}

Every formula in classical logic is equivalent to a formula in prenex normal form. For example, if , , and are quantifier-free formulas with the free variables shown then

is in prenex normal form with matrix , while

is logically equivalent but not in prenex normal form.

## Contents

## Conversion to prenex form[edit]

This section needs additional citations for verification. (August 2018) (Learn how and when to remove this template message) |

Every first-order formula is logically equivalent (in classical logic) to some formula in prenex normal form.^{[3]} 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[edit]

The rules for conjunction and disjunction say that

- is equivalent to under (mild) additional condition , or, equivalently, (meaning that at least one individual exists),
- is equivalent to ;

and

- is equivalent to ,
- is equivalent to under additional condition .

The equivalences are valid when does not appear as a free variable of ; if does appear free in , one can rename the bound in and obtain the equivalent .

For example, in the language of rings,

- is equivalent to ,

but

- is not equivalent to

because the formula on the left is true in any ring when the free variable *x* is equal to 0, while the formula on the right has no free variables and is false in any nontrivial ring. So will be first rewritten as and then put in prenex normal form .

### Negation[edit]

The rules for negation say that

- is equivalent to

and

- is equivalent to .

### Implication[edit]

There are four rules for implication: two that remove quantifiers from the antecedent and two that remove quantifiers from the consequent. These rules can be derived by rewriting the implication as and applying the rules for disjunction above. As with the rules for disjunction, these rules require that the variable quantified in one subformula does not appear free in the other subformula.

The rules for removing quantifiers from the antecedent are (note the change of quantifiers):

- is equivalent to ,
- is equivalent to .

The rules for removing quantifiers from the consequent are:

- is equivalent to ,
- is equivalent to .

### Example[edit]

Suppose that , , and are quantifier-free formulas and no two of these formulas share any free variable. Consider the formula

- .

By recursively applying the rules starting at the innermost subformulas, the following sequence of logically equivalent formulas can be obtained:

- .
- ,
- ,
- ,
- ,
- ,
- ,
- .

This is not the only prenex form equivalent to the original formula. For example, by dealing with the consequent before the antecedent in the example above, the prenex form

can be obtained:

- ,
- ,
- .

### Intuitionistic logic[edit]

The rules for converting a formula to prenex form make heavy use of classical logic. In intuitionistic logic, it is not true that every formula is logically equivalent to a prenex formula. The negation connective is one obstacle, but not the only one. The implication operator is also treated differently in intuitionistic logic than classical logic; in intuitionistic logic, it is not definable using disjunction and negation.

The BHK interpretation illustrates why some formulas have no intuitionistically-equivalent prenex form. In this interpretation, a proof of

is a function which, given a concrete *x* and a proof of , produces a concrete *y* and a proof of ψ(*y*). In this case it is allowable for the value of *y* to be computed from the given value of *x*. A proof of

on the other hand, produces a single concrete value of *y* and a function that converts any proof of into a proof of ψ(*y*). If each *x* satisfying φ can be used to construct a *y* satisfying ψ but no such *y* can be constructed without knowledge of such an *x* then formula (1) will not be equivalent to formula (2).

The rules for converting a formula to prenex form that do *fail* in intuitionistic logic are:

- (1) implies ,
- (2) implies ,
- (3) implies ,
- (4) implies ,
- (5) implies ,

(*x* does not appear as a free variable of in (1) and (3); *x* does not appear as a free variable of in (2) and (4)).

## Use of prenex form[edit]

Some proof calculi will only deal with a theory whose formulae are written in prenex normal form. The concept is essential for developing the arithmetical hierarchy and the analytical hierarchy.

Gödel's proof of his completeness theorem for first-order logic presupposes that all formulae have been recast in prenex normal form.

Tarski's axioms for geometry is a logical system whose sentences can *all* be written in **universal-existential form**, a special case of the prenex normal form that has every universal quantifier preceding any existential quantifier, so that all sentences can be rewritten in the form , where is a sentence that does not contain any quantifier. This fact allowed Tarski to prove that Euclidean geometry is decidable.

## See also[edit]

Look up in Wiktionary, the free dictionary.prenex |

## Notes[edit]

## References[edit]

- Hinman, P. (2005),
*Fundamentals of Mathematical Logic*, A K Peters, ISBN 978-1-56881-262-5