Leszek Kołodziejczyk
Leszek Kołodziejczyk
Associate Professor, University of Warsaw
Verified email at
Cited by
Cited by
Fragments of approximate counting
SR Buss, LA Kołodziejczyk, N Thapen
The Journal of Symbolic Logic 79 (2), 496-525, 2014
Collapsing modular counting in bounded arithmetic and constant depth propositional proofs
S Buss, LA Kołodziejczyk, K Zdanowski
Transactions of the American Mathematical Society 367 (11), 7517-7563, 2015
Solutions in XML data exchange
M Bojańczyk, LA Kołodziejczyk, F Murlak
Proceedings of the 14th International Conference on Database Theory, 102-113, 2011
The provably total NP search problems of weak second order bounded arithmetic
LA Kołodziejczyk, P Nguyen, N Thapen
Annals of Pure and Applied Logic 162 (6), 419-446, 2011
Truth definitions in finite models
LA Kołodziejczyk
The Journal of Symbolic Logic 69 (1), 183-200, 2004
Small stone in pool
SR Buss, LA Kolodziejczyk
Logical Methods in Computer Science 10, 2014
The logical strength of Büchi's decidability theorem
L Kołodziejczyk, H Michalewski, P Pradic, M Skrzypczak
arXiv preprint arXiv:1608.07514, 2016
Truth definitions without exponentiation and the Σ1 collection scheme
Z Adamowicz, LA Kolodziejczyk, J Paris
Journal of Symbolic Logic 77 (2), 649-655, 2012
Some subsystems of constant-depth frege with parity
M Garlik, LA Kołodziejczyk
ACM Transactions on Computational Logic (TOCL) 19 (4), 1-34, 2018
On the Herbrand notion of consistency for finitely axiomatizable fragments of bounded arithmetic theories
LA Kołodziejczyk
The Journal of Symbolic Logic 71 (2), 624-638, 2006
A finite model-theoretical proof of a property of bounded query classes within PH
LA Kołodziejczyk
The Journal of Symbolic Logic 69 (4), 1105-1116, 2004
Well-behaved principles alternative to bounded induction
Z Adamowicz, LA Kołodziejczyk
Theoretical computer science 322 (1), 5-16, 2004
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
The strength of sharply bounded induction requires MSP
S Boughattas, LA Kołodziejczyk
Annals of Pure and Applied Logic 161 (4), 504-510, 2010
Some upper bounds on ordinal-valued Ramsey numbers for colourings of pairs
LA Kołodziejczyk, K Yokoyama
Selecta Mathematica 26 (4), 56, 2020
Polynomial calculus space and resolution width
N Galesi, L Kolodziejczyk, N Thapen
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019
How unprovable is Rabin's decidability theorem?
LA Kołodziejczyk, H Michalewski
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer …, 2016
Categorical characterizations of the natural numbers require primitive recursion
LA Kołodziejczyk, K Yokoyama
Annals of Pure and Applied Logic 166 (2), 219-231, 2015
Real closures of models of weak arithmetic
E Jeřábek, LA Kołodziejczyk
Archive for Mathematical Logic 52 (1), 143-157, 2013
How strong is Ramsey’s theorem if infinity can be weak?
LA Kołodziejczyk, KW Kowalik, K Yokoyama
The Journal of Symbolic Logic 88 (2), 620-639, 2023
The system can't perform the operation now. Try again later.
Articles 1–20