Leszek Aleksander Kolodziejczyk

39 papers A* 2A 2B 1C 3Journal 31

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Polynomial Calculus Space and Resolution Width. Theory Comput. Nicola Galesi, Leszek Aleksander Kolodziejczyk, Neil Thapen
2024	J	`jnl`	Ramsey's theorem for pairs, collection, and proof size. J. Math. Log. Leszek Aleksander Kolodziejczyk, Tin Lok Wong, Keita Yokoyama
2024	A	`conf`	The Strength of the Dominance Rule. SAT Leszek Aleksander Kolodziejczyk, Neil Thapen
2024	J	`jnl`	The strength of the dominance rule. CoRR Leszek Aleksander Kolodziejczyk, Neil Thapen
2023	J	`jnl`	How Strong is Ramsey's Theorem if infinity can be Weak? J. Symb. Log. Leszek Aleksander Kolodziejczyk, Katarzyna W. Kowalik, Keita Yokoyama
2022	J	`jnl`	Approximate counting and NP search problems. J. Math. Log. Leszek Aleksander Kolodziejczyk, Neil Thapen
2021	C	`conf`	In Search of the First-Order Part of Ramsey's Theorem for Pairs. CiE Leszek Aleksander Kolodziejczyk, Keita Yokoyama
2021	J	`jnl`	Weaker cousins of Ramsey's theorem over a weak base theory. Ann. Pure Appl. Log. Marta Fiori-Carones, Leszek Aleksander Kolodziejczyk, Katarzyna W. Kowalik
2020	J	`jnl`	New bounds on the strength of some restrictions of Hindman's Theorem. Comput. Lorenzo Carlucci, Leszek Aleksander Kolodziejczyk, Francesco Lepore, Konrad Zdanowski
2019	A*	`conf`	Polynomial Calculus Space and Resolution Width. FOCS Nicola Galesi, Leszek Aleksander Kolodziejczyk, Neil Thapen
2019	J	`jnl`	Polynomial calculus space and resolution width. Electron. Colloquium Comput. Complex. Nicola Galesi, Leszek Aleksander Kolodziejczyk, Neil Thapen
2019	J	`jnl`	The logical strength of Büchi's decidability theorem. Log. Methods Comput. Sci. Leszek Aleksander Kolodziejczyk, Henryk Michalewski, Cécilia Pradic, Michal Skrzypczak
2018	J	`jnl`	Approximate counting and NP search problems. CoRR Leszek Aleksander Kolodziejczyk, Neil Thapen
2018	J	`jnl`	Some Subsystems of Constant-Depth Frege with Parity. ACM Trans. Comput. Log. Michal Garlík, Leszek Aleksander Kolodziejczyk
2017	C	`conf`	New Bounds on the Strength of Some Restrictions of Hindman's Theorem. CiE Lorenzo Carlucci, Leszek Aleksander Kolodziejczyk, Francesco Lepore, Konrad Zdanowski
2016	J	`jnl`	End-Extensions of Models of Weak Arithmetic from Complexity-Theoretic Containments. J. Symb. Log. Leszek Aleksander Kolodziejczyk
2016	A*	`conf`	How unprovable is Rabin's decidability theorem? LICS Leszek Aleksander Kolodziejczyk, Henryk Michalewski
2016	B	`conf`	The Logical Strength of Büchi's Decidability Theorem. CSL Leszek Aleksander Kolodziejczyk, Henryk Michalewski, Cécilia Pradic, Michal Skrzypczak
2016	J	`jnl`	The logical strength of Büchi's decidability theorem. CoRR Leszek Aleksander Kolodziejczyk, Henryk Michalewski, Cécilia Pradic, Michal Skrzypczak
2015	J	`jnl`	Categorical characterizations of the natural numbers require primitive recursion. Ann. Pure Appl. Log. Leszek Aleksander Kolodziejczyk, Keita Yokoyama
2015	J	`jnl`	How unprovable is Rabin's decidability theorem? CoRR Leszek Aleksander Kolodziejczyk, Henryk Michalewski
2014	J	`jnl`	Fragments of Approximate Counting. J. Symb. Log. Samuel R. Buss, Leszek Aleksander Kolodziejczyk, Neil Thapen
2014	J	`jnl`	Small Stone in Pool. Log. Methods Comput. Sci. Samuel R. Buss, Leszek Aleksander Kolodziejczyk
2013	J	`jnl`	Real closures of models of weak arithmetic. Arch. Math. Log. Emil Jerábek, Leszek Aleksander Kolodziejczyk
2013	J	`jnl`	Solutions in XML data exchange. J. Comput. Syst. Sci. Mikolaj Bojanczyk, Leszek Aleksander Kolodziejczyk, Filip Murlak
2012	J	`jnl`	Truth definitions without exponentiation and the Σ₁ collection scheme. J. Symb. Log. Zofia Adamowicz, Leszek Aleksander Kolodziejczyk, Jeff B. Paris
2011	J	`jnl`	Independence results for variants of sharply bounded induction. Ann. Pure Appl. Log. Leszek Aleksander Kolodziejczyk
2011	A	`conf`	Solutions in XML data exchange. ICDT Mikolaj Bojanczyk, Leszek Aleksander Kolodziejczyk, Filip Murlak
2011	J	`jnl`	The provably total NP search problems of weak second order bounded arithmetic. Ann. Pure Appl. Log. Leszek Aleksander Kolodziejczyk, Phuong Nguyen, Neil Thapen
2010	J	`jnl`	A note on the Sigma Math. Log. Q. Zofia Adamowicz, Leszek Aleksander Kolodziejczyk
2010	J	`jnl`	The strength of sharply bounded induction requires MSP. Ann. Pure Appl. Log. Sedki Boughattas, Leszek Aleksander Kolodziejczyk
2009	J	`jnl`	The polynomial and linear time hierarchies in V Math. Log. Q. Leszek Aleksander Kolodziejczyk, Neil Thapen
2008	J	`jnl`	The polynomial and linear hierarchies in models where the weak pigeonhole principle fails. J. Symb. Log. Leszek Aleksander Kolodziejczyk, Neil Thapen
2007	J	`jnl`	Partial collapses of the Sigma Ann. Pure Appl. Log. Zofia Adamowicz, Leszek Aleksander Kolodziejczyk
2007	C	`conf`	The Polynomial and Linear Hierarchies in V CiE Leszek Aleksander Kolodziejczyk, Neil Thapen
2006	J	`jnl`	On the Herbrand notion of consistency for finitely axiomatizable fragments of bounded arithmetic theories. J. Symb. Log. Leszek Aleksander Kolodziejczyk
2004	J	`jnl`	A finite model-theoretical proof of a property of bounded query classes within PH. J. Symb. Log. Leszek Aleksander Kolodziejczyk
2004	J	`jnl`	Truth definitions in finite models. J. Symb. Log. Leszek Aleksander Kolodziejczyk
2004	J	`jnl`	Well-behaved principles alternative to bounded induction. Theor. Comput. Sci. Zofia Adamowicz, Leszek Aleksander Kolodziejczyk