| Publication | Date of Publication | Type |
|---|
| Milliken’s Tree Theorem and Its Applications: A Computability-Theoretic Perspective | 2024-02-20 | Paper |
| Extending properly n - REA sets1 | 2023-01-12 | Paper |
| Extending Properly n-REA Sets | 2021-07-02 | Paper |
| Some results concerning the SRT 2 2 vs. COH problem | 2020-11-09 | Paper |
| Realizing Computably Enumerable Degrees in Separating Classes | 2020-08-23 | Paper |
| Thin set theorems and cone avoidance | 2020-03-02 | Paper |
| The Rado path decomposition theorem | 2019-12-17 | Paper |
| Effective prime uniqueness | 2017-11-08 | Paper |
| DENSITY-1-BOUNDING AND QUASIMINIMALITY IN THE GENERIC DEGREES | 2017-09-26 | Paper |
| Any FIP real computes a 1-generic | 2017-05-23 | Paper |
| On Splits of Computably Enumerable Sets | 2017-04-04 | Paper |
| Computably enumerable sets that are automorphic to low sets | 2017-02-23 | Paper |
| Genericity for Mathias forcing over general Turing ideals | 2017-01-11 | Paper |
| -MAXIMAL SETS | 2016-03-22 | Paper |
| Generics for computable Mathias forcing | 2014-06-06 | Paper |
| Some recent research directions in the computably enumerable sets | 2013-12-20 | Paper |
| Computably Enumerable Partial Orders | 2013-01-30 | Paper |
| On Mathias Generic Sets | 2012-08-14 | Paper |
| On \(n\)-tardy sets | 2012-07-11 | Paper |
| Reverse mathematics and infinite traceable graphs | 2012-02-29 | Paper |
| On the orbits of computably enumerable sets | 2010-11-19 | Paper |
| Corrigendum to: “On the strength of Ramsey's Theorem for pairs” | 2010-01-07 | Paper |
| The Complexity of Orbits of Computably Enumerable Sets | 2008-05-08 | Paper |
| Strong jump-traceability. I: The computably enumerable case | 2008-03-05 | Paper |
| Extension theorems, orbits, and automorphisms of the computably enumerable sets | 2008-01-21 | Paper |
| Uniform almost everywhere domination | 2006-11-29 | Paper |
| A computably stable structure with no Scott family of finitary formulas | 2006-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5483300 | 2006-08-16 | Paper |
| On the Orbits of Computably Enumerable Sets | 2006-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5711879 | 2005-12-08 | Paper |
| Reverse mathematics and the equivalence of definitions for well and better quasi-orders | 2005-08-29 | Paper |
| INVARIANCE AND NONINVARIANCE IN THE LATTICE OF $\Pi_1^0$ CLASSES | 2005-03-11 | Paper |
| Isomorphisms of splits of computably enumerable sets | 2005-02-09 | Paper |
| Maximal contiguous degrees | 2003-03-22 | Paper |
| An almost deep degree | 2002-09-05 | Paper |
| On the strength of Ramsey's theorem for pairs | 2002-01-09 | Paper |
| Definable Encodings in the Computably Enumerable Sets | 2002-01-09 | Paper |
| ON THE DEFINABILITY OF THE DOUBLE JUMP IN THE COMPUTABLY ENUMERABLE SETS | 2002-01-01 | Paper |
| Automorphisms of the lattice of $\Pi _1^0$ classes; perfect thin classes and anc degrees | 2001-10-21 | Paper |
| Some orbits for \({\mathcal E}\) | 2001-09-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4513964 | 2001-04-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4318639 | 2000-06-21 | Paper |
| Atomless \(r\)-maximal sets | 2000-02-14 | Paper |
| Computably categorical structures and expansions by constants | 2000-01-09 | Paper |
| The dense simple sets are orbit complete with respect to the simple sets | 1999-11-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4381407 | 1998-10-19 | Paper |
| Permitting, forcing, and copying of a given recursive relation | 1997-10-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4764103 | 1995-09-11 | Paper |
| Permutations and Presentations | 1995-07-27 | Paper |
| Iterated relative recursive enumerability | 1995-04-20 | Paper |
| Automorphisms of the lattice of recursively enumerable sets | 1995-04-11 | Paper |
| Recursively Enumerable m - and tt -Degrees III: Realizing all Finite Distributive Lattices | 1995-04-06 | Paper |
| The translation theorem | 1994-07-07 | Paper |
| Lattice nonembeddings and intervals of the recursively enumerable degrees | 1994-03-10 | Paper |
| On the Cantor-Bendixon rank of recursively enumerable sets | 1993-10-24 | Paper |
| Automorphisms of the Lattice of Recursively Enumerable Sets: Promptly Simple Sets | 1993-01-16 | Paper |
| Boolean algebras and orbits of the lattice of r.e sets modulo the finite sets | 1990-01-01 | Paper |
