81 0 0 0 OA 不完全性定理の数学的発展
- 著者
- 倉橋 太志
- 出版者
- 一般社団法人 日本数学会
- 雑誌
- 数学 (ISSN:0039470X)
- 巻号頁・発行日
- vol.73, no.1, pp.60-87, 2021-01-22 (Released:2023-01-23)
- 参考文献数
- 89
63 0 0 0 OA 木更津高専寮生の生活面・設備に対する意識調査と分析結果に関する一考察
- 著者
- 清野 哲也 福士 智哉 倉橋 太志 若葉 陽一
- 出版者
- 独立行政法人 国立高等専門学校機構 木更津工業高等専門学校
- 雑誌
- 木更津工業高等専門学校紀要 (ISSN:21889201)
- 巻号頁・発行日
- vol.53, pp.9-24, 2020 (Released:2020-04-01)
- 参考文献数
- 4
It's been over thirty years since we set the divided group life system into the dorm. During this period, as the Information Technology develops, many things have changed and sometimes students do undesirable actions that are beyond our imagination. To capture the situations in the dorm, we conducted a questionnaire survey on their daily life. This paper shows the following things: how they spend their daily life, how they build their connections with other students, what they think about facilities of the dorm and so on.
4 0 0 0 OA Gödelの不完全性定理を巡る三つの断章
- 著者
- 菊池 誠 倉橋 太志
- 出版者
- 科学基礎論学会
- 雑誌
- 科学基礎論研究 (ISSN:00227668)
- 巻号頁・発行日
- vol.38, no.2, pp.75-80, 2011-05-15 (Released:2017-08-01)
- 参考文献数
- 26
- 被引用文献数
- 1
We describe three short stories around Gödel's incompleteness theorems. Firstly, we show that the second incompleteness theorem is derivable by formalizing Yablo's paradox. Then, we prove a version of the incompleteness theorem which is not formalizable. Finally, we discuss the theorems of arithmetic in nonstandard models of arithmetic and the definability of truth in models of arithmetic within other models.
2 0 0 0 OA Rosser可証性述語について
- 著者
- 倉橋 太志
- 出版者
- 科学基礎論学会
- 雑誌
- 科学基礎論研究 (ISSN:00227668)
- 巻号頁・発行日
- vol.41, no.2, pp.93-101, 2014-03-30 (Released:2017-08-31)
- 参考文献数
- 21
Rosser's provability predicates were introduced by Rosser to improve Godel's first incompleteness theorem. First, we survey the research on Rosser's provability predicates developed by Guaspari and Solovay, and Arai. Secondly, we investigate the formalization of existential version of Yablo's paradox based on Rosser's provability predicates, and show that this formalization can give independednt sentences for any consistent theory. At last, we prove that there is a consistency statement defined by using Rosser's provability predicate, which cannot be proved in arithmetic.