| Publication | Date of Publication | Type |
|---|
| Capacitability for Co-Analytic Sets | 2022-08-02 | Paper |
| IN MEMORIAM: GERALD E. SACKS, 1933–2019 | 2022-04-04 | Paper |
| Effective randomness for continuous measures | 2022-03-07 | Paper |
| Fragments of the theory of the enumeration degrees | 2021-04-23 | Paper |
| Definable functions on degrees | 2020-03-09 | Paper |
| Martin's conjecture, arithmetic equivalence, and countable Borel equivalence relations | 2020-03-09 | Paper |
| Recursion theoretic papers. Introduction to Part VI | 2020-03-09 | Paper |
| Schmerl decompositions in first order arithmetic | 2019-10-07 | Paper |
| THE STRENGTH OF RAMSEY’S THEOREM FOR PAIRS AND ARBITRARILY MANY COLORS | 2019-01-04 | Paper |
| Effective Randomness for Continuous Measures | 2018-08-29 | Paper |
| Irrationality exponent, Hausdorff dimension and effectivization | 2018-02-12 | Paper |
| The $\Delta ^0_2$ Turing degrees: Automorphisms and Definability | 2017-12-01 | Paper |
| On the construction of absolutely normal numbers | 2017-11-30 | Paper |
| The enumeration degrees: Local and global structural interactions | 2017-08-30 | Paper |
| $$\Sigma _{1}^{1}$$ in Every Real in a $$\Sigma _{1}^{1}$$ Class of Reals Is $$\Sigma _{1}^{1}$$ | 2017-04-04 | Paper |
| On absolutely normal numbers and their discrepancy estimate | 2017-02-13 | Paper |
| The inductive strength of Ramsey's theorem for pairs | 2017-02-03 | Paper |
| The irrationality exponents of computable numbers | 2016-03-03 | Paper |
| On simply normal numbers to different bases | 2016-02-10 | Paper |
| On the existence of a strong minimal pair | 2015-08-14 | Paper |
| A computable absolutely normal Liouville number | 2015-08-13 | Paper |
| Measures and their random reals | 2015-04-22 | Paper |
| ORACLE QUESTIONS | 2015-03-16 | Paper |
| On zeros of Martin-Löf random Brownian motion | 2015-01-22 | Paper |
| On the normality of numbers to different bases | 2014-10-15 | Paper |
| A note on initial segments of the enumeration degrees | 2014-09-30 | Paper |
| The metamathematics of Stable Ramsey’s Theorem for Pairs | 2014-09-19 | Paper |
| Generics for computable Mathias forcing | 2014-06-06 | Paper |
| Normal numbers and the Borel hierarchy | 2014-05-19 | Paper |
| A polynomial-time algorithm for computing absolutely normal numbers | 2013-12-13 | Paper |
| Relative to any non-hyperarithmetic set | 2013-10-17 | Paper |
| K-TRIVIALS ARE NEVER CONTINUOUSLY RANDOM | 2013-06-03 | Paper |
| Random reals, the rainbow Ramsey theorem, and arithmetic conservation | 2013-04-23 | Paper |
| The \(n\)-r.e. degrees: undecidability and \(\Sigma_1\) substructures | 2012-09-06 | Paper |
| \(\varPi^1_1\)-conservation of combinatorial principles weaker than Ramsey's theorem for pairs | 2012-07-20 | Paper |
| The Slaman-Wehner theorem in higher recursion theory | 2011-05-27 | Paper |
| The theory of the \(\alpha \) degrees is undecidable | 2010-12-06 | Paper |
| Corrigendum to: “On the strength of Ramsey's Theorem for pairs” | 2010-01-07 | Paper |
| The atomic model theorem and type omitting | 2009-11-06 | Paper |
| Low upper bounds of ideals | 2009-06-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3597424 | 2009-02-09 | Paper |
| K-trivials are NCR | 2008-12-08 | Paper |
| The Strength of Some Combinatorial Principles Related to Ramsey's Theorem for Pairs | 2008-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3530389 | 2008-10-20 | Paper |
| Turing incomparability in Scott sets | 2007-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5295696 | 2007-07-30 | Paper |
| Probability Measures and Effective Randomness | 2007-07-10 | Paper |
| Some results on effective randomness | 2006-10-16 | Paper |
| \(\Pi^0_1\)-presentations of algebras | 2006-09-26 | Paper |
| THE THEORY OF THE METARECURSIVELY ENUMERABLE DEGREES | 2006-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5477365 | 2006-07-03 | Paper |
| ON EXTENSIONS OF EMBEDDINGS INTO THE ENUMERATION DEGREES OF THE ${\Sigma_2^0}$-SETS | 2006-04-06 | Paper |
| Decidability of the Natural Numbers with the Almost-All Quantifier | 2006-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5316382 | 2005-09-12 | Paper |
| COMPUTABLY ENUMERABLE ALGEBRAS, THEIR EXPANSIONS, AND ISOMORPHISMS | 2005-09-12 | Paper |
| Comparing DNR and WWKL | 2005-08-29 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| Differences between resource bounded degree structures | 2005-07-13 | Paper |
| Σ_{𝑛}-bounding and Δ_{𝑛}-induction | 2004-08-13 | Paper |
| Every Set has a Least Jump Enumeration | 2002-10-22 | Paper |
| An almost deep degree | 2002-09-05 | Paper |
| Randomness and recursive enumerability | 2002-04-23 | Paper |
| Extension of embeddings in the computably enumerable degrees | 2002-02-14 | Paper |
| On the strength of Ramsey's theorem for pairs | 2002-01-09 | Paper |
| A splitting theorem for \(n\)-REA degrees | 2001-10-21 | Paper |
| \(\Sigma_2\) induction and infinite injury priority arguments. III: Prompt sets, minimal pairs and Shoenfield's conjecture | 2001-07-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4513978 | 2001-06-13 | Paper |
| Recursive in a generic real | 2001-05-10 | Paper |
| \(\Pi_1^0\) classes and minimal degrees | 2001-01-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4934280 | 2000-09-20 | Paper |
| Quasi-minimal enumeration degrees and minimal Turing degrees | 2000-08-20 | Paper |
| Defining the Turing jump | 2000-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4247033 | 1999-09-19 | Paper |
| Extending partial orders to dense linear orders | 1999-06-24 | Paper |
| On a question of Sierpiński | 1999-06-03 | Paper |
| Relative enumerability in the difference hierarchy | 1999-04-27 | Paper |
| Definability in the enumeration degrees | 1999-02-04 | Paper |
| A Basis Theorem for Perfect Sets | 1998-10-07 | Paper |
| The $\Pi _3$-theory of the computably enumerable Turing degrees is undecidable | 1998-09-10 | Paper |
| Interpretability and Definability in the Recursively Enumerable Degrees | 1998-08-11 | Paper |
| Relative to any nonrecursive set | 1998-05-06 | Paper |
| The Π20 enumeration degrees are not dense | 1997-11-05 | Paper |
| Definability in the Recursively Enumerable Degrees | 1997-11-05 | Paper |
| Automorphisms in the PTIME-Turing degrees of recursive sets | 1997-06-12 | Paper |
| The Sacks density theorem and Σ2-bounding | 1997-03-19 | Paper |
| On the strength of Ramsey's theorem | 1996-05-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4863246 | 1996-04-22 | Paper |
| Algebraic aspects of the computably enumerable degrees. | 1995-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4314795 | 1995-04-03 | Paper |
| Extremes in the degrees of inferability | 1994-05-03 | Paper |
| Working below a high recursively enumerable degree | 1994-01-19 | Paper |
| On the Σ2-theory of the upper semilattice of Turing degrees | 1993-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4011117 | 1992-09-27 | Paper |
| The p-T-degrees of the recursive sets: Lattice embeddings, extensions of embeddings and the two-quantifier theory | 1992-09-27 | Paper |
| On co-simple isols and their intersection types | 1992-09-27 | Paper |
| The complexity types of computable sets | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4010363 | 1992-09-27 | Paper |
| Jump embeddings in the Turing degrees | 1992-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3974876 | 1992-06-26 | Paper |
| The density of infima in the recursively enumerable degrees | 1991-01-01 | Paper |
| On the theory of the PTIME degrees of the recursive sets | 1990-01-01 | Paper |
| Working below a \(low_ 2\) recursively enumerable degree | 1990-01-01 | Paper |
| Generalized Hyperarithmetic Theory | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3487328 | 1990-01-01 | Paper |
| Generic copies of countable structures | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3480037 | 1989-01-01 | Paper |
| Complementation in the Turing degrees | 1989-01-01 | Paper |
| Completely mitotic r. e. degrees | 1989-01-01 | Paper |
| A limit on relative genericity in the recursively enumerable sets | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3032239 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4204139 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3835449 | 1989-01-01 | Paper |
| Σ2-collection and the infinite injury priority method | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3832563 | 1988-01-01 | Paper |
| Inadmissible forcing | 1987-01-01 | Paper |
| Definability in the Turing degrees | 1986-01-01 | Paper |
| Σ1 definitions with parameters | 1986-01-01 | Paper |
| On the Kleene degrees of Π11 sets | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3691658 | 1985-01-01 | Paper |
| Reflection and forcing in E-recursion theory | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3691657 | 1985-01-01 | Paper |
| Independence Results on the Global Structure of the Turing Degrees | 1983-01-01 | Paper |
| The extended plus-one hypothesis—A relative consistency result | 1983-01-01 | Paper |
| Learning Equivalence Relations on Polish Spaces | N/A | Paper |
