Mathematical logic and foundations First-order logic Concept
Prenex normal form
Summary
A formula is in prenex normal form when all its quantifiers stand at the front, followed by a part without quantifiers. In classical first-order logic every formula is equivalent to a formula in prenex normal form. The string of quantifiers in front measures the logical complexity of the formula, as in the arithmetical hierarchy. Prenex form is also the first step towards Skolem normal form.
Where this leads
1 page builds on this one.
Further reading
About this page
| Tag | CS82V969DE |
|---|---|
| URI | m2://CS82V969DE |
| Kind | concept |
| Writing | W0 stub |
| MSC | 03B10 |
| Same as | |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.