1.Previous
3.Next

theorem for arbitrary formulas of first-order logic, the simpler version shown here, restricted to formulas in prenex form containing only existential quantifiers, became more popular.

Statement

Let

:

be a formula of first-order logic with quantifier-free,though it may contain additional free variables.This version of Herbrand's theorem states that the above formula is valid if

1.Previous
3.Next