| Publication | Date of Publication | Type |
|---|
| The Ginsburg-Sands theorem and computability theory | 2024-04-24 | Paper |
| Milliken’s Tree Theorem and Its Applications: A Computability-Theoretic Perspective | 2024-02-20 | Paper |
| The tree pigeonhole principle in the Weihrauch degrees | 2023-12-16 | Paper |
| On the first-order parts of problems in the Weihrauch degrees | 2023-01-30 | Paper |
| Reduction games, provability and compactness | 2022-12-13 | Paper |
| Reverse Mathematics | 2022-08-11 | Paper |
| Effectiveness for the dual Ramsey theorem | 2022-02-14 | Paper |
| COH, SRT 2 2 , and multiple functionals | 2021-06-25 | 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 |
| Reduction games, provability, and compactness | 2020-08-03 | Paper |
| THE DETERMINED PROPERTY OF BAIRE IN REVERSE MATH | 2020-04-17 | Paper |
| The reverse mathematics of Hindman’s Theorem for sums of exactly two elements | 2020-01-17 | Paper |
| Joins in the strong Weihrauch degrees | 2019-10-30 | Paper |
| A NOTE ON THE REVERSE MATHEMATICS OF THE SORITES | 2019-06-07 | Paper |
| COH, SRT22, and multiple functionals | 2019-05-01 | Paper |
| The complexity of primes in computable unique factorization domains | 2018-05-18 | Paper |
| Effectiveness for the Dual Ramsey Theorem | 2017-09-29 | Paper |
| Coloring trees in reverse mathematics | 2017-09-04 | Paper |
| The uniform content of partial and linear orders | 2017-08-29 | Paper |
| Robert I. Soare, Turing Computability, Theory and Applications of Computability, Springer-Verlag, Berlin, Heidelberg, 2016, xxxvi + 263 pp. | 2017-07-21 | Paper |
| Notions of robust information coding | 2017-07-21 | Paper |
| Limits to joining with generics and randoms | 2017-05-31 | Paper |
| STRONG REDUCTIONS BETWEEN COMBINATORIAL PRINCIPLES | 2017-04-28 | Paper |
| Effectiveness of Hindman’s Theorem for Bounded Sums | 2017-04-04 | Paper |
| Genericity for Mathias forcing over general Turing ideals | 2017-01-11 | Paper |
| Ramsey’s theorem for singletons and strong computable reducibility | 2016-12-29 | Paper |
| A note on the reverse mathematics of the sorites | 2016-10-01 | Paper |
| On uniform relationships between combinatorial problems | 2016-03-29 | Paper |
| Classificatory Sorites, Probabilistic Supervenience, and Rule-Making | 2015-02-03 | Paper |
| Cohesive avoidance and strong reductions | 2015-01-30 | Paper |
| Generics for computable Mathias forcing | 2014-06-06 | Paper |
| On the strength of the finite intersection principle | 2013-11-01 | Paper |
| Computably Enumerable Partial Orders | 2013-01-30 | Paper |
| On uniform relationships between combinatorial problems | 2012-12-01 | Paper |
| On Mathias Generic Sets | 2012-08-14 | Paper |
| Reverse mathematics and properties of finite character | 2012-07-11 | Paper |
| The equivalence of two ways of computing distances from dissimilarities for arbitrary sets of stimuli | 2011-12-28 | Paper |
| Infinite saturated orders | 2011-08-16 | Paper |
| Stable Ramsey's theorem and measure | 2011-03-07 | Paper |
| Reverse mathematics and equivalents of the axiom of choice | 2010-09-16 | Paper |
| \(\Pi_1^0\) classes, Peano arithmetic, randomness, and computable domination | 2010-06-11 | Paper |
| Ramsey's theorem for trees: the polarized tree theorem and notions of stability | 2010-04-15 | Paper |
| Ramsey's theorem and cone avoidance | 2009-06-04 | Paper |
| The polarized Ramsey's theorem | 2009-04-27 | Paper |
| Definitions of finiteness based on order properties | 2006-03-14 | Paper |
