Leszek Aleksander Kołodziejczyk

From MaRDI portal
Person:476118

Available identifiers

zbMath Open kolodziejczyk.leszek-aleksanderWikidataQ26251021 ScholiaQ26251021MaRDI QIDQ476118

List of research outcomes





PublicationDate of PublicationType
HOW STRONG IS RAMSEY’S THEOREM IF INFINITY CAN BE WEAK?2023-06-05Paper
Approximate counting and NP search problems2022-12-13Paper
In search of the first-order part of Ramsey's theorem for pairs2022-03-22Paper
An isomorphism theorem for models of Weak K\"onig's Lemma without primitive recursion2021-12-20Paper
Weaker cousins of Ramsey's theorem over a weak base theory2021-09-30Paper
New bounds on the strength of some restrictions of Hindman’s Theorem2020-11-09Paper
Some upper bounds on ordinal-valued Ramsey numbers for colourings of pairs2020-08-25Paper
Ramsey's theorem for pairs, collection, and proof size2020-05-14Paper
https://portal.mardi4nfdi.de/entity/Q52246952019-07-24Paper
https://portal.mardi4nfdi.de/entity/Q53774692019-05-24Paper
Some Subsystems of Constant-Depth Frege with Parity2019-02-07Paper
How unprovable is Rabin's decidability theorem?2018-04-23Paper
New bounds on the strength of some restrictions of Hindman's theorem2017-08-04Paper
The Logical Strength of Büchi's Decidability Theorem2017-07-19Paper
END-EXTENSIONS OF MODELS OF WEAK ARITHMETIC FROM COMPLEXITY-THEORETIC CONTAINMENTS2017-04-28Paper
The logical strength of B\"uchi's decidability theorem2016-08-26Paper
Collapsing modular counting in bounded arithmetic and constant depth propositional proofs2015-09-08Paper
Categorical characterizations of the natural numbers require primitive recursion2014-11-28Paper
Fragments of approximate counting2014-09-30Paper
Small Stone in Pool2014-07-31Paper
Solutions in XML data exchange2014-01-20Paper
Real closures of models of weak arithmetic2013-02-15Paper
Truth definitions without exponentiation and the \(\Sigma _{1}\) collection scheme2012-06-19Paper
Independence results for variants of sharply bounded induction2011-09-22Paper
The strength of sharply bounded induction requires MSP2011-08-26Paper
A note on the \(\Sigma_1\) collection scheme and fragments of bounded arithmetic2010-04-15Paper
The polynomial and linear time hierarchies in V02009-10-14Paper
The polynomial and linear hierarchies in models where the weak pigeonhole principle fails2008-06-09Paper
The Polynomial and Linear Hierarchies in V02007-11-13Paper
Partial collapses of the \(\Sigma _1\) complexity hierarchy in models for fragments of bounded arithmetic2007-02-14Paper
On the Herbrand notion of consistency for finitely axiomatizable fragments of bounded arithmetic theories2006-08-03Paper
Truth definitions in finite models2005-08-29Paper
A finite model-theoretical proof of a property of bounded query classes within PH2005-08-29Paper
Well-behaved principles alternative to bounded induction2004-10-27Paper
An application of a reflection principle2004-08-19Paper

Research outcomes over time

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