| A tight lower bound for determinization of transition labeled Büchi automata T Colcombet, K Zdanowski International Colloquium on Automata, Languages, and Programming, 151-162, 2009 | 45 | 2009 |
| Undecidability and concatenation A Grzegorczyk, K Zdanowski Andrzej Mostowski and foundational studies, 72-91, 2008 | 35 | 2008 |
| Collapsing modular counting in bounded arithmetic and constant depth propositional proofs S Buss, L Kołodziejczyk, K Zdanowski Transactions of the American Mathematical Society 367 (11), 7517-7563, 2015 | 31 | 2015 |
| The polish school of argumentation: A manifesto K Budzynska, M Araszkiewicz, B Bogołȩbska, P Cap, T Ciecierski, ... Argumentation 28, 267-282, 2014 | 25 | 2014 |
| Theories of arithmetics in finite models M Krynicki, K Zdanowski The Journal of Symbolic Logic 70 (1), 1-28, 2005 | 25 | 2005 |
| The intended model of arithmetic. An argument from Tennenbaum’s theorem P Quinon12, K Zdanowski Computation and logic in the real world, 313, 2007 | 19 | 2007 |
| FM-representability and beyond M Mostowski, K Zdanowski Conference on Computability in Europe, 358-367, 2005 | 18 | 2005 |
| On second order intuitionistic propositional logic without a universal quantifier K Zdanowski The Journal of Symbolic Logic 74 (1), 157-167, 2009 | 15 | 2009 |
| New bounds on the strength of some restrictions of Hindman’s Theorem L Carlucci, LA Kołodziejczyk, F Lepore, K Zdanowski Computability 9 (2), 139-153, 2020 | 12 | 2020 |
| On the Mints hierarchy in first-order intuitionistic logic A Schubert, P Urzyczyn, K Zdanowski International Conference on Foundations of Software Science and Computation …, 2015 | 11 | 2015 |
| Arithmetics in finite but potentially infinite worlds K Zdanowski PhD thesis, Warsaw University, 2005 | 10 | 2005 |
| On the Mints hierarchy in first-order intuitionistic logic A Schubert, P Urzyczyn, K Zdanowski Logical Methods in Computer Science 12, 2017 | 8 | 2017 |
| Lower bounds for the provability of Herbrand consistency in weak arithmetics Z Adamowicz, K Zdanowski Logical Approaches to Barriers in Computing and Complexity, 1, 2011 | 8 | 2011 |
| Coprimality in finite models M Mostowski, K Zdanowski International Workshop on Computer Science Logic, 263-275, 2005 | 8 | 2005 |
| The strength of Ramsey’s theorem for coloring relatively large sets L Carlucci, K Zdanowski The Journal of Symbolic Logic 79 (1), 89-102, 2014 | 7 | 2014 |
| Theories of initial segments of standard models of arithmetics and their complete extensions M Krynicki, J Tomasik, K Zdanowski Theoretical Computer Science 412 (31), 3975-3991, 2011 | 7 | 2011 |
| A modal logic of a truth definition for finite models M Czarnecki, K Zdanowski Fundamenta Informaticae 164 (4), 299-325, 2019 | 6 | 2019 |
| Finite arithmetics M Krynicki, M Mostowski, K Zdanowski Fundamenta Informaticae 81 (1-3), 183-202, 2007 | 6 | 2007 |
| Degrees of logics with Henkin quantifiers in poor vocabularies M Mostowski, K Zdanowski Archive for Mathematical Logic 43, 691-702, 2004 | 6 | 2004 |
| A note on Ramsey theorems and turing jumps L Carlucci, K Zdanowski Conference on Computability in Europe, 89-95, 2012 | 3 | 2012 |
