| Publication | Date of Publication | Type |
|---|
| SOME CONSEQUENCES OF AND | 2023-12-22 | Paper |
| LUZIN’S (N) AND RANDOMNESS REFLECTION | 2022-06-15 | Paper |
| TD implies \(\operatorname{CC}_{\mathbb{R}} \) | 2021-10-27 | Paper |
| AN APPLICATION OF RECURSION THEORY TO ANALYSIS | 2021-01-05 | Paper |
| TD implies CCR | 2020-12-17 | Paper |
| Luzin's (N) and randomness reflection | 2020-06-12 | Paper |
| CHAITIN’S Ω AS A CONTINUOUS FUNCTION | 2020-04-17 | Paper |
| BEING LOW ALONG A SEQUENCE AND ELSEWHERE | 2020-04-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4630794 | 2019-04-23 | Paper |
| BASIS THEOREMS FOR -SETS | 2019-03-15 | Paper |
| A model with everything except for a well-ordering of the reals | 2018-09-27 | Paper |
| Hamel bases and well–ordering the continuum | 2018-06-04 | Paper |
| Degree Spectra of Equivalence Relations | 2017-06-09 | Paper |
| On the Reals Which Cannot Be Random | 2017-04-04 | Paper |
| Measure-theoretic applications of higher Demuth’s Theorem | 2016-09-22 | Paper |
| On Martin’s pointed tree theorem | 2016-07-25 | Paper |
| RANDOMNESS IN THE HIGHER SETTING | 2016-03-22 | Paper |
| A reducibility related to being hyperimmune-free | 2015-06-17 | Paper |
| Recursion theory. Computational aspects of definability | 2015-03-10 | Paper |
| Cofinal maximal chains in the Turing degrees | 2014-03-13 | Paper |
| Characterizing strong randomness via Martin-Löf randomness | 2012-04-13 | Paper |
| Descriptive set theoretical complexity of randomness notions | 2011-11-24 | Paper |
| A New Proof of Friedman's Conjecture | 2011-10-11 | Paper |
| Maximal pairs of c.e. reals in the computably Lipschitz degrees | 2011-09-12 | Paper |
| Higher Kurtz randomness | 2011-08-26 | Paper |
| Relativizations of randomness and genericity notions | 2011-08-16 | Paper |
| Oscillation in the initial segment complexity of random reals | 2011-03-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3567853 | 2010-06-17 | Paper |
| The strength of the projective Martin conjecture | 2010-04-09 | Paper |
| Bounding non-GL2 and R.E.A. | 2009-09-29 | Paper |
| A Π¹₁-uniformization principle for reals | 2009-07-23 | Paper |
| Lowness of higher randomness notions | 2008-10-16 | Paper |
| On initial segment complexity and degrees of randomness | 2008-06-17 | Paper |
| Maximal chains in the Turing degrees | 2008-02-25 | Paper |
| Thin Maximal Antichains in the Turing Degrees | 2007-11-13 | Paper |
| Theory and Applications of Models of Computation | 2007-04-30 | Paper |
| Theory and Applications of Models of Computation | 2007-04-30 | Paper |
| An extension of Harrington's noncupping theorem | 2007-02-20 | Paper |
| When van Lambalgen’s Theorem fails | 2007-02-01 | Paper |
| On Σ1-Structural Differences Among Finite Levels of the Ershov Hierarchy | 2007-01-19 | Paper |
| Measure theory aspects of locally countable orderings | 2006-11-29 | Paper |
| Lowness and nullsets | 2006-11-29 | Paper |
| Arithmetical Sacks forcing | 2006-09-26 | Paper |
| Lowness for genericity | 2006-03-21 | Paper |
| On the definable ideal generated by nonbounding c.e. degrees | 2006-02-08 | Paper |
| There is no SW-complete c.e. real | 2005-08-29 | Paper |
| There are no maximal low d.c.e. degrees | 2005-07-06 | Paper |
| Infimum properties differ in the weak truth-table degrees and the Turing degrees | 2004-11-26 | Paper |
| The Kolmogorov complexity of random reals | 2004-11-22 | Paper |
| There are 2^{ℵ₀} many 𝐻-degrees in the random reals | 2004-08-13 | Paper |
