| Publication | Date of Publication | Type |
|---|
| Degrees of categoricity and treeable degrees | 2024-12-06 | Paper |
| On the c.e. degrees realizable in \(\Pi^0_1\) classes | 2024-11-25 | Paper |
| Effectiveness of Walker's cancellation theorem | 2024-11-22 | Paper |
| Effectiveness of Walker's Cancellation Theorem | 2023-09-04 | Paper |
| WHICH CLASSES OF STRUCTURES ARE BOTH PSEUDO-ELEMENTARY AND DEFINABLE BY AN INFINITARY SENTENCE? | 2023-03-20 | Paper |
| Every Δ20 degree is a strong degree of categoricity | 2022-12-13 | Paper |
| Degrees of categoricity and treeable degrees | 2022-09-09 | Paper |
| Relations enumerable from positive information | 2022-06-02 | Paper |
| Positive enumerable functors | 2022-03-22 | Paper |
| SOME QUESTIONS OF UNIFORMITY IN ALGORITHMIC RANDOMNESS | 2022-01-17 | Paper |
| Some Questions of Uniformity in Algorithmic Randomness | 2021-11-02 | Paper |
| Positive enumerable functors | 2020-11-28 | Paper |
| Degrees of categoricity above limit ordinals | 2020-11-09 | Paper |
| Optimal bounds for single-source Kolmogorov extractors | 2020-02-26 | Paper |
| The reverse mathematics of Hindman’s Theorem for sums of exactly two elements | 2020-01-17 | Paper |
| Finite computable dimension and degrees of categoricity | 2018-11-07 | Paper |
| Which Classes of Structures Are Both Pseudo-elementary and Definable by an Infinitary Sentence? | 2018-08-05 | Paper |
| Bounded low and high sets | 2017-09-15 | Paper |
| DEGREES OF CATEGORICITY ON A CONE VIAη-SYSTEMS | 2017-06-01 | Paper |
| Degrees that are not degrees of categoricity | 2016-09-01 | Paper |
| Measuring complexities of classes of structures | 2015-09-29 | Paper |
| A bounded jump for the bounded Turing degrees | 2014-06-04 | Paper |
| Degrees of categoricity and the hyperarithmetic hierarchy | 2013-04-25 | Paper |
| Limits on jump inversion for strong reducibilities | 2011-12-23 | Paper |
| The complexity of central series in nilpotent computable groups | 2011-09-22 | Paper |
| Computability of Fraïssé limits | 2011-03-18 | Paper |
| Degree spectra and immunity properties | 2010-02-16 | Paper |
| The strength of the rainbow Ramsey Theorem | 2010-01-07 | Paper |
| Linear orders with distinguished function symbol | 2009-03-17 | Paper |
| The Settling Time Reducibility Ordering and Formula Sets | 2009-03-02 | Paper |
| When Is Reachability Intrinsically Decidable? | 2008-10-30 | Paper |
| Computable Categoricity of Graphs with Finite Components | 2008-06-19 | Paper |
| Comparing C.E. Sets Based on Their Settling Times | 2007-11-13 | Paper |
| The settling-time reducibility ordering | 2007-10-17 | Paper |
| Bounding homogenous models | 2007-03-12 | Paper |
| Computability Results Used in Differential Geometry | 2007-01-19 | Paper |
| Every 1-generic computes a properly 1-generic | 2007-01-19 | Paper |
| Boolean algebras, Tarski invariants, and index sets | 2006-10-04 | Paper |
| A minimal pair of 𝐾-degrees | 2006-02-17 | Paper |
| Bounding prime models | 2005-08-29 | Paper |
| Degree spectra of prime models | 2005-08-29 | Paper |
