Herbrandization

The Herbrandization of a logical formula (named after Jacques Herbrand) is a construction that is dual to the Skolemization of a formula. Thoralf Skolem had considered the Skolemizations of formulas in prenex form as part of his proof of the Löwenheim–Skolem theorem (Skolem 1920). Herbrand worked with this dual notion of Herbrandization, generalized to apply to non-prenex formulas as well, in order to prove Herbrand's theorem (Herbrand 1930).

The resulting formula is not necessarily equivalent to the original one. As with Skolemization, which only preserves satisfiability, Herbrandization being Skolemization's dual preserves validity: the resulting formula is valid if and only if the original one is.

Definition and examples

Let ${\displaystyle F}$ be a formula in the language of first-order logic. We may assume that ${\displaystyle F}$ contains no variable that is bound by two different quantifier occurrences, and that no variable occurs both bound and free. (That is, ${\displaystyle F}$ could be relettered to ensure these conditions, in such a way that the result is an equivalent formula).

The Herbrandization of ${\displaystyle F}$ is then obtained as follows:

• First, replace any free variables in ${\displaystyle F}$ by constant symbols.
• Second, delete all quantifiers on variables that are either (1) universally quantified and within an even number of negation signs, or (2) existentially quantified and within an odd number of negation signs.
• Finally, replace each such variable ${\displaystyle v}$ with a function symbol ${\displaystyle f_{v}(x_{1},\dots ,x_{k})}$, where ${\displaystyle x_{1},\dots ,x_{k}}$ are the variables that are still quantified, and whose quantifiers govern ${\displaystyle v}$.

For instance, consider the formula ${\displaystyle F:=\forall y\exists x[R(y,x)\wedge \neg \exists zS(x,z)]}$. There are no free variables to replace. The variables ${\displaystyle y,z}$ are the kind we consider for the second step, so we delete the quantifiers ${\displaystyle \forall y}$ and ${\displaystyle \exists z}$. Finally, we then replace ${\displaystyle y}$ with a constant ${\displaystyle c_{y}}$ (since there were no other quantifiers governing ${\displaystyle y}$), and we replace ${\displaystyle z}$ with a function symbol ${\displaystyle f_{z}(x)}$:

${\displaystyle F^{H}=\exists x[R(c_{y},x)\wedge \neg S(x,f_{z}(x))].}$

The Skolemization of a formula is obtained similarly, except that in the second step above, we would delete quantifiers on variables that are either (1) existentially quantified and within an even number of negations, or (2) universally quantified and within an odd number of negations. Thus, considering the same ${\displaystyle F}$ from above, its Skolemization would be:

${\displaystyle F^{S}=\forall y[R(y,f_{x}(y))\wedge \neg \exists zS(f_{x}(y),z)].}$

To understand the significance of these constructions, see Herbrand's theorem or the Löwenheim–Skolem theorem.

See also

• Predicate functor logic

References

• Skolem, T. "Logico-combinatorial investigations in the satisfiability or provability of mathematical propositions: A simplified proof of a theorem by L. Löwenheim and generalizations of the theorem". (In van Heijenoort 1967, 252-63.)
• Herbrand, J. "Investigations in proof theory: The properties of true propositions". (In van Heijenoort 1967, 525-81.)
• van Heijenoort, J. From Frege to Gödel: A Source Book in Mathematical Logic, 1879-1931. Harvard University Press, 1967.