| 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
Computability | 2020-01-17 | Paper |
The reverse mathematics of Hindman's theorem for sums of exactly two elements
Computability | 2020-01-17 | Paper |
Coarse reducibility and algorithmic randomness
Journal of Symbolic Logic | 2017-04-28 | Paper |
Herrmann’s Beautiful Theorem on Computable Partial Orderings
Computability and Complexity | 2017-04-04 | Paper |
Effectiveness of Hindman’s Theorem for Bounded Sums
Computability and Complexity | 2017-04-04 | Paper |
Asymptotic density and the theory of computability: a partial survey
Computability and Complexity | 2017-04-04 | Paper |
On notions of computability-theoretic reduction between Π21 principles
Journal of Mathematical Logic | 2016-08-08 | Paper |
Asymptotic density, computable traceability, and 1-randomness
Fundamenta Mathematicae | 2016-07-08 | Paper |
Asymptotic density and the coarse computability bound
Computability | 2016-04-13 | Paper |
Asymptotic density and the Ershov hierarchy
Mathematical Logic Quarterly | 2015-06-22 | Paper |
Asymptotic density and the coarse computability bound
(available as arXiv preprint) | 2015-05-07 | Paper |
ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS
Journal of Mathematical Logic | 2014-03-10 | Paper |
Diagonally non-computable functions and bi-immunity
The Journal of Symbolic Logic | 2014-01-07 | Paper |
Generic computability, Turing degrees, and asymptotic density
Journal of the London Mathematical Society. Second Series | 2012-04-13 | Paper |
Binary subtrees with few labeled paths
Combinatorica | 2011-12-20 | Paper |
Corrigendum to: ``On the strength of Ramsey's theorem for pairs''
Journal of Symbolic Logic | 2010-01-07 | Paper |
Ramsey's theorem and cone avoidance
Journal of Symbolic Logic | 2009-06-04 | Paper |
Stability and posets
Journal of Symbolic Logic | 2009-06-04 | Paper |
Chains and antichains in partial orderings
Archive for Mathematical Logic | 2009-03-17 | Paper |
The Strength of Some Combinatorial Principles Related to Ramsey's Theorem for Pairs
(available as arXiv preprint) | 2008-10-20 | Paper |
Π<sub>1</sub><sup>0</sup> classes and strong degree spectra of relations
Journal of Symbolic Logic | 2007-10-17 | Paper |
Restricted jump interpolation in the d.c.e. degrees
Mathematical Structures in Computer Science | 2007-02-09 | Paper |
On self-embeddings of computable linear orderings
Annals of Pure and Applied Logic | 2005-12-29 | Paper |
| scientific article; zbMATH DE number 2236628 (Why is no real title available?) | 2005-12-08 | Paper |
A join theorem for the computably enumerable degrees
Transactions of the American Mathematical Society | 2004-08-13 | Paper |
Generalized r-cohesiveness and the arithmetical hierarchy: a correction to “Generalized cohesiveness”
Journal of Symbolic Logic | 2002-12-16 | Paper |
In memoriam: Joseph R. Shoenfield (1927--2000)
The Bulletin of Symbolic Logic | 2002-08-26 | Paper |
Ramsey's theorem for computably enumerable colorings
The Journal of Symbolic Logic | 2002-07-14 | Paper |
On the strength of Ramsey's theorem for pairs
The Journal of Symbolic Logic | 2002-01-09 | Paper |
| scientific article; zbMATH DE number 1531920 (Why is no real title available?) | 2001-03-11 | Paper |
Effective presentability of Boolean algebras of Cantor-Bendixson rank 1
Journal of Symbolic Logic | 1999-11-08 | Paper |
Generalized cohesiveness
Journal of Symbolic Logic | 1999-11-02 | Paper |
Difference sets and computability theory
Annals of Pure and Applied Logic | 1999-06-24 | Paper |
| scientific article; zbMATH DE number 1169397 (Why is no real title available?) | 1998-06-25 | Paper |
| scientific article; zbMATH DE number 841084 (Why is no real title available?) | 1996-11-04 | Paper |
Difference sets and inverting the difference operator
Combinatorica | 1996-06-23 | Paper |
Boolean algebras, Stone spaces, and the iterated Turing jump
Journal of Symbolic Logic | 1995-08-27 | Paper |
Weak presentations of computable fields
Journal of Symbolic Logic | 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
Journal of Symbolic Logic | 1993-10-24 | Paper |
On the <i>Σ</i><sub>2</sub>-theory of the upper semilattice of Turing degrees
Journal of Symbolic Logic | 1993-08-17 | Paper |
Countable thin ^0_1 classes
Annals of Pure and Applied Logic | 1993-05-16 | Paper |
A cohesive set which is not high
Mathematical Logic Quarterly | 1993-01-01 | Paper |
<i>Π</i><sub>0</sub><sup>1</sup>-classes and Rado's selection principle
Journal of Symbolic Logic | 1992-06-27 | Paper |
Degrees of orderings not isomorphic to recursive linear orderings
Annals of Pure and Applied Logic | 1991-01-01 | Paper |
| scientific article; zbMATH DE number 4172959 (Why is no real title available?) | 1990-01-01 | Paper |
| Jumps of Orderings | 1990-01-01 | Paper |
Weakly semirecursive sets
Journal of Symbolic Logic | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4135927 (Why is no real title available?) | 1989-01-01 | Paper |
Recursively enumerable sets modulo iterated jumps and extensions of Arslanov's completeness criterion
Journal of Symbolic Logic | 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 |
| scientific article; zbMATH DE number 3954889 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 4004171 (Why is no real title available?) | 1985-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
Journal of Symbolic Logic | 1984-01-01 | Paper |
Recursively enumerable sets and van der Waerden's theorem on arithmetic progressions
Pacific Journal of Mathematics | 1984-01-01 | Paper |
Pseudo Jump Operators. I: The R. E. Case
Transactions of the American Mathematical Society | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3739515 (Why is no real title available?) | 1981-01-01 | Paper |
Automorphism bases for degrees of unsolvability
Israel Journal of Mathematics | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3715539 (Why is no real title available?) | 1980-01-01 | Paper |
Fine Degrees of Word Problems of Cancellation Semigroups
Mathematical Logic Quarterly | 1980-01-01 | Paper |
Double jumps of minimal degrees
Journal of Symbolic Logic | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3619862 (Why is no real title available?) | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3532935 (Why is no real title available?) | 1977-01-01 | Paper |
Simple Proofs of Some Theorems on High Degrees of Unsolvability
Canadian Journal of Mathematics | 1977-01-01 | Paper |
Fixed points of jump preserving automorphisms of degrees
Israel Journal of Mathematics | 1977-01-01 | Paper |
A degree-theoretic definition of the ramified analytical hierarchy
Annals of Mathematical Logic | 1976-01-01 | Paper |
Completely Autoreducible Degrees
Mathematical Logic Quarterly | 1976-01-01 | Paper |
Recursiveness of initial segments of Kleene's O
Fundamenta Mathematicae | 1975-01-01 | Paper |
A lattice property of Post's simple set
Illinois Journal of Mathematics | 1975-01-01 | Paper |
Π<sub>1</sub><sup>0</sup> classes and Boolean combinations of recursively enumerable sets
Journal of Symbolic Logic | 1974-01-01 | Paper |
Upward closure and cohesive degrees
Israel Journal of Mathematics | 1973-01-01 | Paper |
Post's problem and his hypersimple set
Journal of Symbolic Logic | 1973-01-01 | Paper |
A Reducibility Arising from the Boone Groups.
MATHEMATICA SCANDINAVICA | 1973-01-01 | Paper |
Encodability of Kleene's <i>O</i>
Journal of Symbolic Logic | 1973-01-01 | Paper |
An application of Σ<sub>4</sub><sup>0</sup> determinacy to the degrees of unsolvability
Journal of Symbolic Logic | 1973-01-01 | Paper |
∏ 0 1 Classes and Degrees of Theories
Transactions of the American Mathematical Society | 1972-01-01 | Paper |
Ramsey's theorem and recursion theory
Journal of Symbolic Logic | 1972-01-01 | Paper |
Upward Closure of bi‐Immune Degrees
Mathematical Logic Quarterly | 1972-01-01 | Paper |
Degrees of members of \(\Pi_ 1^ 0\) classes
Pacific Journal of Mathematics | 1972-01-01 | Paper |
Degrees in Which the Recursive Sets are Uniformly Recursive
Canadian Journal of Mathematics | 1972-01-01 | Paper |
A minimal pair of Π<sub>1</sub><sup>0</sup> classes
Journal of Symbolic Logic | 1971-01-01 | Paper |
| Minimal Covers and Arithmetical Sets | 1970-01-01 | Paper |
| Relationships Between Reducibilities | 1969-01-01 | Paper |
The degrees of hyperhyperimmune sets
Journal of Symbolic Logic | 1969-01-01 | Paper |
The degrees of bi‐immune sets
Mathematical Logic Quarterly | 1969-01-01 | Paper |
Countable retracing functions and _2⁰ predicates
Pacific Journal of Mathematics | 1969-01-01 | Paper |
| Semirecursive Sets and Positive Reducibility | 1968-01-01 | Paper |
Uniformly introreducible sets
Journal of Symbolic Logic | 1968-01-01 | Paper |
