Higher Recursion Theory and Set Theory

(20 May 2019–14 Jun 2019)

Description

in celebration of the research work of Professors Theodore A. Slaman and W. Hugh Woodin

Organizing Committee

  • Yue Yang  (National University of Singapore)

Contact Information

General Enquiries: ims(AT)nus.edu.sg
Scientific Aspects Enquiries: matyangy(AT)nus.edu.sg

Overview

By “higher recursion theory”, we mean the part of recursion theory that either focuses on subsets of the natural numbers beyond arithmetical sets or studies the theory of computability or definability on domains beyond the set of natural numbers. For example, the former includes the study of hyperarithmetic sets and descriptive set theory, while the latter includes alpha-recursion theory and e-recursion theory which study computability theory on ordinals and aspects of the fine structure theory of the constructible universe L and Q theory. Although we did not mention specific areas of “set theory” in the title, we intend to focus on topics in set theory that have close connections with definability, for example Woodin’s program on ultimate L, the HOD conjecture, and descriptive inner model theory.

Higher recursion theory and the parts of set theory mentioned above have a long history of interaction. The interaction continues until now. This workshop would provide a valuable chance for these communities to interact and work on shared concerns in these areas.

The program will focus on the following topics:

  • Martin’s Conjecture;
  • higher randomness;
  • the HOD conjecture;
  • descriptive inner model theory (DIMT), the core model induction and the mouse set conjecture; and
  • suitable extender sequences and Ultimate L.

Activities

There will be talks in the mornings and free discussions in the afternoons.

Details of workshops and talks, click here.

Please note that our office will be closed on the following public holiday.
– 19 May 2019, Vesak Day, the following Monday, 20 May 2019 will be a Public Holiday.
– 5 Jun 2019, Hari Raya Puasa.

 

Media

Scroll to Top