Takayuki Kihara

Log. Methods Comput. Sci., 2024

The Arithmetical Hierarchy: A Realizability-Theoretic Perspective.

[BibT_eX]

[DOI]

CoRR, 2024

Many-one reducibility with realizability.

[BibT_eX]

[DOI]

CoRR, 2024

2023

A syntactic approach to Borel functions: some extensions of Louveau's theorem.

[BibT_eX]

[DOI]

Kenta Sasaki

Arch. Math. Log., November, 2023

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

[BibT_eX]

[DOI]

Matthew de Brecht

CoRR, 2023

On the main scientific achievements of Victor Selivanov.

[BibT_eX]

[DOI]

Comput., 2023

Preface.

[BibT_eX]

[DOI]

Nikolay Bazhenov

Svetlana Selivanova

Comput., 2023

De Groot Duality for Represented Spaces.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

CoRR, 2022

Enumerating Classes of Effective Quasi-Polish Spaces.

[BibT_eX]

[DOI]

Matthew de Brecht

Paul-Elliot Anglès d'Auriac

Proceedings of the Revolutions and Revelations in Computability, 2022

2021

A Comparison of various analytic Choice Principles.

[BibT_eX]

[DOI]

J. Symb. Log., 2021

Turing degrees in Polish spaces and decomposability of Borel functions.

[BibT_eX]

[DOI]

Vassilios Gregoriades

Keng Meng Ng

J. Math. Log., 2021

Lawvere-Tierney topologies for computability theorists.

[BibT_eX]

[DOI]

CoRR, 2021

2020

Searching for an analogue of Atr0 in the Weihrauch Lattice.

[BibT_eX]

[DOI]

Alberto Marcone

J. Symb. Log., 2020

Decomposing Functions of Baire class $2$ on Polish Spaces.

[BibT_eX]

[DOI]

J. Symb. Log., 2020

Degrees of incomputability, realizability and constructive reverse mathematics.

[BibT_eX]

[DOI]

CoRR, 2020

Degrees of Non-computability of Homeomorphism Types of Polish Spaces.

[BibT_eX]

[DOI]

Mathieu Hoyrup

Proceedings of the Beyond the Horizon of Computability, 2020

2019

On a Metric Generalization of the TT-Degrees and Effective Dimension Theory.

[BibT_eX]

[DOI]

J. Symb. Log., 2019

Wadge-like degrees of Borel bqo-valued functions.

[BibT_eX]

[DOI]

CoRR, 2019

Convex choice, finite choice and sorting.

[BibT_eX]

[DOI]

CoRR, 2019

Enumeration degrees and non-metrizable topology.

[BibT_eX]

[DOI]

Keng Meng Ng

CoRR, 2019

The binary expansion and the intermediate value theorem in constructive reverse mathematics.

[BibT_eX]

[DOI]

Arch. Math. Log., 2019

Finite Choice, Convex Choice and Sorting.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2019

2018

Searching for an analogue of ATR in the Weihrauch lattice.

[BibT_eX]

[DOI]

Alberto Marcone

CoRR, 2018

2016

Borel-piecewise continuous reducibility for uniformization problems.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2016

Dividing by Zero - How Bad Is It, Really?.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2015

Unified characterizations of lowness properties via Kolmogorov complexity.

[BibT_eX]

[DOI]

Kenshi Miyabe

Arch. Math. Log., 2015

2014

On the strength of marriage theorems and uniformity.

[BibT_eX]

[DOI]

Makoto Fujiwara

Math. Log. Q., 2014

Uniform Kurtz randomness.

[BibT_eX]

[DOI]

Kenshi Miyabe

J. Log. Comput., 2014

Point degree spectra of represented spaces.

[BibT_eX]

[DOI]

CoRR, 2014

On effectively closed sets of effective strong measure zero.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2014

Inside the Muchnik degrees II: The degree structures induced by the arithmetical hierarchy of countably continuous functions.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2014

Inside the Muchnik degrees I: Discontinuity, learnability and constructivism.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2014

2012

Inside the Muchnik Degrees: Discontinuity, Learnability, and Constructivism

[BibT_eX]

[DOI]

CoRR, 2012

Incomputability of Simply Connected Planar Continua.

[BibT_eX]

[DOI]

Comput., 2012

A Hierarchy of Immunity and Density for Sets of Reals.

[BibT_eX]

[DOI]

Proceedings of the How the World Computes, 2012

Effective Strong Nullness and Effectively Closed Sets.

[BibT_eX]

[DOI]

Proceedings of the How the World Computes, 2012

2010

The FOR ALL THERE EXISTS-theory of the effectively closed Medvedev degrees is decidable.

[BibT_eX]

[DOI]

Joshua A. Cole