 |  |  |
|  |
| | Toshiyasu AraiLast updated: 09/10/13 12:22 | Name | Toshiyasu Arai |
|---|
Affiliation | Kobe U. |
|---|
Section | Graduate School of Engineering |
|---|
Job title | Prof. |
|---|
Degree | Doctor of Science |
|---|
| | |
Career 1987 - 1991 名古屋大学理学部数学科 助手 PapersNon-elementary speed-ups in logic calculi T. Arai Mathematical Logic Quarterly 54 629-640 2008 [Refereed] Polynomial-size Frege proofs of Bollob¥'as' theorem A. Nozaki, T. Arai and N.H. Arai Proceedings of the Japan Academy, Ser. A 84 159-161 2008 [Refereed] Epsilon substitution method for  -FIX T. Arai Journal of Symbolic Logic 71 1155-1188 2006 [Refereed] Proofs of Termination of Rewrite Systems for Polytime Functions T. Arai and G. Moser Lecture Notes in Computer Science 3821 529-540 2005 [Refereed] Epsilon substitution method for  -FIX T. Arai Archive for Mathematical Logic 44 1009-1043 2005 [Refereed] Ideas in the epsilon substitution method for  -FIX T. Arai Annals of Pure and Applied Logic 136 3-21 2005 [Refereed] Hilbert の第2問題に関する証明論の展開 新井 敏康 数学 57 113-126 2005 [Refereed][Invited] An English translation appeared in Sugaku Exposition vol. 21(2008), pp. 83-96 Wellfoundedness proofs by means of non-monotonic inductive definitions I:  -operators T. Arai Journal of Symbolic Logic 69 830-850 2004 [Refereed] Proof theory for theories of ordinals II:  -Reflection T. Arai Annals of Pure and Applied Logic 129 39-92 2004 [Refereed] Proof theory for theories of ordinals I:recursively Mahlo ordinals T. Arai Annals of Pure and Applied Logic 122 1-85 2003 [Refereed] Misc ゲーデルの無矛盾性証明 (総特集 ゲーデル) -- (数理論理学) 新井敏康 現代思想 35(3) 82-93 2007 竹内の基本予想とは何か、何であるべきか : 50年に (証明論と計算論) 新井 敏康 数理解析研究所講究録 1442 1-7 Jul 2005 From the Attic 新井敏康 数理解析研究所講究録 976 97-124 Feb 1997 Introducing the Hardline in Proof Theory 新井敏康 数理解析研究所講究録 976 135-145 Feb 1997 ニ階算術の諸公理AC, DC, CA, BIの関係 : Cut-Eliminationの初等的応用として(順序数の基本列と組合せ的原理の関係) 新井敏康 数理解析研究所講究録 771 1-76 Dec 1991 Cut-elimination for SBL 新井敏康 数理解析研究所講究録 669 16-43 Aug 1988 A Subsystem of Classical Analysis proper to Takeuti's Reduction Method for  -Analysis(LOGIC AND THE FOUNDATIONS OF MATHEMATICS) 新井敏康 数理解析研究所講究録 516 92-110 Mar 1984 竹内の基本予想とは何か, 何であるべきか-50年に 新井敏康 短期共同研究「証明論と計算論」報告集 ConferenceIn germ [Invited] T. Arai Leeds Symposium on Proof Theory and Constructivism Jul 2009 Provably and weakly descending chains of ordinals, [Invited] T. Arai Eleventh Asian Logic Conference Jun 2009 Proofs and sets [Invited] T. Arai International Workshop on Constructivism, Logic and Mathematics 2008 Iterating the recursively Mahlo operations [Invited] T. Arai Logic Methodology, Philosophy of Science 2007 無矛盾性証明について [Invited] 新井 敏康 科学基礎論学会秋の研究例会 2006 Resolving the reflecting universes [Invited] T. Arai Berkeley Logic Colloquium 2006 An expository survey on epsilon substitution method [Invited] T. Arai Asian Mathematical Congress 2005 Epsilon substitution method for inductive definitions, [Invited] T. Arai ASL Annual meeting 2005 Hilbertの第2問題に関する証明論の展開, [Invited] 新井 敏康 日本数学会総合講演 Sep 2004 証明論について [Invited] 新井 敏康 日本数学会企画特別講演 Sep 2002 |
|
|
|
|  |