|
This article is cited in 10 scientific papers (total in 10 papers)
Gödel incompleteness theorems and the limits of their applicability. I
L. D. Beklemishev Steklov Mathematical Institute, Russian Academy of Sciences
Abstract:
This is a survey of results related to the Gödel incompleteness theorems and the limits of their applicability. The first part of the paper discusses Gödel's own formulations along with modern strengthenings of the first incompleteness theorem. Various forms and proofs of this theorem are compared. Incompleteness results related to algorithmic problems and mathematically natural examples of unprovable statements are discussed.
Bibliography: 68 titles.
Keywords:
Gödel theorems, incompleteness, proof, computability.
Received: 20.08.2010
Citation:
L. D. Beklemishev, “Gödel incompleteness theorems and the limits of their applicability. I”, Russian Math. Surveys, 65:5 (2010), 857–899
Linking options:
https://www.mathnet.ru/eng/rm9378https://doi.org/10.1070/RM2010v065n05ABEH004703 https://www.mathnet.ru/eng/rm/v65/i5/p61
|
Statistics & downloads: |
Abstract page: | 2461 | Russian version PDF: | 1325 | English version PDF: | 35 | References: | 167 | First page: | 76 |
|