Takayuki Kihara

Orcid: 0000-0002-1611-952X

Affiliations:
  • Nagoya University, Japan
  • Tohoku University, Japan


According to our database1, Takayuki Kihara authored at least 39 papers between 2010 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On the Metric Temporal Logic for Continuous Stochastic Processes.
Log. Methods Comput. Sci., 2024

The Arithmetical Hierarchy: A Realizability-Theoretic Perspective.
CoRR, 2024

Many-one reducibility with realizability.
CoRR, 2024

2023
A syntactic approach to Borel functions: some extensions of Louveau's theorem.
Arch. Math. Log., November, 2023

Ideal presentations and numberings of some classes of effective quasi-Polish spaces.
CoRR, 2023

On the main scientific achievements of Victor Selivanov.
Comput., 2023

Preface.
Comput., 2023

De Groot Duality for Represented Spaces.
Proceedings of the Unity of Logic and Computation, 2023

2022
Rethinking the notion of oracle: A link between synthetic descriptive set theory and effective topos theory.
CoRR, 2022

Enumerating Classes of Effective Quasi-Polish Spaces.
Proceedings of the Revolutions and Revelations in Computability, 2022

2021
A Comparison of various analytic Choice Principles.
J. Symb. Log., 2021

Turing degrees in Polish spaces and decomposability of Borel functions.
J. Math. Log., 2021

Lawvere-Tierney topologies for computability theorists.
CoRR, 2021

2020
Searching for an analogue of Atr0 in the Weihrauch Lattice.
J. Symb. Log., 2020

Decomposing Functions of Baire class $2$ on Polish Spaces.
J. Symb. Log., 2020

Degrees of incomputability, realizability and constructive reverse mathematics.
CoRR, 2020

Degrees of Non-computability of Homeomorphism Types of Polish Spaces.
Proceedings of the Beyond the Horizon of Computability, 2020

2019
On a Metric Generalization of the TT-Degrees and Effective Dimension Theory.
J. Symb. Log., 2019

Wadge-like degrees of Borel bqo-valued functions.
CoRR, 2019

Convex choice, finite choice and sorting.
CoRR, 2019

Enumeration degrees and non-metrizable topology.
CoRR, 2019

The binary expansion and the intermediate value theorem in constructive reverse mathematics.
Arch. Math. Log., 2019

Finite Choice, Convex Choice and Sorting.
Proceedings of the Theory and Applications of Models of Computation, 2019

2018
Searching for an analogue of ATR in the Weihrauch lattice.
CoRR, 2018

2016
Borel-piecewise continuous reducibility for uniformization problems.
Log. Methods Comput. Sci., 2016

Dividing by Zero - How Bad Is It, Really?.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

2015
Comparing the Medvedev and Turing degrees of Π<sup>0</sup> <sub>1</sub> classes.
Math. Struct. Comput. Sci., 2015

Unified characterizations of lowness properties via Kolmogorov complexity.
Arch. Math. Log., 2015

2014
On the strength of marriage theorems and uniformity.
Math. Log. Q., 2014

Uniform Kurtz randomness.
J. Log. Comput., 2014

Point degree spectra of represented spaces.
CoRR, 2014

On effectively closed sets of effective strong measure zero.
Ann. Pure Appl. Log., 2014

Inside the Muchnik degrees II: The degree structures induced by the arithmetical hierarchy of countably continuous functions.
Ann. Pure Appl. Log., 2014

Inside the Muchnik degrees I: Discontinuity, learnability and constructivism.
Ann. Pure Appl. Log., 2014

2012
Inside the Muchnik Degrees: Discontinuity, Learnability, and Constructivism
CoRR, 2012

Incomputability of Simply Connected Planar Continua.
Comput., 2012

A Hierarchy of Immunity and Density for Sets of Reals.
Proceedings of the How the World Computes, 2012

Effective Strong Nullness and Effectively Closed Sets.
Proceedings of the How the World Computes, 2012

2010
The FOR ALL THERE EXISTS-theory of the effectively closed Medvedev degrees is decidable.
Arch. Math. Log., 2010


  Loading...