Publikacje

Leszek Kołodziejczyk

Liczba publikacji: 36

2023

• Leszek Kołodziejczyk , Katarzyna Kowalik, Keita Yokoyama, How strong is Ramsey's theorem if infinity can be weak?, Journal of Symbolic Logic, 88 (2) 2023, s. 620-639. Zobacz w PBN

2022

• Leszek Kołodziejczyk , Neil Thapen, Approximate counting and NP search problems, Journal of Mathematical Logic, 22 (3) 2022. Zobacz w PBN

2021

• Marta Fiori Carones, Leszek Kołodziejczyk , Katarzyna W. Kowalik, Weaker cousins of Ramsey's theorem over a weak base theory, Annals of Pure and Applied Logic, 172 (10) 2021, s. 103028:1-103028:4. Zobacz w PBN

2020

• Lorenzo Carlucci, Leszek Kołodziejczyk , Francesco Lepore, Konrad Zdanowski, New bounds on the strength of some restrictions of Hindman’s Theorem, Computability, 9 (2) 2020, s. 139-153. Zobacz w PBN
• Leszek Kołodziejczyk , Keita Yokoyama, Some upper bounds on ordinal-valued Ramsey numbers for colourings of pairs, Selecta Mathematica-New Series, 26 (4) 2020, s. 56:1-18. Zobacz w PBN

2019

• Nicola Galesi, Leszek Kołodziejczyk , Neil Thapen, Polynomial Calculus Space and Resolution Width, 60th Annual IEEE Symposium on Foundations of Computer Science, Baltimore, Maryland, the United States of America, 9 listopada 2019 - 12 listopada 2019. Zobacz w PBN
• Leszek Kołodziejczyk , Henryk Michalewski , Pierre Pradic, Michał Skrzypczak , The logical strength of Büchi's decidability theorem, Logical Methods in Computer Science, 15 (2) 2019, s. 16:1-16:31. Zobacz w PBN

2018

• Michal Garlík, Leszek Kołodziejczyk , Some Subsystems of Constant-Depth Frege with Parity, ACM Transactions on Computational Logic, 19 (4) 2018, s. 29:1-29:34. Zobacz w PBN

2017

• Lorenzo Carlucci, Leszek Kołodziejczyk , Francesco Lepore, Konrad Zdanowski, New Bounds on the Strength of Some Restrictions of Hindman’s Theorem, Computability in Europe 2017: Unveiling Dynamics and Complexity, Turku, Finland, 12 czerwca 2017 - 16 czerwca 2017. Zobacz w PBN

2016

• Leszek Kołodziejczyk , A Reflection on Collection, 2016. Zobacz w PBN
• Leszek Kołodziejczyk , End-extensions of models of weak arithmetic from complexity-theoretic containments, Journal of Symbolic Logic, 2016. Zobacz w PBN
• Leszek Kołodziejczyk , Henryk Michalewski , How unprovable is Rabin's decidability theorem?, LICS '16: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, Nowy Jork, the United States of America, 5 lipca 2016 - 8 lipca 2016. Zobacz w PBN
• Leszek Kołodziejczyk , Henryk Michalewski , Pierre Pradic, Michał Skrzypczak , The logical strength of Büchi's decidability theorem, 25th EACSL Annual Conference on Computer Science Logic, Marsylia, France, 29 sierpnia 2016 - 1 września 2016. Zobacz w PBN

2015

• Leszek Kołodziejczyk , Keita Yokoyama, Categorical characterizations of the natural numbers require primitive recursion, Annals of Pure and Applied Logic, 2015. Zobacz w PBN
• Samuel R. Buss, Leszek Kołodziejczyk , Konrad Zdanowski, Collapsing modular counting in bounded arithmetic and constant depth propositional proofs, Transactions of the American Mathematical Society, 2015. Zobacz w PBN

2014

• Leszek Kołodziejczyk , Samuel R. Buss, Neil Thapen, Fragments of approximate counting, Journal of Symbolic Logic, 79 (2) 2014, s. 496-525. Zobacz w PBN
• Samuel R. Buss, Leszek Kołodziejczyk , Small stone in pool, Logical Methods in Computer Science, 2014. Zobacz w PBN

2013

• Leszek Kołodziejczyk , Emil Jeřábek, Real closures of models of weak arithmetic, Archive for Mathematical Logic, 52 (1-2) 2013, s. 143-157. Zobacz w PBN
• Mikołaj Bojańczyk , Leszek Kołodziejczyk , Filip Murlak , Solutions in XML data exchange, Journal of Computer and System Sciences, 79 (6) 2013, s. 785-815. Zobacz w PBN

2012

• Zofia Adamowicz, Leszek Kołodziejczyk , Jeff Paris, Truth definitions without exponentiation and the $\Sigma_1$ collection scheme, Journal of Symbolic Logic, 2012. Zobacz w PBN

2011

• Leszek Kołodziejczyk , Independence results for variants of sharply bounded induction, Annals of Pure and Applied Logic, 2011. Zobacz w PBN
• Mikołaj Bojańczyk , Leszek Kołodziejczyk , Filip Murlak , Solutions in XML data exchange, 2011. Zobacz w PBN
• Leszek Kołodziejczyk , Phuong Nguyen, Neil Thapen, The provably total NP search problems of weak second order bounded arithmetic, Annals of Pure and Applied Logic, 2011. Zobacz w PBN

2010

• Zofia Adamowicz, Leszek Kołodziejczyk , A note on the $\Sigma_1$ collection scheme and fragments of bounded arithmetic, Mathematical Logic Quarterly, 2010. Zobacz w PBN
• Sedki Boughattas, Leszek Kołodziejczyk , The strength of sharply bounded induction requires MSP, Annals of Pure and Applied Logic, 2010. Zobacz w PBN

2009

• Leszek Kołodziejczyk , Neil Thapen, The polynomial and linear time hierarchies in $V^0$, Mathematical Logic Quarterly, 2009. Zobacz w PBN

2008

• Leszek Kołodziejczyk , Neil Thapen, The polynomial and linear hierarchies in models where the weak pigeonhole principle fails, Journal of Symbolic Logic, 2008. Zobacz w PBN

2007

• Zofia Adamowicz, Leszek Kołodziejczyk , Partial collapses of the $\Sigma_1$ complexity hierarchy in models for fragments of bounded arithmetics, Annals of Pure and Applied Logic, 2007. Zobacz w PBN
• Leszek Kołodziejczyk , Neil Thapen, The polynomial and linear hierarchies in $V^0$, Lecture Notes in Computer Science, CiE 2007 - Computability in Europe, 2007. Zobacz w PBN

2006

• Leszek Kołodziejczyk , On the Herbrand notion of consistency for finitely axiomatizable fragments of bounded arithmetic theories, Journal of Symbolic Logic, 2006. Zobacz w PBN

2005

• Leszek Kołodziejczyk , Rafał Szczepkowski, Przekład I księgi Elementów Euklidesa. Wstęp. Komentarz., Zagadnienia Naukoznawstwa, 2005. Zobacz w PBN

2004

• Leszek Kołodziejczyk , A finite model - theoretical proof of a property of bounded query classes within PH, Journal of Symbolic Logic, 2004. Zobacz w PBN
• Leszek Kołodziejczyk , Truth definitions in finite models, Journal of Symbolic Logic, 2004. Zobacz w PBN
• Zofia Adamowicz, Leszek Kołodziejczyk , Well-behaved principles alternative to bounded induction, Theoretical Computer Science, 2004. Zobacz w PBN

2003

• Zofia Adamowicz, Leszek Kołodziejczyk , Paweł Zbierski, An application of a reflection principle, Fundamenta Mathematicae, 2003. Zobacz w PBN

Inne

• Leszek Kołodziejczyk , Keita Yokoyama, In Search of the First-Order Part of Ramsey’s Theorem for Pairs, Connecting with Computability: 17th Conference on Computability in Europe, CiE 2021, Virtual Event, Ghent, July 5–9, 2021, Proceedings, , s. 297-307. Zobacz w PBN