The second Japan-Russia workshop on effective descriptive set theory, computable analysis and automata
Akita Atorion (Hybrid), March 2-4, 2022
Tutorial Speakers
Sewon Park (Kyoto University), Verified computation over real numbers and other continuous objects
Takayuki Kihara (Nagoya University), Lawvere-Tierney topologies for computability theorists, an introduction
Program
Mar. 2 (Wed.)
13:50 -- 14:00 (Opening)
14:00 -- 15:00 [Tutorial] Sewon Park (Kyoto), Verified computation over real numbers and other continuous objects I [slides]
(Coffee Break)
15:30 -- 16:15 Ryoma Sin'ya (Akita), A quantitative approach to the primitive words conjecture [slides]
16:20 -- 16:50 Margarita Korovina (Ershov Institute), Ksmt calculus for non-linear systems
16:55 -- 17:25 Oleg Kudinov (Sobolev Institute), Order computable fields
(Short Break)
17:40 -- 18:40 Victor Selivanov (Ershov Institute), Effective descriptive theory of qcb_0-spaces
Mar. 3 (Thu.)
09:00 -- 12:00 Research Discussion
(Lunch Break)
13:20 -- 13:50 Yudai Suzuki (Tohoku), Fixed point for monotone operators and Weihrauch reducibility [slides]
14:00 -- 15:00 [Tutorial] Sewon Park (Kyoto), Verified computation over real numbers and other continuous objects II [slides]
(Coffee Break)
15:30 -- 16:15 Holger Thies (Kyoto), Extracting exact real computation programs from proofs in type theory [slides]
16:20 -- 16:50 Mizuhito Ogawa (JAIST), Forward analysis of well-structured pushdown systems
16:55 -- 17:25 Alexander Okhotin (St. Petersburg), Concatenation and star for event-clock input-driven pushdown automata
(Short Break)
17:40 -- 18:40 [Tutorial] Takayuki Kihara (Nagoya), Lawvere-Tierney topologies for computability theorists, an introduction I [slides]
Mar. 4 (Fri.)
09:00 -- 12:00 Research Discussion
(Lunch Break)
13:00 -- 13:30 Tatsuya Goto (Nagoya), Goldstern's principle about unions of null sets
13:30 -- 14:00 Leonardo Pacheco (Tohoku), Determinacy and reflection principles in second-order arithmetic [slides]
(Short Break)
14:10 -- 15:10 [Tutorial] Takayuki Kihara (Nagoya), Lawvere-Tierney topologies for computability theorists, an introduction II [slides]
(Coffee Break)
15:40 -- 16:10 Riccardo Gozzi (Kyoto), Analog characterization of complexity classes [slides]
16:15 -- 17:15 Svetlana Selivanova (KAIST), Computational complexity of classical solutions of partial differential equations
(Short Break)
17:30 -- 17:40 Ruslan Kornev (Novosibirsk), On punctual presentations of Polish metric spaces
17:40 -- 17:50 Keita Yokoyama (Tohoku), Similarity and difference between reverse mathematics and Weihrauch degrees for hyperarithmetical problems
(Closing)
Project Members
Japan side
Matthew de Brecht (Kyoto Univ.)
Akitoshi Kawamura (Kyoto Univ.)
Takayuki Kihara (Nagoya Univ.), PI
Takako Nemoto (Hiroshima Tech.)
Mizuhito Ogawa (JAIST)
Sewon Park (Kyoto Univ.)
Ryoma Sin'ya (Akita Univ.)
Keita Yokoyama (Tohoku Univ.)
Russia side
Ruslan Kornev (Novosibirsk State Univ.)
Margarita Korovina (Ershov Institute)
Oleg Kudinov (Sobolev Institute)
Alexander Okhotin (St. Petersburg State Univ.)
Victor Selivanov (Ershov Institute), PI
Svetlana Selivanova (KAIST)