著者
渕野 昌
出版者
科学基礎論学会
雑誌
科学基礎論研究 (ISSN:00227668)
巻号頁・発行日
vol.46, no.1, pp.33-47, 2018 (Released:2018-11-01)
参考文献数
36

Since Gödel's Incompleteness Theorems were published in 1931, not a few mathematicians have been trying to do mathematics in a framework as weak as possible to remain in a “safe” terrain. While the Incompleteness Theorems do not offer any direct motivations for exploring the terrae incognitae of the alarmingly general and consistency-wise strong settings like the full ZFC or even ZFC with large large cardinals etc., Gödel's Speedup Theorem, a sort of a variant of the Incompleteness Theorems, in contrast, seems to provide positive reasons for studying mathematics in these powerful extended frameworks in spite of the peril called the (in)consistency strength. In this article of purely expository character, we will examine a version of the Speedup Theorem with a detailed proof and discuss the impact of the Speedup Theorem on the whole mathematics.

言及状況

外部データベース (DOI)

はてなブックマーク (1 users, 1 posts)

Twitter (5 users, 5 posts, 1 favorites)

@matsmomushi あとこれ https://t.co/7LTInYhcYH

収集済み URL リスト