English version is here.

SLS(Sendai Logic School)は,計算可能性理論および関連分野で世界的に活躍する研究者と大学院生や若手研究者との交流を目的とした勉強会です。 他分野からの参加も歓迎します。参加費は無料ですが,会場準備の都合上,参加希望の方は下記メールアドレスに一言ご連絡ください。 その他,本勉強会に関するご質問・お問い合わせも下記までお願いします。

12/1 ウェブサイトオープン
1/22 タイムテーブル公開
2/1  講演者のスライドと写真を公開


東北大学理学部青葉山キャンパス合同C棟 [キャンパスマップ]

10:00-10:30 受  付
10:30-11:30 Wu, Guohua
Automatic Sequences and Transcendence of Real Numbers [スライド]
11:30-13:30 昼  食
13:30-14:30 Montalbán, Antonio
Vaught's conjecture in computability theory [スライド]
14:30-14:45 休  憩
14:45-15:45 Yang Yue
Seetapun's theorem revisited [スライド]
[Abstract] In the study of Ramsey's Theorem in reverse mathematics, Seetapun's result(s) in 1995 played an important role. He developed a new technique for cone avoiding and showed that Ramsey's Theorem for pairs does not imply ACA0. In this talk, I will present a proof of his theorem. Based on some ideas obtained from later studies, this proof is more friendly to graduate students.
15:45-16:00 休  憩
16:00-17:00 Discussion on Game Trees
10:00-10:30 受  付
10:30-11:30 Emanuele Frittaion
Brown's lemma in reverse mathematics [スライド]
11:30-13:30 昼  食
13:30-14:30 Florian Pelupessy
How to prove it: Phase transitions in logic [スライド]
[Abstract] Using the example of Dickson's lemma, we show how to prove phase transition results in independence, including the sharpening results. This talk will be suitable for graduate students.
14:30-14:45 休  憩
14:45-15:45 Montalbán, Antonio
Analytic equivalence relations with \aleph_1-many classes:A computability theoretic approach [スライド]
15:45-16:00 休  憩
16:00-17:00 Free Discussion

Montalbán, Antonio (U.C.Berkeley)
Yang, Yue (NUS, Singapore)
Wu, Guohua (NTU, Singapore)

photo1 photo2
photo3 photo4

[JSPS-NUS Workshop 2015]
[CTFM series]

Partially Supported by: JSPS-FWO Bilateral Program and
Grants-in-Aid for Scientific Research (KAKENHI) 26540001 & 15H03634.