A formula is in prenex normal form if it is written as a string of (universal or existential) quantifiers and bound logical variables, called the prefix, followed by a quantifier-free part, called the matrix.

Every first-order logical formula can be written in prenex normal form.

Classification of formulas in prenex normal form often involves looking at the quantifier alternation structure of the prefix.

See also wikipedia's page.