Department of Mathematical Informatics | Graduate School of Informatics | Nagoya University

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]


Selected Papers (see also the List of Publications)

  1. On the structure of the Wadge degrees of BQO-valued Borel functions (with Antonio Montalbán)
    to appear in Transactions of the American Mathematical Society, 39 pages. [arXiv]
  2. 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]
  3. Turing degrees in Polish spaces and decomposability of Borel functions (with Vassilios Gregoriades and Keng Meng Ng)
    submitted, 42 pages. [arXiv]
  4. Point degree spectra of represented spaces (with Arno Pauly)
    submitted, 36 pages. [arXiv]
  5. Decomposing Borel functions using the Shore-Slaman join theorem
    Fundamenta Mathematicae 230 (2015), pp. 1-13. [doi]
  6. Inside the Muchnik degrees II: The degree structures induced by the arithmetical hierarchy of countably continuous functions (with Kojiro Higuchi)
    Annals of Pure and Applied Logic 165 (6) (2014), pp. 1201-1241. [doi]
  7. Incomputability of simply connected planar continua
    Computability 1 (2) (2012), pp. 131-152. [doi]
  8. The $\forall\exists$-theory of the effectively closed Medvedev degrees is decidable (with Joshua A. Cole)
    Archive for Mathematical Logic 49 (2010), pp. 1-16. [doi]

Selected Slides

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

Meetings 2017

  1. CiE 2017 Computability in Europe 2017: Unveiling Dynamics and Complexity, Turku, Finland, June 12-16, 2017, Program Committee
  2. ALC 2017, The 15th Asian Logic Conference, Daejeon, Republic of Korea, 10-14 July 2017.
  3. CCA 2017, Fourteenth International Conference on Computability and Complexity in Analysis, Daejeon, Republic of Korea, 24-27 July 2017, Invited Talk
  4. Aspects of Computation: in celebration of the research work of Professor Rod Downey, Institute for Mathematical Sciences, National University of Singapore, 28 Aug-8 Sep, Invited Participant
  5. CTFM 2017, Workshop on Computability Theory and the Foundations of Mathematics, Institute for Mathematical Sciences, National University of Singapore, 8-12 Sep.
  6. Oberwolfach Seminar, Mathematical Logic: Proof Theory, Constructive Mathematics, Oberwolfach, Germany, 5-11 November 2017, Invited Participant
  7. 2ndPPICTA, The 2nd Pan Pacific International Conference on Topology and Applications, Busan, Republic of Korea, 13-17, November 2017, Invited Talk
  8. Oberwolfach Seminar, Computability Theory, Oberwolfach, Germany, 7-13 January 2018, Invited Participant