Herbrand Consistency of Some Arithmetical Theories
arXiv:1005.2654 · doi:10.2178/jsl/1344862163
Abstract
Gödel's second incompleteness theorem is proved for Herbrand consistency of some arithmetical theories with bounded induction, by using a technique of logarithmic shrinking the witnesses of bounded formulas, due to Z. Adamowicz [Herbrand consistency and bounded arithmetic, \textit{Fundamenta Mathematicae} 171 (2002) 279--292]. In that paper, it was shown that one cannot always shrink the witness of a bounded formula logarithmically, but in the presence of Herbrand consistency, for theories with , any witness for any bounded formula can be shortened logarithmically. This immediately implies the unprovability of Herbrand consistency of a theory in itself. In this paper, the above results are generalized for . Also after tailoring the definition of Herbrand consistency for we prove the corresponding theorems for . Thus the Herbrand version of Gödel's second incompleteness theorem follows for the theories and .