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. The uniform Martin's conjecture for many-one degrees (with Antonio Montalbán)
    submitted. [arXiv]
  2. Turing degrees in Polish spaces and decomposability of Borel functions (with Vassilios Gregoriades and Keng Meng Ng)
    submitted. [arXiv]
  3. Point degree spectra of represented spaces (with Arno Pauly)
    submitted. [arXiv]
  4. Decomposing Borel functions using the Shore-Slaman join theorem
    Fundamenta Mathematicae 230 (2015), pp. 1-13. [doi]
  5. 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]
  6. Incomputability of simply connected planar continua
    Computability 1 (2) (2012), pp. 131-152. [doi]
  7. 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 Invited Talks

  1. Degree theory and infinite dimensional topology
    CCC2015: Continuity, Computability, Constructivity -- From Logic to Algorithms, Schloss Aspenstein, Kochel, Germany, Sep 2015.
  2. The second-level Borel isomorphism problem: An encounter of recursion theory and infinite dimensional topology
    JAIST Logic workshop series 2015: Constructivism and Computability, Shiinoki Cultural Complex, Kanazawa, Japan, Mar 2015.
  3. Recursion theoretic methods in topological dimension theory
    The 7th meeting on Desctiptive Set Theory in Paris, Institut de Mathematique de Jussieu, Paris, France, Dec 2014.
  4. Effective methods in descriptive set theory
    Computability Theory and Foundations of Mathematics 2014, Tokyo Institute of Technology, Tokyo, Japan, Feb 2014.
  5. An application of the Shore-Slaman join theorem in descriptive set theory
    The 13th Asian Logic Conference, Guangzhou, China, Sep 2013.
  6. An application of classical recursion theory to descriptive set theory via computable analysis
    The 10th International Conference on Computability and Complexity in Analysis, LORIA, Nancy, France, Jul 2013.
  7. Counterexamples in computable continuum theory
    Dagstuhl Seminar "Computing with Infinite Data: Topological and Logical Foundations", Schloss Dagstuhl, Saarland, Germany, Oct 2011.

Meetings

  1. [CiE 2017] Computability in Europe 2017: Unveiling Dynamics and Complexity,
    Turku, Finland, June 12-16, 2017. Program Committee
  2. [CTFM 2015] Computability Theory and Foundations of Mathematics 2015,
    Tokyo Institute of Technology, Tokyo, Japan, September 7-11, 2015. Organising Committee
  3. Constructivism and Computability (JAIST Logic Workshop Series 2015),
    Kanazawa, Japan, March 2-6, 2015. Organising Committee (Local)
  4. [CCA 2014] Eleventh International Conference on Computability and Complexity in Analysis,
    Darmstadt, Germany, July 21-24, 2014. Program Committee
  5. [CTFM 2014] Computability Theory and Foundations of Mathematics 2014,
    Tokyo Institute of Technology, Tokyo, Japan, February 17-20, 2014. Program Committee