24.5 Prenex Normal Form (PNF) and Chain of Equivalences
When a formula has all its quantifiers stacked up out front (widest possible scope), it is in Prenex Normal Form (PNF).
All the quantifiers are widest possible scope.
For example: ExEy(Dog(x)&Dog(y)&~(x=y))
Every sentence of FOL is equivalent to some sentence in PNF. We can use equivalence principles to transform any sentence into its PNF twin.
First, let’s see if you can identify when sentences are in prenx form.
Now let’s take a sentence not in prenex form, and transform it.