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

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

Work Experience

  • 2021 - 2022      Research Alliance Center for Mathematical Sciences, Tohoku University      Professor
  • 2017 - 2018      Mathematical Society of Japan      Councilor
  • 2013 - 2015      Association for Symbolic Logic      Councilor
  • 2013 - 2018      Annals of Pure and Applied Logic      Editor
  • 2008 - 2009      Mathematical Institute, Tohoku University      Chairman
  • 2008 - 2017      Japan Association for Philosophy of Science      Director
  • 2004 - 2006      School of Science, Tohoku University      Deputy Dean
  • 1997 - 2021      Mathematical Institute, School of Science, Tohoku University      Professor
  • 1997 - 1999      Mathematical Society of Japan      Councilor
  • 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
  • 2022 -      Tohoku University      Emeritus Professor
  • 2022 -      BIMSA      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(None), 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)

 

Update Time: 2025-03-28 01:57:07