| Publication | Date of Publication | Type |
|---|
\(\Pi^0_4\) conservation of Ramsey's theorem for pairs
Journal of the London Mathematical Society. Second Series | 2026-02-02 | Paper |
The reverse mathematics of Carlson's theorem for located words
Journal of Combinatorics | 2025-09-02 | Paper |
The reverse mathematics of \textsf{CAC for trees}
Journal of Symbolic Logic | 2024-11-25 | Paper |
Milliken’s Tree Theorem and Its Applications: A Computability-Theoretic Perspective
Memoirs of the American Mathematical Society | 2024-02-20 | Paper |
Carlson-Simpson's lemma and applications in reverse mathematics
Annals of Pure and Applied Logic | 2023-07-26 | Paper |
| Computability. Randomness, reverse mathematics and hypercomputability | 2022-10-04 | Paper |
Ramsey-like theorems and moduli of computation
Journal of Symbolic Logic | 2022-04-12 | Paper |
Relationships between computability-theoretic properties of problems
Journal of Symbolic Logic | 2022-04-12 | Paper |
THE REVERSE MATHEMATICS OF THE THIN SET AND ERDŐS–MOSER THEOREMS
Journal of Symbolic Logic | 2022-04-12 | Paper |
| Partition genericity and pigeonhole basis theorems | 2022-04-06 | Paper |
The weakness of the pigeonhole principle under hyperarithmetical reductions
Journal of Mathematical Logic | 2021-11-03 | Paper |
Computing sets from all infinite subsets
Transactions of the American Mathematical Society | 2021-10-21 | Paper |
\( \mathsf{SRT}_2^2\) does not imply \(\mathsf{RT}_2^2\) in \(\omega \)-models
Advances in Mathematics | 2021-08-23 | Paper |
COH, SRT 2 2 , and multiple functionals
Computability | 2021-06-25 | Paper |
The reverse mathematics of the Thin set and Erd\H{o}s-Moser theorems
(available as arXiv preprint) | 2021-03-14 | Paper |
Ramsey's theorem and products in the Weihrauch degrees
Computability | 2020-11-09 | Paper |
Some results concerning the \(\mathsf{SRT}_2^2\) vs. \(\mathsf{COH}\) problem
Computability | 2020-11-09 | Paper |
Thin set theorems and cone avoidance
Transactions of the American Mathematical Society | 2020-03-02 | Paper |
The Rado path decomposition theorem
Israel Journal of Mathematics | 2019-12-17 | Paper |
Pigeons do not jump high
Advances in Mathematics | 2019-07-19 | Paper |
\({\Pi}_1^0\)-encodability and omniscient reductions
Notre Dame Journal of Formal Logic | 2019-05-29 | Paper |
\({\Pi}_1^0\)-encodability and omniscient reductions
Notre Dame Journal of Formal Logic | 2019-05-29 | Paper |
SRT22 does not imply RT22 in omega-models
(available as arXiv preprint) | 2019-05-20 | Paper |
COH, SRT22, and multiple functionals
(available as arXiv preprint) | 2019-05-01 | Paper |
Partial orders and immunity in reverse mathematics
Computability | 2019-03-20 | Paper |
Relationships between computability-theoretic properties of problems
(available as arXiv preprint) | 2019-03-11 | Paper |
A computable analysis of variable words theorems
Proceedings of the American Mathematical Society | 2019-01-07 | Paper |
The proof-theoretic strength of Ramsey's theorem for pairs and two colors
Advances in Mathematics | 2018-06-22 | Paper |
On the logical strengths of partial solutions to mathematical problems
Transactions of the London Mathematical Society | 2018-05-25 | Paper |
Coloring the rationals in reverse mathematics
Computability | 2018-01-18 | Paper |
Iterative forcing and hyperimmunity in reverse mathematics
Computability | 2017-11-22 | Paper |
The reverse mathematics of non-decreasing subsequences
Archive for Mathematical Logic | 2017-09-15 | Paper |
Coloring trees in reverse mathematics
Advances in Mathematics | 2017-09-04 | Paper |
Dominating the Erdős-Moser theorem in reverse mathematics
Annals of Pure and Applied Logic | 2017-08-29 | Paper |
Open questions about Ramsey-type statements in reverse mathematics
The Bulletin of Symbolic Logic | 2017-05-26 | Paper |
The strength of the tree theorem for pairs in reverse mathematics
Journal of Symbolic Logic | 2017-04-28 | Paper |
Diagonally non-computable functions and fireworks
Information and Computation | 2017-03-16 | Paper |
Controlling iterated jumps of solutions to combinatorial problems
Computability | 2017-02-23 | Paper |
The weakness of being cohesive, thin or free in reverse mathematics
Israel Journal of Mathematics | 2017-01-11 | Paper |
Ramsey's theorem for singletons and strong computable reducibility
Proceedings of the American Mathematical Society | 2016-12-29 | Paper |
Partial orders and immunity in reverse mathematics
Pursuit of the Universal | 2016-08-17 | Paper |
Pi01 encodability and omniscient reductions
(available as arXiv preprint) | 2016-03-03 | Paper |
Ramsey-type graph coloring and diagonal non-computability
Archive for Mathematical Logic | 2015-11-18 | Paper |
Iterative forcing and hyperimmunity in reverse mathematics
Evolving Computability | 2015-10-20 | Paper |
Degrees bounding principles and universal instances in reverse mathematics
Annals of Pure and Applied Logic | 2015-08-21 | Paper |
The complexity of satisfaction problems in reverse mathematics
Computability | 2015-07-01 | Paper |
The Complexity of Satisfaction Problems in Reverse Mathematics
Language, Life, Limits | 2015-02-25 | Paper |
