| On uniform relationships between combinatorial problems F Dorais, D Dzhafarov, J Hirst, J Mileti, P Shafer Transactions of the American Mathematical Society 368 (2), 1321-1359, 2016 | 117 | 2016 |
| Ramsey's theorem and cone avoidance DD Dzhafarov, CG Jockusch The Journal of Symbolic Logic 74 (2), 557-578, 2009 | 59 | 2009 |
| Reverse Mathematics DD Dzhafarov, C Mummert Problems, reductions, and proofs, Theory Appl. Comput., Cham, 2022 | 46 | 2022 |
| Cohesive avoidance and strong reductions D Dzhafarov Proceedings of the American Mathematical Society 143 (2), 869-876, 2015 | 39 | 2015 |
| The polarized Ramsey’s theorem DD Dzhafarov, JL Hirst Archive for Mathematical Logic 48 (2), 141-157, 2009 | 37 | 2009 |
| Strong reductions between combinatorial principles DD Dzhafarov The Journal of Symbolic Logic 81 (4), 1405-1431, 2016 | 36 | 2016 |
| Reverse mathematics zoo DD Dzhafarov | 34 | 2018 |
| Classes, Peano Arithmetic, Randomness, and Computable Domination DE Diamondstone, DD Dzhafarov, RI Soare | 24 | 2010 |
| The uniform content of partial and linear orders EP Astor, DD Dzhafarov, R Solomon, J Suggs Annals of Pure and Applied Logic 168 (6), 1153-1171, 2017 | 21 | 2017 |
| On the strength of the finite intersection principle DD Dzhafarov, C Mummert Israel Journal of Mathematics 196, 345-361, 2013 | 21 | 2013 |
| Ramsey’s theorem for singletons and strong computable reducibility D Dzhafarov, L Patey, R Solomon, L Westrick Proceedings of the American Mathematical Society 145 (3), 1343-1355, 2017 | 20 | 2017 |
| Generics for computable Mathias forcing PA Cholak, DD Dzhafarov, JL Hirst, TA Slaman Annals of Pure and Applied Logic 165 (9), 1418-1428, 2014 | 19 | 2014 |
| Ramsey’s theorem and products in the Weihrauch degrees DD Dzhafarov, JL Goh, DR Hirschfeldt, L Patey, A Pauly Computability 9 (2), 85-110, 2020 | 18 | 2020 |
| Effectiveness of Hindman’s Theorem for bounded sums DD Dzhafarov, CG Jockusch Jr, R Solomon, LB Westrick Computability and Complexity: Essays Dedicated to Rodney G. Downey on the …, 2016 | 17 | 2016 |
| Coloring trees in reverse mathematics DD Dzhafarov, L Patey Advances in Mathematics 318, 497-514, 2017 | 16 | 2017 |
| Sorites without vagueness II: Comparative sorites EN Dzhafarov, DD Dzhafarov Theoria 76 (1), 25-53, 2010 | 16 | 2010 |
| The reverse mathematics of Hindman’s Theorem for sums of exactly two elements BF Csima, DD Dzhafarov, DR Hirschfeldt, CG Jockusch, Jr, R Solomon, ... Computability 8 (3-4), 253-263, 2019 | 14 | 2019 |
| Effectiveness for the dual Ramsey theorem D Dzhafarov, S Flood, R Solomon, L Westrick Notre Dame Journal of Formal Logic 62 (3), 455-490, 2021 | 13 | 2021 |
| Ramsey’s theorem for trees: the polarized tree theorem and notions of stability DD Dzhafarov, JL Hirst, TJ Lakins Archive for Mathematical Logic 49 (3), 399-415, 2010 | 13 | 2010 |
| Notions of robust information coding DD Dzhafarov, G Igusa Computability 6 (2), 105-124, 2017 | 12 | 2017 |
Ludovic PateyChercheur au CNRSVerified email at computability.fr
