Keita Yokoyama

Orcid: 0000-0001-5329-3298

According to our database1, Keita Yokoyama authored at least 29 papers between 2007 and 2023.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Extended Frames and Separations of Logical Principles.
Bull. Symb. Log., September, 2023

How Strong is Ramsey's Theorem if infinity can be Weak?
J. Symb. Log., 2023

2022
A parameterized halting problem, Δ<sub>0</sub> truth and the MRDP theorem.
CoRR, 2022

Two-sided Rank Consistent Ordinal Regression for Interpretable Music Key Recommendation.
Proceedings of the ICTIR '22: The 2022 ACM SIGIR International Conference on the Theory of Information Retrieval, Madrid, Spain, July 11, 2022

2021
The Reverse Mathematics of theorems of Jordan and Lebesgue.
J. Symb. Log., 2021

Memory Efficient Adversarial Attacks on Graphs: A Winning Solution for KDD Cup 2020.
Proceedings of the Thirteenth International Conference on Mobile Computing and Ubiquitous Network, 2021

Karaoke Key Recommendation Via Personalized Competence-Based Rating Prediction.
Proceedings of the IEEE International Conference on Acoustics, 2021

In Search of the First-Order Part of Ramsey's Theorem for Pairs.
Proceedings of the Connecting with Computability, 2021

2020
Combinatorial principles equivalent to weak induction.
Comput., 2020

Leveraging an Efficient and Semantic Location Embedding to Seek New Ports of Bike Share Services.
Proceedings of the 2020 IEEE International Conference on Big Data (IEEE BigData 2020), 2020

2018
The strength of SCT soundness.
J. Log. Comput., 2018

The strength of Ramsey's Theorem for Pairs and arbitrarily Many Colors.
J. Symb. Log., 2018

A parameterized halting problem, the linear time hierarchy, and the MRDP theorem.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

2017
The Strength of the SCT Criterion.
Proceedings of the Theory and Applications of Models of Computation, 2017

2016
On principles between ∑1- and ∑2-induction, and monotone enumerations.
J. Math. Log., 2016

Reverse mathematical bounds for the Termination Theorem.
Ann. Pure Appl. Log., 2016

2015
Categorical characterizations of the natural numbers require primitive recursion.
Ann. Pure Appl. Log., 2015

2014
Nonstandard second-order arithmetic and Riemann's mapping theorem.
Ann. Pure Appl. Log., 2014

Propagation of partial randomness.
Ann. Pure Appl. Log., 2014

On the Ramseyan Factorization Theorem.
Proceedings of the Language, Life, Limits - 10th Conference on Computability in Europe, 2014

2013
On the strength of Ramsey's theorem without Σ<sub>1</sub>-induction.
Math. Log. Q., 2013

Reverse mathematics and Peano categoricity.
Ann. Pure Appl. Log., 2013

A Note on the Sequential Version of Statements.
Proceedings of the Nature of Computation. Logic, Algorithms, Applications, 2013

2012
The Dirac delta function in two settings of Reverse Mathematics.
Arch. Math. Log., 2012

2011
A Nonstandard Counterpart of WWKL.
Notre Dame J. Formal Log., 2011

2010
Formalizing non-standard arguments in second-order arithmetic.
J. Symb. Log., 2010

2007
Non-standard analysis in ACA<sub>0</sub> and Riemann mapping theorem.
Math. Log. Q., 2007

Complex analysis in subsystems of second order arithmetic.
Arch. Math. Log., 2007

The Jordan curve theorem and the Schönflies theorem in weak second-order arithmetic.
Arch. Math. Log., 2007


  Loading...