| Publication | Date of Publication | Type |
|---|
| Complexity profiles and generic Muchnik reducibility | 2023-12-21 | Paper |
| Limit computability and ultrafilters | 2023-09-13 | Paper |
| ON THE STRUCTURE OF COMPUTABLE REDUCIBILITY ON EQUIVALENCE RELATIONS OF NATURAL NUMBERS | 2023-09-11 | Paper |
| EXPANDING THE REALS BY CONTINUOUS FUNCTIONS ADDS NO COMPUTATIONAL POWER | 2023-09-11 | Paper |
| INITIAL SEGMENTS OF THE DEGREES OF CEERS | 2022-08-29 | Paper |
| Computability and the Symmetric Difference Operator | 2022-07-22 | Paper |
| Investigating the computable Friedman-Stanley jump | 2022-06-23 | Paper |
| The first-order theory of the computably enumerable equivalence relations in the uncountable setting | 2022-02-08 | Paper |
| EFFECTIVE INSEPARABILITY, LATTICES, AND PREORDERING RELATIONS | 2022-02-07 | Paper |
| IS A SPECTRUM OF A NON-DISINTEGRATED FLAT STRONGLY MINIMAL MODEL COMPLETE THEORY IN A LANGUAGE WITH FINITE SIGNATURE | 2022-01-17 | Paper |
| Recursive spectra of flat strongly minimal theories | 2021-11-09 | Paper |
| The property “arithmetic-is-recursive” on a cone | 2021-11-03 | Paper |
| Self-full ceers and the uniform join operator | 2021-10-21 | Paper |
| Building models of strongly minimal theories | 2021-07-05 | Paper |
| Scattered sentences have few separable randomizations | 2020-07-17 | Paper |
| The theory of ceers computes true arithmetic | 2020-06-02 | Paper |
| ON ISOMORPHISM CLASSES OF COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS | 2020-04-17 | Paper |
| Joins and meets in the structure of ceers | 2020-01-17 | Paper |
| Characterizing the continuous degrees | 2019-12-17 | Paper |
| $[0,n\cup \{\omega\}$ is a spectrum of a non-disintegrated flat strongly minimal model complete theory in a language with finite signature] | 2019-08-25 | Paper |
| Independence in randomizations | 2019-07-08 | Paper |
| On cototality and the skip operator in the enumeration degrees | 2019-07-03 | Paper |
| Trial and error mathematics: Dialectical systems and completions of theories | 2019-03-01 | Paper |
| Effective inseparability, lattices, and pre-ordering relations | 2019-01-18 | Paper |
| Definable sets containing productsets in expansions of groups | 2019-01-09 | Paper |
| Hindman's theorem and idempotent types | 2018-12-21 | Paper |
| Strongly minimal theories with recursive models | 2018-06-21 | Paper |
| Jumps of computably enumerable equivalence relations | 2018-01-11 | Paper |
| Theory spectra and classes of theories | 2017-06-14 | Paper |
| THE COMPLEXITY OF INDEX SETS OF CLASSES OF COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS | 2017-04-28 | Paper |
| THE COMPLEMENTS OF LOWER CONES OF DEGREES AND THE DEGREE SPECTRA OF STRUCTURES | 2017-04-28 | Paper |
| A Survey on Universal Computably Enumerable Equivalence Relations | 2017-04-04 | Paper |
| Nondensity of Double Bubbles in the D.C.E. Degrees | 2017-04-04 | Paper |
| Algebraic Independence Relations in Randomizations | 2017-03-31 | Paper |
| Asymptotic density, computable traceability, and 1-randomness | 2016-07-08 | Paper |
| SEPARABLE MODELS OF RANDOMIZATIONS | 2016-03-22 | Paper |
| A local characterization of VC-minimality | 2016-03-08 | Paper |
| On the structure of the degrees of relative provability | 2015-06-26 | Paper |
| Spectra of theories and structures | 2015-02-02 | Paper |
| Definable closure in randomizations | 2015-01-23 | Paper |
| UNIVERSAL COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS | 2014-09-30 | Paper |
| DECIDABLE MODELS OF ω-STABLE THEORIES | 2014-09-30 | Paper |
| Independence relations in randomizations | 2014-09-04 | Paper |
| Spectra of Atomic Theories | 2014-04-04 | Paper |
| Recursive spectra of strongly minimal theories satisfying the Zilber Trichotomy | 2014-03-12 | Paper |
| The degrees of bi-hyperhyperimmune sets | 2013-12-16 | Paper |
| The index set of uncountably categorical theories | 2013-11-01 | Paper |
| The degrees of categorical theories with recursive models | 2013-07-05 | Paper |
| A new spectrum of recursive models using an amalgamation construction | 2011-10-10 | Paper |
| New spectra of strongly minimal theories in finite languages | 2011-09-12 | Paper |
| Investigating the computable Friedman-Stanley jump | 0001-01-03 | Paper |
| Algorithmically finite, universal, and $*$-universal groups | 0001-01-03 | Paper |
| The Borel complexity of the class of models of first-order theories | 0001-01-03 | Paper |
| A jump operator on the Weihrauch degrees | 0001-01-03 | Paper |
| Two results on complexities of decision problems of groups | 0001-01-03 | Paper |
