| Publication | Date of Publication | Type |
|---|
| Thin set versions of Hindman's theorem | 2022-12-19 | Paper |
| Reduction games, provability and compactness | 2022-12-13 | Paper |
| Thin Set Versions of Hindman's Theorem | 2022-03-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5022896 | 2022-01-19 | Paper |
| A Feiner Look at the Intermediate Degrees | 2021-10-12 | Paper |
| Coarse computability, the density metric, Hausdorff distances between Turing degrees, perfect trees, and reverse mathematics | 2021-06-24 | 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 |
| Combinatorial principles equivalent to weak induction | 2020-11-09 | Paper |
| Reduction games, provability, and compactness | 2020-08-03 | Paper |
| A MINIMAL PAIR IN THE GENERIC DEGREES | 2020-04-17 | Paper |
| Dense computability, upper cones, and minimal pairs | 2020-01-17 | Paper |
| The reverse mathematics of Hindman’s Theorem for sums of exactly two elements | 2020-01-17 | Paper |
| Computability and Randomness | 2019-10-28 | Paper |
| Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem | 2017-10-10 | Paper |
| COARSE REDUCIBILITY AND ALGORITHMIC RANDOMNESS | 2017-04-28 | Paper |
| Some Questions in Computable Mathematics | 2017-04-04 | Paper |
| On notions of computability-theoretic reduction between Π21 principles | 2016-08-08 | Paper |
| Asymptotic density and the coarse computability bound | 2016-04-13 | Paper |
| Counting the changes of random Δ20 sets | 2016-01-28 | Paper |
| Asymptotic density and the coarse computability bound | 2015-05-07 | Paper |
| Categoricity properties for computable algebraic fields | 2015-04-22 | Paper |
| Slicing the Truth | 2014-09-24 | Paper |
| Trivial Reals | 2013-04-19 | Paper |
| Finitely presented expansions of computably enumerable semigroups | 2013-02-21 | Paper |
| Finite Self-Information | 2013-01-30 | Paper |
| Characterizing the strongly jump-traceable sets via randomness | 2012-10-16 | Paper |
| Algorithmic Randomness and Complexity | 2010-10-14 | Paper |
| Counting the Changes of Random ${\Delta^0_2}$ Sets | 2010-07-29 | Paper |
| The atomic model theorem and type omitting | 2009-11-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3530395 | 2008-10-20 | Paper |
| The Strength of Some Combinatorial Principles Related to Ramsey's Theorem for Pairs | 2008-10-20 | Paper |
| Order-computable sets | 2008-02-05 | Paper |
| Subspaces of computable vector spaces | 2007-10-17 | Paper |
| Π10 classes and strong degree spectra of relations | 2007-10-17 | Paper |
| Using random sets as oracles | 2007-09-27 | Paper |
| Undecidability of the structure of the Solovay degrees of c.e. reals | 2007-05-30 | Paper |
| Combinatorial principles weaker than Ramsey's Theorem for pairs | 2007-03-12 | Paper |
| Bounding homogenous models | 2007-03-12 | Paper |
| Every 1-generic computes a properly 1-generic | 2007-01-19 | Paper |
| Calibrating Randomness | 2006-12-06 | Paper |
| An uncountably categorical theory whose only computably presentable model is saturated | 2006-10-04 | Paper |
| RELATIVIZING CHAITIN'S HALTING PROBABILITY | 2006-04-06 | Paper |
| Computable trees, prime models, and relative decidability | 2006-02-17 | Paper |
| New Computational Paradigms | 2006-01-11 | Paper |
| Bounding prime models | 2005-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4677706 | 2005-05-12 | Paper |
| A computably categorical structure whose expansion by a constant has infinite computable dimension | 2005-02-09 | Paper |
| Randomness and reducibility | 2004-09-08 | Paper |
| Realizing levels of the hyperarithmetic hierarchy as degree spectra of relations on computable structures | 2004-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4460833 | 2004-03-29 | Paper |
| Computability-theoretic and proof-theoretic aspects of partial and linear orderings | 2004-03-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4451642 | 2004-02-29 | Paper |
| Degree spectra of relations on computable structures in the presence of Δ20isomorphisms | 2002-12-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4779154 | 2002-11-25 | Paper |
| Degree spectra and computable dimensions in algebraic structures | 2002-08-22 | Paper |
| Degree spectra of relations on structures of finite computable dimension | 2002-08-22 | Paper |
| A Δ20 set with no infinite low subset in either it or its complement | 2002-07-18 | Paper |
| Degree spectra of intrinsically c.e. relations | 2002-05-15 | Paper |
| Randomness, Computability, and Density | 2002-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2762505 | 2002-01-09 | Paper |
| Undecidability and 1-types in intervals of the computably enumerable degrees | 2001-10-23 | Paper |
| Degree Spectra of Relations on Computable Structures | 2001-09-11 | Paper |
| Prime models of theories of computable linear orderings | 2001-07-05 | Paper |
