Hilbert–Bernays provability conditions

In mathematical logic, the Hilbert–Bernays provability conditions, named after David Hilbert and Paul Bernays, are a set of requirements for formalized provability predicates in formal theories of arithmetic (Smith 2007:224).

These conditions are used in many proofs of Kurt Gödel's second incompleteness theorem. They are also closely related to axioms of provability logic.

The conditions
Let $T$ be a formal theory of arithmetic with a formalized provability predicate $Prov(n)$, which is expressed as a formula of $T$ with one free number variable. For each formula $φ$ in the theory, let $
 * (φ)$ be the Gödel number of $φ$. The Hilbert–Bernays provability conditions are:


 * 1) If $T$ proves a sentence $φ$ then $T$ proves $Prov(#(φ))$.
 * 2) For every sentence $φ$, $T$ proves $Prov(#(φ)) → Prov(#(Prov(#(φ))))$
 * 3) $T$ proves that $Prov(#(φ → ψ))$ and $Prov(#(φ))$ imply $Prov(#(ψ))$

Note that $Prov$ is predicate of numbers, and it is a provability predicate in the sense that the intended interpretation of $Prov(#(φ))$ is that there exists a number that codes for a proof of $φ$. Formally what is required of $Prov$ is the above three conditions.

In the more concise notation of provability logic, letting $$T \vdash \varphi$$ denote "$$T$$ proves $$\varphi$$" and $$\Box \varphi$$ denote $$\text{Prov}(\#(\varphi))$$:
 * 1) $$(T \vdash \varphi) \to (T \vdash \Box \varphi)$$
 * 2) $$T \vdash (\Box \phi \to \Box \Box \phi)$$
 * 3) $$T \vdash (\Box (\varphi \to \psi) \to \Box \varphi \to \Box \psi)$$

Use in proving Gödel's incompleteness theorems
The Hilbert–Bernays provability conditions, combined with the diagonal lemma, allow proving both of Gödel's incompleteness theorems shortly. Indeed the main effort of Godel's proofs lied in showing that these conditions (or equivalent ones) and the diagonal lemma hold for Peano arithmetics; once these are established the proof can be easily formalized.

Using the diagonal lemma, there is a formula $$\rho$$ such that $$T \Vdash \rho \leftrightarrow \neg Prov(\#(\rho))$$.

Proving Godel's first incompleteness theorem
For the first theorem only the first and third conditions are needed.

The condition that $T$ is ω-consistent is generalized by the condition that if for every formula $φ$, if $T$ proves $Prov(#(φ))$, then $T$ proves $φ$. Note that this indeed holds for an $ω$-consistent $T$ because $Prov(#(φ))$ means that there is a number coding for the proof of $φ$, and if $T$ is $ω$-consistent then going through all natural numbers one can actually find such a particular number $a$, and then one can use $a$ to construct an actual proof of $φ$ in $T$.

Suppose T could have proven $$\rho$$. We then would have the following theorems in $T$: Thus $T$ proves both $$Prov(\#(\rho))$$ and $$\neg Prov(\#(\rho))$$. But if $T$ is consistent, this is impossible, and we are forced to conclude that $T$ does not prove $$\rho$$.
 * 1) $$T\Vdash \rho$$
 * 2) $$T\Vdash \neg Prov(\#(\rho))$$ (by construction of $$\rho$$ and theorem 1)
 * 3) $$T\Vdash Prov(\#(\rho))$$ (by condition no. 1 and theorem 1)

Now let us suppose $T$ could have proven $$\neg\rho$$. We then would have the following theorems in $T$: Thus $T$ proves both $$\rho$$ and $$\neg\rho$$. But if $T$ is consistent, this is impossible, and we are forced to conclude that $T$ does not prove $$\neg\rho$$.
 * 1) $$T\Vdash \neg\rho$$
 * 2) $$T\Vdash Prov(\#(\rho))$$ (by construction of $$\rho$$ and theorem 1)
 * 3) $$T\Vdash \rho$$ (by ω-consistency)

To conclude, $T$ can prove neither $$\rho$$ nor $$\neg\rho$$.

Using Rosser's trick
Using Rosser's trick, one needs not assume that $T$ is $ω$-consistent. However, one would need to show that the first and third provability conditions holds for $Prov^{R}$, Rosser's provability predicate, rather than for the naive provability predicate Prov. This follows from the fact that for every formula $&phi;$, $Prov(#(&phi;))$ holds if and only if $Prov^{R}$ holds.

An additional condition used is that $T$ proves that $Prov^{R}(#(&phi;))$ implies $¬Prov^{R}(#(¬&phi;))$. This condition holds for every $T$ that includes logic and very basic arithmetics (as elaborated in Rosser's trick).

Using Rosser's trick, $&rho;$ is defined using Rosser's provability predicate, instead of the naive provability predicate. The first part of the proof remains unchanged, except that the provability predicate is replaced with Rosser's provability predicate there, too.

The second part of the proof no longer uses ω-consistency, and is changed to the following:

Suppose $T$ could have proven $$\neg\rho$$. We then would have the following theorems in $T$: Thus $T$ proves both $$Prov^R(\#(\neg\rho))$$ and $$\neg Prov^R(\#(\neg\rho))$$. But if $T$ is consistent, this is impossible, and we are forced to conclude that $T$ does not prove $$\neg\rho$$.
 * 1) $$T\Vdash \neg\rho$$
 * 2) $$T\Vdash Prov^R(\#(\rho))$$ (by construction of $$\rho$$ and theorem 1)
 * 3) $$T\Vdash \neg Prov^R(\#(\neg\rho))$$ (by theorem 2 and the additional condition following the definition of Rosser's provability predicate)
 * 4) $$T\Vdash Prov^R(\#(\neg\rho))$$ (by condition no. 1 and theorem 1)

The second theorem
We assume that $T$ proves its own consistency, i.e. that:
 * $$T\Vdash \neg Prov(\#(1=0)) $$.

For every formula $&phi;$:
 * $$T\Vdash \neg\varphi \rightarrow (\varphi\rightarrow (1=0)) $$ (by negation elimination)

It is possible to show by using condition no. 1 on the latter theorem, followed by repeated use of condition no. 3, that:
 * $$T\Vdash Prov(\#(\neg\varphi))\rightarrow (Prov (\#(\varphi)) \rightarrow Prov(\#(1=0))) $$

And using $T$ proving its own consistency it follows that:
 * $$T\Vdash Prov(\#(\neg\varphi))\rightarrow \neg Prov (\#(\varphi)) $$

We now use this to show that $T$ is not consistent: Thus $T$ proves both $$Prov(\#(\rho))$$ and $$\neg Prov(\#(\rho))$$, hence is $T$ inconsistent.
 * 1) $$T\Vdash Prov(\#(\neg Prov(\#(\rho)))\rightarrow \neg Prov(\#(Prov(\#(\rho)))$$ (following $T$ proving its own consistency, with $$\varphi = Prov(\#(\rho))$$)
 * 2) $$T\Vdash \rho\rightarrow \neg Prov(\#(\rho))$$ (by construction of $$\rho$$)
 * 3) $$T\Vdash Prov(\#(\rho\rightarrow \neg Prov(\#(\rho)))$$ (by condition no. 1 and theorem 2)
 * 4) $$T\Vdash Prov(\#(\rho)) \rightarrow Prov(\#(\neg Prov(\#(\rho)))$$ (by condition no. 3 and theorem 3)
 * 5) $$T\Vdash Prov(\#(\rho)) \rightarrow \neg Prov(\#(Prov(\#(\rho)))$$ (by theorems 1 and 4)
 * 6) $$T\Vdash Prov(\#(\rho)) \rightarrow Prov(\#(Prov(\#(\rho)))$$ (by condition no. 2)
 * 7) $$T\Vdash \neg Prov(\#(\rho))$$ (by theorems 5 and 6)
 * 8) $$T\Vdash \neg Prov(\#(\rho)) \rightarrow \rho$$ (by construction of $$\rho$$)
 * 9) $$T\Vdash \rho$$ (by theorems 7 and 8)
 * 10) $$T\Vdash Prov(\#(\rho)) $$ (by condition 1 and theorem 9)