期刊
RUSSIAN MATHEMATICAL SURVEYS
卷 65, 期 5, 页码 857-899出版社
TURPION LTD
DOI: 10.1070/RM2010v065n05ABEH004703
关键词
Godel theorems; incompleteness; proof; computability
类别
资金
- Russian Foundation for Basic Research
- Leading Scientific Schools
This is a survey of results related to the Godel incompleteness theorems and the limits of their applicability. The first part of the paper discusses Godel'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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据