BIMSA > Kazuyuki Tanaka
Professor Kazuyuki Tanaka

Group: Artificial Intelligence and Machine Learning

Office: A3-2-306

Email: tanaka@bimsa.cn

Research Field: Mathematical logic, Foundations of Mathematics, Theory of Computation, Philosophy of Science

Webpage: https://sendailogic.com/tanaka.html

Biography

Kazuyuki Tanaka received his Ph.D. from U.C. Berkeley. Before joining BIMSA in 2022, he taught at Tokyo Inst. Tech and Tohoku University, and supervised fifteen Ph.D. students. He is most known for his works on second-order arithmetic and reverse mathematics, e.g., Tanaka's embedding theorem for WKLo and the Tanaka formulas for conservation results. For more details: https://sendailogic.com/tanaka.html

Research Interest

  • Mathematical logic, foundations of mathematics, theory of computation, philosophy of science.

Education Experience

  • 1980 - 1986      University of California, Berkeley      Mathematics      Doctor
  • 1978 - 1980      Tokyo Institute of Technology      Information Sciences      Master
  • 1974 - 1978      Tokyo Institute of Technology      Information Sciences      Bachelor

Work Experience

  • 2022 -      BIMSA      Professor
  • 2022 -      Tohoku University      Emeritus Professor
  • 2021 - 2022      Research Alliance Center for Mathematical Sciences, Tohoku University      Professor
  • 1997 - 2021      Mathematical Institute, School of Science, Tohoku University      Professor
  • 1993 - 1997      Mathematical Institute, School of Science, Tohoku University      Associate Professor
  • 1991 - 1993      Dept. of Math., College of General Education, Tohoku University      Associate Professor
  • 1986 - 1991      Dept. of Info. Sci., School of Sci., Tokyo Institute of Technology      Assistant Professor

Publication

  • [1] Wenjuan Li, and Kazuyuki Tanaka, Determinacy of probabilistic ω-languages with strict threshold semantics, accepted by RIMS Kokyuroku (2024)
  • [2] Keisuke Yoshii and Kazuyuki Tanaka, Transfinite iterations of Σ11 inductive definitions – Reconsideration of Nemoto’s Conjecture –, accepted by RIMS Kokyuroku(2024)
  • [3] Kazuyuki Tanaka, NingNing Peng, Weiguang Peng, and Wenjuan Li, The equilibria of independent distributions on unbalanced game trees, Computational and Applied Mathematics, 43(5), No. 267 -- 16 pages (2024)
  • [4] 田中一之, 計算理論と数理論理学 (Theory of Computation and Mathematical Logic), 共立出版, 1-299 (2023)
  • [5] Wenjuan Li, and Kazuyuki Tanaka, Second-order logic and related systems: a game-semantical perspective, Mathematical Logic and its Applications (SAML), RIMS Kokyuroku, 2233(2022), 1-19
  • [6] Leonardo Pacheco, and Kazuyuki Tanaka, The alternation hierarchy of the μ-calculus over weakly transitive frames, International Workshop on Logic, Language, Information, and Computation. Cham: Springer International Publishing(2022), 207-220
  • [7] Leonardo Pacheco, and Kazuyuki Tanaka, On the Degrees of Ignorance: via Epistemic Logic and µ-Calculus, Proc. of SOCREAL 2022, 74-78 (2022)
  • [8] Leonardo Pacheco, Wenjuan Li, and Kazuyuki Tanaka, On one-variable fragments of modal µ-calculus, Computability Theory and Foundations of Mathematics 2019 (Wuhan), World-Scientific(2022), 17-45
  • [9] Weiguang Peng, Ningning Peng, and Kazuyuki Tanaka, The eigen-distribution for multi-branching weighted trees on independent distributions, Methodology and Computing in Applied Probability, 24(2022), 277-287
  • [10] Kazuyuki Tanaka, Keisuke Yoshii, Infinite games, inductive definitions and transfinite recursion, Computability Theory and Foundations of Mathematics 2019 (Wuhan), 2019, 47 -78 (2022)
  • [11] 田中一之, 山の上のロジック学園---不完全性定理をめぐる2週間の授業日誌 （The Logic Academy on the Mountain: A Two-Week Lesson on the Incompleteness Theorems）, 日本評論社, 1-248 (2019)
  • [12] 田中一之, 数学基礎論序説: 数の体系への論理的アプローチ (Introduction to the Foundations of Mathematics: A Logical Approach to the Number System), 裳華房, 1-386 (2019)
  • [13] Shohei Okisaka, Weiguang Peng, Wenjuan Li, Kazuyuki Tanaka, The eigen-distribution of weighted game trees, Combinatorial optimization and applications. Part I, Lecture Notes in Computer Science, 10627, 286-297 (2017)
  • [14] Weiguang Peng, NingNing Peng, KengMeng Ng, Kazuyuki Tanaka, Yue Yang, Optimal depth-first algorithms and equilibria of independent distributions on multi-branching trees, Information Processing Letters (2017)
  • [15] Wenjuan Li, Kazuyuki Tanaka, The determinacy strength of pushdown omega-languages, RAIRO - Theoretical Informatics and Applications, 51(1), 29-50 (2017)
  • [16] Weiguang Peng, Shohei Okisaka, Wenjuan Li, Kazuyuki Tanaka, The uniqueness of eigen-distribution under non-directional algorithms, IAENG International Journal of Computer Science, 43(3) (2016)
  • [17] Yasuhiro Takahashi, Seiichiro Tani, Takeshi Yamazaki, Kazuyuki Tanaka, Commuting Quantum Circuits with Few Outputs are Unlikely to be Classically Simulatable, Quantum Information and Computation, 16(3-4), 251-270 (2016)
  • [18] Weiguang Peng, Shohei Okisaka, Wenjuan Li, Kazuyuki Tanaka, The Eigen-distribution for Multi-branching Trees, Proceedings of International Multi-Conference of Engineers and Computer Scientists I, 88-93 (2016)
  • [19] Wenjuan Li, Shohei Okisaka, Kazuyuki Tanaka, Infinite games recognized by 2-stack visibly pushdown automata, RIMS Kokyuroku, 1950, 121-137 (2015)
  • [20] Yasuhiro Takahashi, Seiichiro Tani, Takeshi Yamazaki, and Kazuyuki Tanaka, Commuting quantum circuits with few outputs are unlikely to be classically simulatable (COCOON 2015), Lecture Notes in Computer Science, 9198, 223--234 (2015)
  • [21] Yasuhiro Takahashi, Takeshi Yamazaki, and Kazuyuki Tanaka, Hardness of classically simulating quantum circuits with unbounded Toffoli and fan-out gates, Quantum Information & Computation, 14(13-14), 1149--1164 (2014)
  • [22] S Kataoka, M Yasuda, K Tanaka, Bayesian reconstruction of missing observations, Interdisciplinary Information Sciences, 21(1), 11-23 (2015)
  • [23] NN Peng, K Higuchi, T Yamazaki, K Tanaka, Relative randomness for Martin-Löf random sets, Conference on Computability in Europe, 581-588 (2012)
  • [24] ATA Ghani, K Tanaka, Network Games with and without Synchroneity, Decision and Game Theory for Security (2011)
  • [25] K Mashiko, K Tanaka, K Yoshii, Determinacy of Infinite Games and Inductive Definition in Second Order Arithmetic (Formal Systems and Computality Theory), 数理解析研究所講究録, 1729, 167-177 (2011)
  • [26] K Tanaka, A note on multiple inductive definitions, Proceedings Of The 10th Asian Logic Conference, 345-352 (2010)
  • [27] C Liu, K Yasuda, Y Yin, K Tanaka, Uncertain association rule mining algorithm for the cell formation problem in cellular manufacturing systems, International Journal of Production Research, 47(3), 667-685 (2009)
  • [28] CG Liu, L Zhu, K Tanaka, An Algorithm for the Design of Manufacturing Cells, 2009 Fifth International Conference on Natural Computation, 6, 207-211 (2009)
  • [29] MYO MedSalem, K Tanaka, Weak determinacy and iterations of inductive definitions, Computational Prospects Of Infinity: Part II: Presented Talks, 333-353 (2008)
  • [30] CG Liu, K Tanaka, Y Yin, A cell formation algorithm incorporating multiple practical production factors, IEEE International Conference on Computational Science (2008)
  • [31] CG Liu, K Tanaka, The computational complexity of game trees by eigen-distribution, Combinatorial Optimization and Applications (2007)
  • [32] CG Liu, K Tanaka, The Complexity of Algorithms Computing Game Trees on Random Assignments, International Conference on Algorithmic Applications in Management, 241-250 (2007)
  • [33] T Nemoto, MY Ould MedSalem, K Tanaka, Infinite games in the Cantor space and subsystems of second order arithmetic, Mathematical Logic Quarterly, 53(3), 226-236 (2007)
  • [34] CG Liu, K Tanaka, Eigen-distribution on random assignments for game trees, Information processing letters, 104(2), 73-77 (2007)
  • [35] MYO MedSalem, K Tanaka, Δ3O-determinacy, comprehension and induction, The Journal of Symbolic Logic, 72(2), 452-462 (2007)
  • [36] N Sakamoto, K Tanaka, The strong soundness theorem for real closed fields and Hilbert’s Nullstellensatz in second order arithmetic, Archive for Mathematical Logic, 43, 337-349 (2004)
  • [37] SG Simpson, K Tanaka, T Yamazaki, Some conservation results on weak König's lemma, Annals of Pure and Applied Logic, 118(1), 87-114 (2002)
  • [38] K Tanaka, T Yamazaki, A non-standard construction of Haar measure and weak König's lemma, The Journal of Symbolic Logic, 65(1), 173-186 (2000)
  • [39] K Tanaka, Non-standard Analysis in WKL., Mathematical Logic Quarterly, 43(3) (1997)
  • [40] K Tanaka, The self-embedding theorem of WKL0 and a non-standard method, Annals of Pure and Applied Logic, 84(1), 41-49 (1997)
  • [41] M Kikuchi, K Tanaka, On formalization of model-theoretic proofs of Gödel's theorems, Notre Dame Journal of Formal Logic, 35(3), 403-412 (1994)
  • [42] K Tanaka, A game‐theoretic proof of analytic Ramsey theorem, Mathematical Logic Quarterly, 38(1), 301-304 (1992)
  • [43] K Tanaka, Reverse Mathematics and Subsystems of Second-Order Arithmetics, Sugaku Expositions, 5, 213-234 (1992)
  • [44] K Tanaka, Weak axioms of determinacy and subsystems of analysis II (∑ 02 games), Annals of Pure and Applied Logic, 52(1-2), 181-193 (1991)
  • [45] N Shioji, K Tanaka, Fixed point theory in weak second-order arithmetic, Annals of Pure and Applied Logic, 47(2), 167-188 (1990)
  • [46] K Tanaka, Weak axioms of determinacy and subsystems of analysis I: δ., Mathematical Logic Quarterly, 36(6) (1990)
  • [47] K Tanaka, The Galvin-Prikry theorem and set existen axioms, Annals of Pure and Applied Logic, 42(1), 81-104 (1989)
  • [48] K Tanaka, Descriptive set theory and subsystems of analysis, University of California, Berkeley (1986)
  • [49] AG Ahmad Termimi, K Tanaka, Network Games with Many Attackers and Defenders, Proceedings of Research Institute for Mathematical Sciences (RIMS) Kôkyûroku

 

Update Time: 2025-08-31 17:00:07