Follow
Kojiro Higuchi
Kojiro Higuchi
Verified email at nihon-u.ac.jp
Title
Cited by
Cited by
Year
The degree structure of Weihrauch-reducibility
K Higuchi, A Pauly
Logical Methods in Computer Science 9, 2013
472013
Inside the Muchnik degrees I: Discontinuity, learnability and constructivism
K Higuchi, T Kihara
Annals of Pure and Applied Logic 165 (5), 1058-1114, 2014
192014
Propagation of partial randomness
K Higuchi, WMP Hudelson, SG Simpson, K Yokoyama
Annals of Pure and Applied Logic 165 (2), 742-758, 2014
152014
Inside the Muchnik degrees II: The degree structures induced by the arithmetical hierarchy of countably continuous functions
K Higuchi, T Kihara
Annals of Pure and Applied Logic 165 (6), 1201-1241, 2014
142014
Weak theories of concatenation and minimal essentially undecidable theories: An encounter of and
K Higuchi, Y Horihata
Archive for Mathematical Logic 53, 835-853, 2014
82014
On the strength of marriage theorems and uniformity
M Fujiwara, K Higuchi, T Kihara
Mathematical Logic Quarterly 60 (3), 136-153, 2014
82014
Effectively closed mass problems and intuitionism
K Higuchi
Annals of Pure and Applied Logic 163 (6), 693-697, 2012
72012
On the order dimension of locally countable partial orderings
K Higuchi, S Lempp, D Raghavan, F Stephan
Proceedings of the American Mathematical Society 148 (7), 2823-2833, 2020
62020
On effectively closed sets of effective strong measure zero
K Higuchi, T Kihara
Annals of Pure and Applied Logic 165 (9), 1445-1469, 2014
42014
Relative randomness for Martin-Löf random sets
NN Peng, K Higuchi, T Yamazaki, K Tanaka
How the World Computes: Turing Centenary Conference and 8th Conference on …, 2012
42012
On Values of Games
ATA Ghani, K Higuchi
EVOLVE-A Bridge between Probability, Set Oriented Numerics, and Evolutionary …, 2014
32014
Effective strong nullness and effectively closed sets
K Higuchi, T Kihara
Conference on Computability in Europe, 303-312, 2012
32012
Is Not a Heyting Algebra
K Higuchi
Conference on Computability in Europe, 190-194, 2010
32010
A Note on a Conjecture of Sacks: It is Harder to Embed Height Three Partial Orders than Height Two Partial Orders
K Higuchi, P Lutz
arXiv e-prints, arXiv: 2309.01876, 2023
12023
Mass problems and relative learnability
K Higuchi, T Kihara
unpublished notes, 0
1
A Note on a Question of Sacks: It is Harder to Embed Height Three Partial Orders than Height Two Partial Orders
K Higuchi, P Lutz
arXiv preprint arXiv:2309.01876, 2023
2023
Optimal Strategy Synthesis for Stochastic Boolean Games
AT Ab Ghani, K Higuchi
Journal of Physics: Conference Series 1988 (1), 012065, 2021
2021
Defining a randomness notion via another
K Higuchi, N Peng
Mathematical Logic Quarterly 60 (4-5), 280-288, 2014
2014
Ab Ghani, Ahmad Termimi 31 Adeyemo, Josiah 293, 307, 321 Amid, David 97 Anaby-Tavor, Ateret 97
T Avanesov, B Bischl, D Boaz, F Bux, Y Cai, S Chen, JF Cruz, B Datta, ...
EVOLVE-A Bridge between Probability, Set Oriented Numerics, and Evolutionary …, 2014
2014
The Muchnik degrees of Π0
K Higuchi
Computability Theory and Foundations of Mathematics, 11, 2013
2013
The system can't perform the operation now. Try again later.
Articles 1–20