Abstract.
We prove that the Gödel incompleteness theorem holds for a weak arithmetic T = IΔ0 + Ω2 in the form
where Cons H (T) is an arithmetic formula expressing the consistency of T with respect to the Herbrand notion of provability.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: 22 September 1997 / Revised version: 27 March 2000 /¶Published online: 15 June 2001
Rights and permissions
About this article
Cite this article
Adamowicz, Z., Zbierski, P. On Herbrand consistency in weak arithmetic. Arch. Math. Logic 40, 399–413 (2001). https://doi.org/10.1007/s001530000072
Issue Date:
DOI: https://doi.org/10.1007/s001530000072