Leszek Aleksander Kołodziejczyk

Available identifiers

zbMath Open kolodziejczyk.leszek-aleksanderWikidataQ26251021 ScholiaQ26251021MaRDI QIDQ476118

List of research outcomes

Publication	Date of Publication	Type
HOW STRONG IS RAMSEY’S THEOREM IF INFINITY CAN BE WEAK?	2023-06-05	Paper
Approximate counting and NP search problems	2022-12-13	Paper
In search of the first-order part of Ramsey's theorem for pairs	2022-03-22	Paper
An isomorphism theorem for models of Weak K\"onig's Lemma without primitive recursion	2021-12-20	Paper
Weaker cousins of Ramsey's theorem over a weak base theory	2021-09-30	Paper
New bounds on the strength of some restrictions of Hindman’s Theorem	2020-11-09	Paper
Some upper bounds on ordinal-valued Ramsey numbers for colourings of pairs	2020-08-25	Paper
Ramsey's theorem for pairs, collection, and proof size	2020-05-14	Paper
https://portal.mardi4nfdi.de/entity/Q5224695	2019-07-24	Paper
https://portal.mardi4nfdi.de/entity/Q5377469	2019-05-24	Paper
Some Subsystems of Constant-Depth Frege with Parity	2019-02-07	Paper
How unprovable is Rabin's decidability theorem?	2018-04-23	Paper
New bounds on the strength of some restrictions of Hindman's theorem	2017-08-04	Paper
The Logical Strength of Büchi's Decidability Theorem	2017-07-19	Paper
END-EXTENSIONS OF MODELS OF WEAK ARITHMETIC FROM COMPLEXITY-THEORETIC CONTAINMENTS	2017-04-28	Paper
The logical strength of B\"uchi's decidability theorem	2016-08-26	Paper
Collapsing modular counting in bounded arithmetic and constant depth propositional proofs	2015-09-08	Paper
Categorical characterizations of the natural numbers require primitive recursion	2014-11-28	Paper
Fragments of approximate counting	2014-09-30	Paper
Small Stone in Pool	2014-07-31	Paper
Solutions in XML data exchange	2014-01-20	Paper
Real closures of models of weak arithmetic	2013-02-15	Paper
Truth definitions without exponentiation and the \(\Sigma _{1}\) collection scheme	2012-06-19	Paper
Independence results for variants of sharply bounded induction	2011-09-22	Paper
The strength of sharply bounded induction requires MSP	2011-08-26	Paper
A note on the \(\Sigma_1\) collection scheme and fragments of bounded arithmetic	2010-04-15	Paper
The polynomial and linear time hierarchies in V0	2009-10-14	Paper
The polynomial and linear hierarchies in models where the weak pigeonhole principle fails	2008-06-09	Paper
The Polynomial and Linear Hierarchies in V0	2007-11-13	Paper
Partial collapses of the \(\Sigma _1\) complexity hierarchy in models for fragments of bounded arithmetic	2007-02-14	Paper
On the Herbrand notion of consistency for finitely axiomatizable fragments of bounded arithmetic theories	2006-08-03	Paper
Truth definitions in finite models	2005-08-29	Paper
A finite model-theoretical proof of a property of bounded query classes within PH	2005-08-29	Paper
Well-behaved principles alternative to bounded induction	2004-10-27	Paper
An application of a reflection principle	2004-08-19	Paper

Research outcomes over time

This page was built for person: Leszek Aleksander Kołodziejczyk