| Publication | Date of Publication | Type |
|---|
| Enumerations of families closed under finite differences | 2024-04-15 | Paper |
| Iterated Priority Arguments in Descriptive Set Theory | 2022-11-15 | Paper |
| An Effective Classification of Borel Wadge Classes | 2022-11-15 | Paper |
| Algebraic Curves and Riemann Surfaces for Undergraduates | 2022-09-06 | Paper |
| Completeness of the hyperarithmetic isomorphism equivalence relation | 2022-05-31 | Paper |
| Cousin’s lemma in second-order arithmetic | 2022-04-27 | Paper |
| RELATIONSHIPS BETWEEN COMPUTABILITY-THEORETIC PROPERTIES OF PROBLEMS | 2022-04-12 | Paper |
| SCOTT COMPLEXITY OF COUNTABLE STRUCTURES | 2022-01-17 | Paper |
| Highness properties close to PA completeness | 2021-12-01 | Paper |
| Maximality and collapse in the hierarchy of α-c.a. degrees | 2021-11-18 | Paper |
| Computing sets from all infinite subsets | 2021-10-21 | Paper |
| Hierarchy of Computably Enumerable Degrees II | 2021-09-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5004971 | 2021-08-03 | Paper |
| Non-density in punctual computability | 2021-07-26 | Paper |
| Many forcing axioms for all regular uncountable cardinals | 2021-07-12 | Paper |
| Cousin's lemma in second-order arithmetic | 2021-05-06 | Paper |
| Bad oracles in higher computability and randomness | 2021-04-29 | Paper |
| PUNCTUAL CATEGORICITY AND UNIVERSALITY | 2021-04-15 | Paper |
| CUPPING AND JUMP CLASSES IN THE COMPUTABLY ENUMERABLE DEGREES | 2021-04-15 | Paper |
| Realizing Computably Enumerable Degrees in Separating Classes | 2020-08-23 | Paper |
| Computing from projections of random points | 2020-06-26 | Paper |
| A Hierarchy of Turing Degrees | 2020-03-09 | Paper |
| Cardinal invariants, non-lowness classes, and Weihrauch reducibility | 2020-01-17 | Paper |
| Relationships between computability-theoretic properties of problems | 2019-03-11 | Paper |
| Effectively closed subgroups of the infinite symmetric group | 2018-10-23 | Paper |
| STRONG JUMP-TRACEABILITY | 2018-08-13 | Paper |
| UNIFORM PROCEDURES IN UNCOUNTABLE STRUCTURES | 2018-08-10 | Paper |
| Two more characterizations of \(K\)-triviality | 2018-05-18 | Paper |
| A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES | 2018-05-03 | Paper |
| Finding bases of uncountable free abelian groups is usually difficult | 2018-03-28 | Paper |
| HIGHER RANDOMNESS AND GENERICITY | 2017-12-19 | Paper |
| Dimension 1 sequences are close to randoms | 2017-11-16 | Paper |
| The finite intersection principle and genericity | 2017-09-28 | Paper |
| Martin-L\"of reducibility and cost functions | 2017-07-02 | Paper |
| Continuous higher randomness | 2017-06-20 | Paper |
| A van Lambalgen theorem for Demuth randomness | 2017-05-31 | Paper |
| Proper divisibility in computable rings | 2017-01-16 | Paper |
| Generic Muchnik reducibility and presentations of fields | 2017-01-11 | Paper |
| DNR AND INCOMPARABLE TURING DEGREES | 2016-05-11 | Paper |
| Coherent randomness tests and computing the \(K\)-trivial sets | 2016-05-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3464657 | 2016-01-27 | Paper |
| COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS I: COMPUTABLE CATEGORICITY | 2015-05-20 | Paper |
| COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS II: DEGREE SPECTRA | 2015-05-20 | Paper |
| DNR and incomparable Turing degrees | 2015-04-10 | Paper |
| Inherent enumerability of strong jump-traceability | 2015-02-02 | Paper |
| COMPUTINGK-TRIVIAL SETS BY INCOMPLETE RANDOM SETS | 2014-10-21 | Paper |
| CHARACTERIZING LOWNESS FOR DEMUTH RANDOMNESS | 2014-09-30 | Paper |
| Models of Cohen measurability | 2014-07-07 | Paper |
| Strong jump-traceability and Demuth randomness | 2014-04-25 | Paper |
| Anti-Complex Sets and Reducibilities with Tiny Use | 2014-04-04 | Paper |
| Joining non-low C.E. sets with diagonally non-computable functions | 2014-04-01 | Paper |
| Strong jump-traceability. II: \(K\)-triviality | 2013-11-01 | Paper |
| RELATIVE TO ANY NON-HYPERARITHMETIC SET | 2013-10-17 | Paper |
| Natural Large Degree Spectra | 2013-10-10 | Paper |
| Martin-Löf random points satisfy Birkhoff’s ergodic theorem for effectively closed sets | 2013-09-03 | Paper |
| Extensions of embeddings below computably enumerable degrees | 2013-07-08 | Paper |
| K-TRIVIALS ARE NEVER CONTINUOUSLY RANDOM | 2013-06-03 | Paper |
| Galvin's ``racing pawns game, internal hyperarithmetic comprehension, and the law of excluded middle | 2013-04-25 | Paper |
| Pseudo-jump inversion, upper cone avoidance, and strong jump-traceability | 2013-04-16 | Paper |
| Characterizing the strongly jump-traceable sets via randomness | 2012-10-16 | Paper |
| Binary subtrees with few labeled paths | 2011-12-20 | Paper |
| Pseudo-jump inversion and SJT-hard sets | 2011-09-30 | Paper |
| Diagonally non-recursive functions and effective Hausdorff dimension | 2011-08-16 | Paper |
| A random set which only computes strongly jump-traceable c.e. sets | 2011-06-28 | Paper |
| The Slaman-Wehner theorem in higher recursion theory | 2011-05-27 | Paper |
| Benign cost functions and lowness properties | 2011-03-18 | Paper |
| Turing degrees of reals of positive effective packing dimension | 2010-06-09 | Paper |
| Working with strong reducibilities above totally $\omega $-c.e. and array computable degrees | 2010-03-08 | Paper |
| Lowness for Kurtz randomness | 2009-06-04 | Paper |
| 𝐾-trivial degrees and the jump-traceability hierarchy | 2009-05-27 | Paper |
| The upward closure of a perfect thin class | 2008-12-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3530392 | 2008-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3530393 | 2008-10-20 | Paper |
| TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES | 2008-08-26 | Paper |
| Strong jump-traceability. I: The computably enumerable case | 2008-03-05 | Paper |
| Ranked structures and arithmetic transfinite recursion | 2008-01-21 | Paper |
| Theory and Applications of Models of Computation | 2007-04-30 | Paper |
| Every 1-generic computes a properly 1-generic | 2007-01-19 | Paper |
| Uniform almost everywhere domination | 2006-11-29 | Paper |
| Models of real-valued measurability | 2006-09-14 | Paper |
| THE THEORY OF THE METARECURSIVELY ENUMERABLE DEGREES | 2006-09-04 | Paper |
| The role of true finiteness in the admissible recursively enumerable degrees | 2006-06-06 | Paper |
| The Role of True Finiteness in the Admissible Recursively Enumerable Degrees | 2006-02-08 | Paper |
| Generalized high degrees have the complementation property | 2005-08-29 | Paper |
| Embedding and coding below a 1-generic degree | 2005-07-06 | Paper |
