|
Sendai Logic School 2013
-日本ベルギー合同勉強会-
■日程・場所
２０１３年２月22日（金）〜23日（土）
仙台国際センター (Sendai International Center) 3F 小会議室 8
[Japanese/English/(3F Floor map)]
■勉強会の様子
■講師 (Lecturers)
S. Simpson
Yang Yue
Wu Guohua
照井 一成 (Kazushige Terui)
宮部 賢志 (Kenshi Miyabe)
秋吉 亮太 (Ryota Akiyoshi)
（敬称略）
■プログラム & アブストラクト
| ２２日（金） |
２３日（土） |
| 9:15 - 10:15 |
S. Simpson(1) |
9:15 - 10:15 |
S. Simpson(2) |
| 10:30 - 12:00 |
秋吉 亮太 |
10:30 - 12:00 |
照井 一成 |
| 13:30 - 14:30 |
Yang Yue(1) |
13:30 - 14:30 |
Yang Yue(2) |
| 14:45 - 16:15 |
宮部 賢志 |
14:45 - 15:45 |
Wu Guohua(2) |
| 16:30 - 17:30 |
Wu Guohua(1) |
16:00 - 17:30 |
〜学生セッション〜 |
| 19:00 - |
懇親会 |
倉橋 太志 |
|
|
彭 寧々 |
|
S. Simpson[SLIDE]
|
Title: Implicit definability in arithmetic
Abstract: We exposit two previously unpublished theorems of Leo Harrington.
The first theorem says that there exist arithmetical singletons which are
arithmetically incomparable. The second theorem says that there exists
a ranked point which is not an arithmetical singleton.
Click here for more info.
|
|
Yang Yue[SLIDE]
|
Title: Recursion Theory and fragments of arithmetic
Abstract: This is an introductory talk to “Reverse Recursion Theory”.
I will spend the first hour explaining the background and the motivation.
In the remaining hour, I hope to give some examples with short proofs to illustrate some basic ideas.
|
|
Wu Guohua[SLIDE]
|
Title: Effective Combinatorics
Abstract: In this talk, I will first consider some classic combinatorial properties from recursion theory point of view,
including Hall's marriage theorem, Ramsey theorem, Dilworth theorem, etc.
We will then provide an overview of degree spectra of successivity relations on computable linear orderings,
and a recent joint work with Downey and Lempp will be introduced.
|
|
Kazushige Terui[SLIDE]
|
|
Title: Algebraic interpretations of proof theoretic results in nonclassical logics
|
|
Kenshi Miyabe[SLIDE]
|
Title: Things to do in and with algorithmic randomness
Abstract: I will give an introduction to algorithmic randomness and present some new research movements.
The topics include the relations with a reducibility other than Turing, computable analysis, ergodic theory and induction.
I would like to raise some philosophical questions on randomness.
|
|
Ryota Akiyoshi[SLIDE]
|
|
Title: Cut-elimination of Pi^1_1-CA
|
■リンク
[sendai logic homepage]
--https://sites.google.com/site/sendailogichomepage/
[Computability Theory and Foundations of Mathematics]
--http://sendailogic.math.tohoku.ac.jp/CTFM/
|
