| Publication | Date of Publication | Type |
|---|
| The reverse mathematics of \textsf{CAC for trees} | 2024-11-25 | Paper |
| Milliken’s Tree Theorem and Its Applications: A Computability-Theoretic Perspective | 2024-02-20 | Paper |
| Carlson-Simpson's lemma and applications in reverse mathematics | 2023-07-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5039753 | 2022-10-04 | Paper |
| RAMSEY-LIKE THEOREMS AND MODULI OF COMPUTATION | 2022-04-12 | Paper |
| RELATIONSHIPS BETWEEN COMPUTABILITY-THEORETIC PROPERTIES OF PROBLEMS | 2022-04-12 | Paper |
| THE REVERSE MATHEMATICS OF THE THIN SET AND ERDŐS–MOSER THEOREMS | 2022-04-12 | Paper |
| Partition genericity and pigeonhole basis theorems | 2022-04-06 | Paper |
| The weakness of the pigeonhole principle under hyperarithmetical reductions | 2021-11-03 | Paper |
| Computing sets from all infinite subsets | 2021-10-21 | Paper |
| \( \mathsf{SRT}_2^2\) does not imply \(\mathsf{RT}_2^2\) in \(\omega \)-models | 2021-08-23 | Paper |
| COH, SRT 2 2 , and multiple functionals | 2021-06-25 | Paper |
| The reverse mathematics of the Thin set and Erd\H{o}s-Moser theorems | 2021-03-14 | Paper |
| Ramsey’s theorem and products in the Weihrauch degrees | 2020-11-09 | Paper |
| Some results concerning the SRT 2 2 vs. COH problem | 2020-11-09 | Paper |
| Thin set theorems and cone avoidance | 2020-03-02 | Paper |
| The Rado path decomposition theorem | 2019-12-17 | Paper |
| Pigeons do not jump high | 2019-07-19 | Paper |
| \({\Pi}_1^0\)-encodability and omniscient reductions | 2019-05-29 | Paper |
| SRT22 does not imply RT22 in omega-models | 2019-05-20 | Paper |
| COH, SRT22, and multiple functionals | 2019-05-01 | Paper |
| Partial orders and immunity in reverse mathematics | 2019-03-20 | Paper |
| Relationships between computability-theoretic properties of problems | 2019-03-11 | Paper |
| A computable analysis of variable words theorems | 2019-01-07 | Paper |
| The proof-theoretic strength of Ramsey's theorem for pairs and two colors | 2018-06-22 | Paper |
| On the logical strengths of partial solutions to mathematical problems | 2018-05-25 | Paper |
| Coloring the rationals in reverse mathematics | 2018-01-18 | Paper |
| Iterative forcing and hyperimmunity in reverse mathematics | 2017-11-22 | Paper |
| The reverse mathematics of non-decreasing subsequences | 2017-09-15 | Paper |
| Coloring trees in reverse mathematics | 2017-09-04 | Paper |
| Dominating the Erdős-Moser theorem in reverse mathematics | 2017-08-29 | Paper |
| OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS | 2017-05-26 | Paper |
| THE STRENGTH OF THE TREE THEOREM FOR PAIRS IN REVERSE MATHEMATICS | 2017-04-28 | Paper |
| Diagonally non-computable functions and fireworks | 2017-03-16 | Paper |
| Controlling iterated jumps of solutions to combinatorial problems | 2017-02-23 | Paper |
| The weakness of being cohesive, thin or free in reverse mathematics | 2017-01-11 | Paper |
| Ramsey’s theorem for singletons and strong computable reducibility | 2016-12-29 | Paper |
| Partial Orders and Immunity in Reverse Mathematics | 2016-08-17 | Paper |
| Pi01 encodability and omniscient reductions | 2016-03-03 | Paper |
| Ramsey-type graph coloring and diagonal non-computability | 2015-11-18 | Paper |
| Iterative Forcing and Hyperimmunity in Reverse Mathematics | 2015-10-20 | Paper |
| Degrees bounding principles and universal instances in reverse mathematics | 2015-08-21 | Paper |
| The complexity of satisfaction problems in reverse mathematics | 2015-07-01 | Paper |
| The Complexity of Satisfaction Problems in Reverse Mathematics | 2015-02-25 | Paper |
