| Weak axioms of determinacy and subsystems of analysis I: δ. K Tanaka Mathematical Logic Quarterly 36 (6), 1990 | 56 | 1990 |
| Weak axioms of determinacy and subsystems of analysis II (∑ 02 games) K Tanaka Annals of Pure and Applied Logic 52 (1-2), 181-193, 1991 | 54 | 1991 |
| The self-embedding theorem of WKL0 and a non-standard method K Tanaka Annals of Pure and Applied Logic 84 (1), 41-49, 1997 | 51 | 1997 |
| Fixed point theory in weak second-order arithmetic N Shioji, K Tanaka Annals of Pure and Applied Logic 47 (2), 167-188, 1990 | 48 | 1990 |
| Infinite games in the Cantor space and subsystems of second order arithmetic T Nemoto, MY Ould MedSalem, K Tanaka Mathematical Logic Quarterly 53 (3), 226-236, 2007 | 38 | 2007 |
| Eigen-distribution on random assignments for game trees CG Liu, K Tanaka Information processing letters 104 (2), 73-77, 2007 | 36 | 2007 |
| Δ3O-determinacy, comprehension and induction MYO MedSalem, K Tanaka The Journal of Symbolic Logic 72 (2), 452-462, 2007 | 36 | 2007 |
| Some conservation results on weak König's lemma SG Simpson, K Tanaka, T Yamazaki Annals of Pure and Applied Logic 118 (1-2), 87-114, 2002 | 25 | 2002 |
| Weak determinacy and iterations of inductive definitions MYO MedSalem, K Tanaka Computational Prospects Of Infinity: Part II: Presented Talks, 333-353, 2008 | 24 | 2008 |
| The Galvin-Prikry theorem and set existen axioms K Tanaka Annals of Pure and Applied Logic 42 (1), 81-104, 1989 | 23 | 1989 |
| On formalization of model-theoretic proofs of Gödel's theorems M Kikuchi, K Tanaka Notre Dame Journal of Formal Logic 35 (3), 403-412, 1994 | 20 | 1994 |
| A non-standard construction of Haar measure and weak König's lemma K Tanaka, T Yamazaki The Journal of Symbolic Logic 65 (1), 173-186, 2000 | 19 | 2000 |
| Non-standard Analysis in WKL0. K Tanaka Mathematical Logic Quarterly 43 (3), 1997 | 19 | 1997 |
| Uncertain association rule mining algorithm for the cell formation problem in cellular manufacturing systems C Liu, K Yasuda, Y Yin, K Tanaka International Journal of Production Research 47 (3), 667-685, 2009 | 15 | 2009 |
| Hardness of classically simulating quantum circuits with unbounded Toffoli and fan-out gates Y Takahashi, T Yamazaki, K Tanaka Quantum Information & Computation 14 (13-14), 1149-1164, 2014 | 14 | 2014 |
| Reverse Mathematics and Subsystems of Second-Order Arithmetics K Tanaka Sugaku Expositions 5, 213-234, 1992 | 10 | 1992 |
| The computational complexity of game trees by eigen-distribution CG Liu, K Tanaka Combinatorial Optimization and Applications: First International Conference …, 2007 | 9 | 2007 |
| Network Games with and without Synchroneity ATA Ghani, K Tanaka Decision and Game Theory for Security: Second International Conference …, 2011 | 8 | 2011 |
| Commuting quantum circuits with few outputs are unlikely to be classically simulatable Y Takahashi, S Tani, T Yamazaki, K Tanaka Computing and Combinatorics: 21st International Conference, COCOON 2015 …, 2015 | 7 | 2015 |
| Descriptive set theory and subsystems of analysis K Tanaka University of California, Berkeley, 1986 | 7 | 1986 |
