| Publication | Date of Publication | Type |
|---|
An isomorphism theorem for models of weak König's lemma without primitive recursion
Journal of the European Mathematical Society (JEMS) | 2026-05-15 | Paper |
Polynomial calculus space and resolution width
Theory of Computing | 2026-02-10 | Paper |
| The strength of the dominance rule | 2026-02-03 | Paper |
| Polynomial calculus space and resolution width | 2025-08-12 | Paper |
HOW STRONG IS RAMSEY’S THEOREM IF INFINITY CAN BE WEAK?
Journal of Symbolic Logic | 2023-06-05 | Paper |
Approximate counting and NP search problems
Journal of Mathematical Logic | 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
Annals of Pure and Applied Logic | 2021-09-30 | Paper |
New bounds on the strength of some restrictions of Hindman’s Theorem
Computability | 2020-11-09 | Paper |
Some upper bounds on ordinal-valued Ramsey numbers for colourings of pairs
Selecta Mathematica. New Series | 2020-08-25 | Paper |
| Ramsey's theorem for pairs, collection, and proof size | 2020-05-14 | Paper |
| A reflection on collection | 2019-07-24 | Paper |
The logical strength of Büchi's decidability theorem
(available as arXiv preprint) | 2019-05-24 | Paper |
Some subsystems of constant-depth Frege with parity
ACM Transactions on Computational Logic | 2019-02-07 | Paper |
How unprovable is Rabin's decidability theorem?
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
New bounds on the strength of some restrictions of Hindman's theorem
(available as arXiv preprint) | 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
Journal of Symbolic Logic | 2017-04-28 | Paper |
The logical strength of B\"uchi's decidability theorem
(available as arXiv preprint) | 2016-08-26 | Paper |
Collapsing modular counting in bounded arithmetic and constant depth propositional proofs
Transactions of the American Mathematical Society | 2015-09-08 | Paper |
Categorical characterizations of the natural numbers require primitive recursion
Annals of Pure and Applied Logic | 2014-11-28 | Paper |
Fragments of approximate counting
The Journal of Symbolic Logic | 2014-09-30 | Paper |
Small Stone in pool
Logical Methods in Computer Science | 2014-07-31 | Paper |
Solutions in XML data exchange
Journal of Computer and System Sciences | 2014-01-20 | Paper |
Real closures of models of weak arithmetic
Archive for Mathematical Logic | 2013-02-15 | Paper |
Truth definitions without exponentiation and the \(\Sigma _{1}\) collection scheme
The Journal of Symbolic Logic | 2012-06-19 | Paper |
Independence results for variants of sharply bounded induction
Annals of Pure and Applied Logic | 2011-09-22 | Paper |
The strength of sharply bounded induction requires MSP
Annals of Pure and Applied Logic | 2011-08-26 | Paper |
A note on the \(\Sigma_1\) collection scheme and fragments of bounded arithmetic
MLQ | 2010-04-15 | Paper |
The polynomial and linear time hierarchies in V<sup>0</sup>
MLQ | 2009-10-14 | Paper |
The polynomial and linear hierarchies in models where the weak pigeonhole principle fails
Journal of Symbolic Logic | 2008-06-09 | Paper |
The Polynomial and Linear Hierarchies in V0
Lecture Notes in Computer Science | 2007-11-13 | Paper |
Partial collapses of the \(\Sigma _1\) complexity hierarchy in models for fragments of bounded arithmetic
Annals of Pure and Applied Logic | 2007-02-14 | Paper |
On the Herbrand notion of consistency for finitely axiomatizable fragments of bounded arithmetic theories
Journal of Symbolic Logic | 2006-08-03 | Paper |
Truth definitions in finite models
Journal of Symbolic Logic | 2005-08-29 | Paper |
A finite model-theoretical proof of a property of bounded query classes within PH
Journal of Symbolic Logic | 2005-08-29 | Paper |
Well-behaved principles alternative to bounded induction
Theoretical Computer Science | 2004-10-27 | Paper |
An application of a reflection principle
Fundamenta Mathematicae | 2004-08-19 | Paper |
