Mathematical developments of the incompleteness theorems

This is a survey of some old and new results on and about the incompleteness phenomenon from the author's viewpoint. It is comparable, in depth and width, to the good survey of \textit{Y. Cheng} [Bull. Symb. Log. 27, No. 2, 113--167 (2021; Zbl 1497.03067)] cited in the paper as [12] and to the older marvelous survey of \textit{L. D. Beklemishev} [Russ. Math. Surv. 65, No. 5, 857--899 (2010; Zbl 1213.03071); translation from Usp. Mat. Nauk 65, No. 5, 61--106 (2010)] not cited here. The first two sections are an introduction and some standard preliminaries. The first incompleteness theorem is talked about in Section 3, which contains the results as old as Rosser's 1936 extension of Gödel's theorem to a new joint result of the author published in 2022 [\textit{T. Kurahashi} et al., Ann. Pure Appl. Logic 173, No. 5, Article ID 103087, 25 p. (2022; Zbl 1539.03192)]. The second incompleteness theorem is the topic of Section 4, where various derivability conditions are introduced along with the discussion. The short Section 5 is on the reflection principles. The paper continues with Sections 6 and 7, which are on the extensions of the incompleteness theorems; Section 8 concludes the paper. \N\NThe paper, which ``originally appeared in Japanese (2021), is overall an excellent survey and is highly recommended to researchers and followers of the incompleteness theorems, which are rightfully ``positioned as fundamental results in foundations of mathematics and mathematical logic. One minor point that the reader should be aware of is the author's comment on page 6 (lines 37--38) that ``it is known that \(\Sigma_1\)-soundness is the optimal assumption for the irrefutability of arbitrary Gödel sentences. Here, the author means Theorem 5.10 of [\textit{M. Kikuchi} and \textit{T. Kurahashi}, Rev. Symb. Log. 10, No. 4, 603--616 (2017; Zbl 1426.03038)] for \textit{arbitrary}, including standard and nonstandard, Gödelian sentences. But for standard Gödel sentences, the optimal condition is the consistency of the theory under consideration with the consistency statement (constructed from the standard provability predicate under consideration); see Theorem 35 and Corollary 37 of \textit{D. Isaacson}'s fantastic paper [West. Ont. Ser. Philos. Sci. 75, 135--152 (2011; Zbl 1259.03075)], whose reading could be a good addition to the present paper. This is just a little side point, and the paper under review contains novel and up-to-date material. My two favorites are the discussions after Theorems 3.19 and 4.14 on obtaining Rosser's theorem ``without using Rosser's provability predicate, though Rosser's trick could be hidden under some other details.

Cites work

This page was built for publication: Mathematical developments of the incompleteness theorems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6952157)