English

Herbrand Consistency of Some Arithmetical Theories

Logic 2019-07-02 v3 Logic in Computer Science

Abstract

G\"odel'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 IΔ0+Ωm{\rm I\Delta_0+\Omega_m} with m2m\geqslant 2, any witness for any bounded formula can be shortened logarithmically. This immediately implies the unprovability of Herbrand consistency of a theory TIΔ0+Ω2T\supseteq {\rm I\Delta_0+\Omega_2} in TT itself. In this paper, the above results are generalized for IΔ0+Ω1{\rm I\Delta_0+\Omega_1}. Also after tailoring the definition of Herbrand consistency for IΔ0{\rm I\Delta_0} we prove the corresponding theorems for IΔ0{\rm I\Delta_0}. Thus the Herbrand version of G\"odel's second incompleteness theorem follows for the theories IΔ0+Ω1{\rm I\Delta_0+\Omega_1} and IΔ0{\rm I\Delta_0}.

Keywords

Cite

@article{arxiv.1005.2654,
  title  = {Herbrand Consistency of Some Arithmetical Theories},
  author = {Saeed Salehi},
  journal= {arXiv preprint arXiv:1005.2654},
  year   = {2019}
}