Publications

2022

• Infinite games, inductive definitions and transfinite recursion. [Computability Theory and Foundations of Mathematics 2019 (Wuhan), World-Scientific (2022), 47-78.] Kazuyuki Tanaka, Keisuke Yoshii
• On one-variable fragments of modal μ-calculus. [Computability Theory and Foundations of Mathematics 2019 (Wuhan), World-Scientific (2022), 17-45.] Leonardo Pacheco, Wenjuan Li, Kazuyuki Tanaka
• On the Degrees of Ignorance: via Epistemic Logic and μ-Calculus. [Proc. of SOCREAL2022 (2022), 74-78.] Leonardo Pacheco, Kazuyuki Tanaka
• The Alternation Hierarchy of the μ-Calculus over Weakly Transitive Frames. [WoLLIC 2022, LNCS 13468, 207-220, 2022.] Leonardo Pacheco, Kazuyuki Tanaka

2021

• The eigen-distribution for multi-branching weighted trees on independent distributions. [Methodology and Computing in Applied Probability, Springer (2021), 277-287.] Weiguang Peng, NingNing Peng, Kazuyuki Tanaka

2018

• Alternation hierarchies and fragments of modal mu-calculus. [RIMS Kokyuroku 2083 (2018), 98–110.] Wenjuan Li, Yasuhiko Omata, Kazuyuki Tanaka

2017

• Optimal depth-first algorithms and equilibria of independent distributions on multi-branching trees.[Information Processing Letters,125,(2017),30-34]W. Peng, N. Peng, K.M. Ng, K. Tanaka and Y. Yang
• The determinacy strength of pushdown ω-languages.[RAIRO-Theor. Inf. Appl.,51(1),(2017),29-50]Wenjuan Li and Kazuyuki Tanaka
• The eigen-distribution of weighted game trees. [Combinatorial optimization and applications. Part I, Lecture Notes in Comput. Sci. 10627 (2017), 286–297.] Kazuyuki Tanaka, Shohei Okisaka, Weiguang Peng, Wenjuan Li

2016

• The Uniqueness of Eigen-distribution under Non-directional Algorithms.[IAENG International Journal of Computer Science,43(3),(2016),318-325]W. Peng, S. Okisaka, W. Li and K. Tanaka
• The Eigen-distribution for Multi-branching Trees.[International MultiConference of Engineers and Computer Scientists,I,(2016),88-93]W. Peng, S. Okisaka, W. Li and K. Tanaka
• Commuting Quantum Circuits with Few Outputs are Unlikely to be Classically Simulatable.[Quantum Information and Computation,16(3&4),(2016),251-270]Y. Takahashi, S. Tani, T. Yamazaki and K. Tanaka

2015

• Infinite games recognized by 2-stack visibly pushdown automata.[RIMS Kokyuroku,1950,(2015),121-137]Wenjuan Li, Shohei Okisaka and Kazuyuki Tanaka
• Commuting Quantum Circuits with Few Outputs are Unlikely to be Classically Simulatable.[Computing and Combinatorics, Lecture Notes in Computer Science,9198,(2015),223-234]Y. Takahashi, S. Tani, T. Yamazaki and K. Tanaka

2014

• Hardness of Classically Simulating Quantum Circuits with Unbounded Toffoli and Fan-Out Gates.[Quantum Information and Computation,14(13-14),(2014),1149-1164]Y. Takahashi, T. Yamazaki and K. Tanaka

2013

• Hardness of Classically Simulating Quantum Circuits with Unbounded Toffoli and Fan-Out Gates.[Proc. of the 38th Int. Sympo. on Mathematical Foundations of Computer Sciences (MFCS 2013), Springer LNCS,8087,(2013),801-812]Y. Takahashi, T. Yamazaki and K. Tanaka

2012

• Relative randomness for Martin-Loef random sets.[CiE 2012, Springer LNCS,7318,(2012),581-588]N. Peng, K. Higuchi, T. Yamazaki and K. Tanaka
• Infinite games and transfinite recursion of multiple inductive definitions.[CiE 2012, Springer LNCS,7318,(2012),374-383]K. Yoshii and K. Tanaka

2011

• Network Games with and without Synchroneity.[Baras J.S., Katz, J., Altman, E. (eds.) “GAMESEC 2011”, Springer LNCS,7037,(2011),87-103]Ahmad Termimi Ab Ghani, Kazuyuki Tanaka

2010

• A Lemma on K-random Extension.[Proceedings of ICCEE 2010 (Chendu),7,(2010),353-357]N. Peng, T. Yamazaki, K. Tanaka and C.G. Liu
• Determinacy of Infinite Games and Inductive Definition in Second Order Arithmetic.[RIMS Kokyuroku,(2010),146-151]K. Mashiko，K. Tanaka，K. Yoshii
• Network Games with Many Attackers and Defenders.[RIMS Kokyuroku,1729,(2010),146-151]Ahmad Termimi Ab Ghani and Kazuyuki Tanaka
• A note on multiple inductive definitions.[Proceedings of the 10th Asian Logic Conference,(2010),345-352]Kazuyuki Tanaka

2009

• -An Algorithm for the Design of Manufacturing Cells.[5th IEEE International Conference on Natural Computation,(2009),207-211]ChenGuang Liu, Lin Zhu, Kazuyuki Tanaka
• Uncertain Association Rule Mining Approach for Cell Formation Problem in Cellular Manufacturing Systems.[International Journal of Production Research,47(3),(2009),667-685]ChenGuang Liu, Kazuhiko Yasuda, Yong Yin, Kazuyuki Tanaka

2008

• The quasi-equivalence between the definitions of partial randomness.[4th International Conference on Natural Computation (ICNC'08),(2008),371-375]C.G. Liu, K. Tanaka and T. Yamazaki
• Generalization of complexity oscillations in infinite sequences.[4th International Conference on Natural Computation (ICNC'08),(2008),299-303]C.G. Liu, T. Yamazaki, K. Tanaka
• Complexity Oscillations in Random Reals.[IEICE Transactions on Information and Systems,91,(2008),2512-2518]ChenGuang Liu, Kazuyuki Tanaka
• A cell formation algorithm incorporating practical production factors.[11th IEEE International Symposium on Scientific and Engineering Computing (SEC-08),(2008),170-175]ChenGuang Liu, Kazuyuki Tanaka, Yong YIN
• Weak determinacy and iterations of inductive definitions.[Proc. of Computational Prospects of Infinity,(2008),333-353]M. O. MedSalem and K. Tanaka

2007

• The Computational Complexity of Game Trees by Eigen-Distribution.[Lecture Notes in Computer Science,4616,(2007),323-334]C. Liu, K. Tanaka
• Eigen-Distribution on Random Assignments for Game Trees.[Information Processing Letters,142(2),(2007),73-77]C. Liu, K. Tanaka
• Δ03-determinacy, comprehension and induction.[Journal of Symbolic Logic,72(2),(2007),452-462]M. O. MedSalem, K. Tanaka
• The Complexity of Algorithms Computing Game Trees on Random Assignments.[Lecture Notes in Computer Science,4508,(2007),241-250]C. Liu, K. Tanaka -A Game on Graphs with Many non-Centralized Defenders.[22nd European Conference on Operations Research (EURO XXII), Prague, July 8-11, 7 pages (2007)]M. Ould-MedSalem, Y. Manoussakis, K. Tanaka
• Infinite games in the Cantor space and subsystems of second order arithmetic.[Mathematical Logic Quarterly,53,(2007),226-236]T. Nemoto, M. O. MedSalem and K. Tanaka
• Eigen-Distribution on Assignments for Game Trees with Random Properties.[Proceedings of the 22nd ACM Symposium on Applied Computing (SAC), Seoul, Korea,(2007),78-79]C. Liu, K. Tanaka

Before 2006

• On weak determinacy of infinite binary games.[RIMS Kokyuroku,1469,(2006),17-26]T. Nemoto, M. O. MedSalem, K. Tanaka
• Infinite games and set existence axioms.[RIMS Kokyuroku,1442,(2005),115-121]M. O. MedSalem, K. Tanaka
• Manipulating the reals in RCAo.[Reverse Mathematics 2001, Lecture Note in Logic 21,(2005),379-393]K.Tanaka, T. Yamazaki
• The strong soundness theorem for real closed fields and Hilbert’s Nullstellensatz in second order arithmetic.[Archive for Math. Logic,43(3),(2004),337-349]N. Sakamoto, K. Tanaka
• HAC and Company.[RIMS Kokyuroku,1301,(2003),79-83]K. Tanaka
• Some conservation results on weak Koenig’s lemma.[Ann. Pure Applied Logic,118,(2002),87-114]S.Simpson, K.Tanaka, T.Yamazaki
• A non-standard construction of Haar measure and WKLo.[Journal of Symbolic Logic,65(1),(2000),173-186]K. Tanaka, T. Yamazaki
• Non-standard analysis in WKLo.[Mathematical Logic Quarterly,43,(1997),396-400]TANAKA Kazuyuki
• The self-embedding theorem of WKLo and a non-standard method.[Annals of Pure and Applied Logic,84,(1997),41-49]TANAKA Kazuyuki
• 逆数学と最近の数学基礎論.[情報処理,35(4),(1994),329-340]田中 一之
• On formalization of model theoretic proofs of Gödel’s theorems.[Notre Dame Journal of Formal Logic,35,(1994),403-412]K. Tanaka
• Reverse Mathematics and subsystems of second-order arithmetic.[American Math. Soc., Suugaku Expositions,5,(1992),213-234]TANAKA Kazuyuki
• A game-theoretic proof of analytic Ramsey theorem.[Zeitschrift für Math. Logik und Grund. Math.,38,(1992),301-304]K. Tanaka
• A note on the proof method constructive falsity.[Zeitschrift für Math. Logik und Grund. Math.,37,(1991),63-64]K. Tanaka
• Weak axioms of determinacy and subsystems of analysis II.[Annals of Pure and Applied Logic,52,(1991),181-193]TANAKA Kazuyuki
• 逆・数学’と2階算術の証明論.[数学,42(3),(1990),244-260]田中　一之
• Weak axioms of determinacy and subsystems of analysis I.[Zeitschrift für Math. Logik and Grund. Math.,36,(1990),481-491]K. Tanaka
• Fixed point theory in weak second-order arithmetic.[Annals of Pure and Applied Logic,47,(1990),167-188]TANAKA Kazuyuki
• On the strong soundness of the theory of real closed fields.[Proc. of the Fourth Asian Logic Conference,Tokyo,(1990),7-10] K. Tanaka, S. Simpson
• The Galvin-Prikry theorem and set existence axioms.[Annals of Pure and Applied Logic,42,(1989),81-104]TANAKA Kazuyuki
• Ramsey theorem and set existence axioms.[Research Reports on Info. Sciences, Tokyo Inst. Tech.C-86,(1987),1-43] Kazuyuki Tanaka
• A recursion-theoretic proof of Hausdorff’s theorem on ambiguous Borel sets.[Research Reports on Info. Sciences, Tokyo Inst. Tech. C-80,(1986),1-9] Kazuyuki Tanaka
• Descriptive set theory and subsystems of analysis.[Ph.D. dissertation, Dept. of Math., Univ. of California, Berkeley,(1986)] Kazuyuki Tanaka