Lower and upper bounds for the provability of Herbrand consistency in weak arithmetics
We prove that for i ≥ 1, the arithmetic does not prove a variant of its own Herbrand consistency restricted to the terms of depth in , where ε is an arbitrarily small constant greater than zero. On the other hand, the provability holds for the set of terms of depths in .