## Contact Information

Takayuki Kihara, Lecturer (*Curriculum Vitae*)

Department of Mathematical Informatics

Graduate School of Informatics

Nagoya University, Japan

Email: kihara (at) i (dot) nagoya-u (dot) ac (dot) jp

Office: Graduate School of Informatics Building, Room 310 [Campus map]

## News

**Computability Theory and Applications Online Seminar**has started! (April 2020)- With the support of the
**JSPS summer program**, Mr. Paul-Elliot Angles d'Auriac (Paris-Est Créteil) is now visiting us! (From June to August 2018) - Our
**Nagoya Logic Seminar**webpage is now open! (May 2017)

## Selected Papers (see also the List of Publications)

*Degrees of incomputability, realizability and constructive reverse mathematics*

in preparation, 34 pages. [arXiv]*Enumeration degrees and non-metrizable topology*(with K. M. Ng, and A. Pauly)

preprint, 103 pages. [arXiv]*On the structure of the Wadge degrees of BQO-valued Borel functions*(with Antonio Montalbán)

Transactions of the American Mathematical Society**371**(11) (2019), pp. 7885-7923. [arXiv]*The uniform Martin's conjecture for many-one degrees*(with Antonio Montalbán)

Transactions of the American Mathematical Society**370**(12) (2018), pp. 9025-9044. [arXiv]*Turing degrees in Polish spaces and decomposability of Borel functions*(with Vassilios Gregoriades and Keng Meng Ng)

to appear in Journal of Mathematical Logic. [arXiv]*Point degree spectra of represented spaces*(with Arno Pauly)

submitted in June 2015, 36 pages. [arXiv]*Decomposing Borel functions using the Shore-Slaman join theorem*

Fundamenta Mathematicae**230**(2015), pp. 1-13. [doi]

## Selected Slides

*Wadge-like classifications of real-valued functions**De Groot duality in computability theory**Topological aspects of enumeration degrees**The uniform Martin conjecture and Wadge degrees**Degrees of unsolvability in topological spaces with countable cs-networks**The second-level Borel isomorphism problem: An encounter of recursion theory and infinite dimensional topology**An application of classical recursion theory to descriptive set theory via computable analysis**Counterexamples in computable continuum theory*