Journal papers:

• S. R. Buss, L. A. Kołodziejczyk, N. Thapen, Fragments of approximate counting, preprint. [PDF]
• E. Jeřábek, L. A. Kołodziejczyk, Real closures of models of weak arithmetic, submitted. [PDF]
• Z. Adamowicz, L. A. Kołodziejczyk, J. Paris, Truth definitions without exponentiation and the \Sigma_1 collection scheme, accepted to the Journal of Symbolic Logic. [PDF]
• L. A. Kołodziejczyk, Independence results for variants of sharply bounded induction, Annals of Pure and Applied Logic, 162 (2011), 981-990. [PDF]
• L. A. Kołodziejczyk, P. Nguyen, N. Thapen, The provably total NP search problems of weak second order bounded arithmetic, Annals of Pure and Applied Logic 162 (2011), 419-446. [PDF]
• Z. Adamowicz, L. A. Kołodziejczyk, A note on the \Sigma_1 collection scheme and fragments of bounded arithmetic, Mathematical Logic Quarterly 56 (2010), 126-130. [PDF]
• S. Boughattas, L. A. Kołodziejczyk, The strength of sharply bounded induction requires MSP, Annals of Pure and Applied Logic 161 (2010), 504-510. [PDF]
• L. A. Kołodziejczyk, N. Thapen, The polynomial and linear hierarchies in V^0, Mathematical Logic Quarterly 55 (2009), 509-514. [PDF] Preliminary version in proceedings of CiE 2007, LNCS 4497, 408-415.
• L. A. Kołodziejczyk, N. Thapen, The polynomial and linear hierarchies in models where the weak pigeonhole principle fails, Journal of Symbolic Logic 73 (2008), 578-592. [PDF]
• Z. Adamowicz, L. A. Kołodziejczyk, Partial collapses of the \Sigma_1 complexity hierarchy in models for fragments of bounded arithmetic, Annals of Pure and Applied Logic 145 (2007), 91-95. [PDF]
• L. A. Kołodziejczyk, On the Herbrand notion of consistency for finitely axiomatizable fragments of bounded arithmetic theories, Journal of Symbolic Logic 71 (2006), 624-638. [PDF]
• L. A. Kołodziejczyk, A finite model-theoretical proof of a property of bounded query classes within PH, Journal of Symbolic Logic 69 (2004), 1105-1116. [PDF]
• Z. Adamowicz, L. A. Kołodziejczyk, Well-behaved principles alternative to bounded induction, Theoretical Computer Science 322 (2004), 5-16. [PDF]
• L. A. Kołodziejczyk, Truth definitions in finite models, Journal of Symbolic Logic 69 (2004), 183-200. [PDF]
• Z. Adamowicz, L. A. Kołodziejczyk, P. Zbierski, An application of a reflection principle, Fundamenta Mathematicae 180 (2003), 139-159. [PDF]

Conference papers:

• M. Bojańczyk, L. A. Kołodziejczyk, F. Murlak, Solutions in XML data exchange, ICDT 2011. [PDF]

Theses:

• Truth definitions and higher order logics in finite models, Ph.D. thesis, Institute of Philosophy, Warsaw University, 2005. [PDF]
• Zasada kolekcji w arytmetyce [The collection principle in arithmetic], master's thesis, Institute of Mathematics, Warsaw University, 2004.
• The expressive power of Henkin quantifiers with dualization, master's thesis, Institute of Philosophy, Warsaw University, 2002. [PDF]