| Publication | Date of Publication | Type |
|---|
| Coarse computability, the density metric, Hausdorff distances between Turing degrees, perfect trees, and reverse mathematics | 2021-06-24 | 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 |
| COARSE REDUCIBILITY AND ALGORITHMIC RANDOMNESS | 2017-04-28 | Paper |
| Herrmann’s Beautiful Theorem on Computable Partial Orderings | 2017-04-04 | Paper |
| Effectiveness of Hindman’s Theorem for Bounded Sums | 2017-04-04 | Paper |
| Asymptotic Density and the Theory of Computability: A Partial Survey | 2017-04-04 | Paper |
| On notions of computability-theoretic reduction between Π21 principles | 2016-08-08 | Paper |
| Asymptotic density, computable traceability, and 1-randomness | 2016-07-08 | Paper |
| Asymptotic density and the coarse computability bound | 2016-04-13 | Paper |
| Asymptotic density and the Ershov hierarchy | 2015-06-22 | Paper |
| Asymptotic density and the coarse computability bound | 2015-05-07 | Paper |
| ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS | 2014-03-10 | Paper |
| Diagonally Non-Computable Functions and Bi-Immunity | 2014-01-07 | Paper |
| Generic computability, Turing degrees, and asymptotic density | 2012-04-13 | Paper |
| Binary subtrees with few labeled paths | 2011-12-20 | Paper |
| Corrigendum to: “On the strength of Ramsey's Theorem for pairs” | 2010-01-07 | Paper |
| Ramsey's theorem and cone avoidance | 2009-06-04 | Paper |
| Stability and posets | 2009-06-04 | Paper |
| Chains and antichains in partial orderings | 2009-03-17 | Paper |
| The Strength of Some Combinatorial Principles Related to Ramsey's Theorem for Pairs | 2008-10-20 | Paper |
| Π10 classes and strong degree spectra of relations | 2007-10-17 | Paper |
| Restricted jump interpolation in the d.c.e. degrees | 2007-02-09 | Paper |
| On self-embeddings of computable linear orderings | 2005-12-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5711879 | 2005-12-08 | Paper |
| A join theorem for the computably enumerable degrees | 2004-08-13 | Paper |
| Generalized r-cohesiveness and the arithmetical hierarchy: a correction to “Generalized cohesiveness” | 2002-12-16 | Paper |
| Richard A. Shore and Theodore A. Slaman. Defining the Turing jump. Mathematical research letters, vol. 6 (1999), pp. 711–722. | 2002-08-26 | Paper |
| Ramsey's theorem for computably enumerable colorings | 2002-07-14 | Paper |
| On the strength of Ramsey's theorem for pairs | 2002-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4513963 | 2001-03-11 | Paper |
| Effective presentability of Boolean algebras of Cantor-Bendixson rank 1 | 1999-11-08 | Paper |
| Generalized cohesiveness | 1999-11-02 | Paper |
| Difference sets and computability theory | 1999-06-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4397049 | 1998-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4863240 | 1996-11-04 | Paper |
| Difference sets and inverting the difference operator | 1996-06-23 | Paper |
| Boolean algebras, Stone spaces, and the iterated Turing jump | 1995-08-27 | Paper |
| Weak presentations of computable fields | 1995-06-08 | Paper |
| Every Low Boolean Algebra is Isomorphic to a Recursive One | 1995-01-02 | Paper |
| Decidability and undecidability of theories with a predicate for the primes | 1993-10-24 | Paper |
| On the Σ2-theory of the upper semilattice of Turing degrees | 1993-08-17 | Paper |
| Countable thin \(\Pi^0_1\) classes | 1993-05-16 | Paper |
| A cohesive set which is not high | 1993-01-01 | Paper |
| Π01-classes and Rado's selection principle | 1992-06-27 | Paper |
| Degrees of orderings not isomorphic to recursive linear orderings | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3197814 | 1990-01-01 | Paper |
| Weakly semirecursive sets | 1990-01-01 | Paper |
| Jumps of Orderings | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3469096 | 1989-01-01 | Paper |
| Recursively enumerable sets modulo iterated jumps and extensions of Arslanov's completeness criterion | 1989-01-01 | Paper |
| T-Degrees, Jump Classes, and Strong Reducibilities | 1987-01-01 | Paper |
| Embedding the Diamond Lattice in the Recursively Enumerable Truth-Table Degrees | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3724315 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3755447 | 1985-01-01 | Paper |
| Recursively enumerable sets and van der Waerden's theorem on arithmetic progressions | 1984-01-01 | Paper |
| An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees | 1984-01-01 | Paper |
| Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers | 1984-01-01 | Paper |
| Pseudo Jump Operators. I: The R. E. Case | 1983-01-01 | Paper |
| Automorphism bases for degrees of unsolvability | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3926563 | 1981-01-01 | Paper |
| Fine Degrees of Word Problems of Cancellation Semigroups | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3905267 | 1980-01-01 | Paper |
| Double jumps of minimal degrees | 1978-01-01 | Paper |
| Fixed points of jump preserving automorphisms of degrees | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4109662 | 1977-01-01 | Paper |
| Simple Proofs of Some Theorems on High Degrees of Unsolvability | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4182482 | 1977-01-01 | Paper |
| A degree-theoretic definition of the ramified analytical hierarchy | 1976-01-01 | Paper |
| Completely Autoreducible Degrees | 1976-01-01 | Paper |
| A lattice property of Post's simple set | 1975-01-01 | Paper |
| Recursiveness of initial segments of Kleene's O | 1975-01-01 | Paper |
| Π10 classes and Boolean combinations of recursively enumerable sets | 1974-01-01 | Paper |
| Upward closure and cohesive degrees | 1973-01-01 | Paper |
| Post's problem and his hypersimple set | 1973-01-01 | Paper |
| Encodability of Kleene's O | 1973-01-01 | Paper |
| An application of Σ40 determinacy to the degrees of unsolvability | 1973-01-01 | Paper |
| A Reducibility Arising from the Boone Groups. | 1973-01-01 | Paper |
| Degrees of members of \(\Pi_ 1^ 0\) classes | 1972-01-01 | Paper |
| Degrees in Which the Recursive Sets are Uniformly Recursive | 1972-01-01 | Paper |
| Upward Closure of bi‐Immune Degrees | 1972-01-01 | Paper |
| ∏ 0 1 Classes and Degrees of Theories | 1972-01-01 | Paper |
| Ramsey's theorem and recursion theory | 1972-01-01 | Paper |
| A minimal pair of Π10 classes | 1971-01-01 | Paper |
| Minimal Covers and Arithmetical Sets | 1970-01-01 | Paper |
| Countable retracing functions and \(\Pi_2^0\) predicates | 1969-01-01 | Paper |
| The degrees of hyperhyperimmune sets | 1969-01-01 | Paper |
| The degrees of bi‐immune sets | 1969-01-01 | Paper |
| Relationships Between Reducibilities | 1969-01-01 | Paper |
| Uniformly introreducible sets | 1968-01-01 | Paper |
| Semirecursive Sets and Positive Reducibility | 1968-01-01 | Paper |
