| Publication | Date of Publication | Type |
|---|
Iterated priority arguments in descriptive set theory
The Bulletin of Symbolic Logic | 2024-11-12 | Paper |
Martin-Löf reducibility and cost functions
Israel Journal of Mathematics | 2024-06-25 | Paper |
Enumerations of families closed under finite differences
Computability | 2024-04-15 | Paper |
STRUCTURAL HIGHNESS NOTIONS
Journal of Symbolic Logic | 2023-12-22 | Paper |
| Iterated Priority Arguments in Descriptive Set Theory | 2022-11-15 | Paper |
| An Effective Classification of Borel Wadge Classes | 2022-11-15 | Paper |
Relationships between computability-theoretic properties of problems
Journal of Symbolic Logic | 2022-04-12 | Paper |
SCOTT COMPLEXITY OF COUNTABLE STRUCTURES
Journal of Symbolic Logic | 2022-01-17 | Paper |
Computing sets from all infinite subsets
Transactions of the American Mathematical Society | 2021-10-21 | Paper |
Non-density in punctual computability
Annals of Pure and Applied Logic | 2021-07-26 | Paper |
Coding in the automorphism group of a computably categorical structure
Journal of Mathematical Logic | 2021-05-19 | Paper |
Taking the path computably traveled
Journal Of Logic And Computation | 2020-01-29 | Paper |
Cardinal invariants, non-lowness classes, and Weihrauch reducibility
Computability | 2020-01-17 | Paper |
The Rado path decomposition theorem
Israel Journal of Mathematics | 2019-12-17 | Paper |
Relationships between computability-theoretic properties of problems
(available as arXiv preprint) | 2019-03-11 | Paper |
Strong jump-traceability
The Bulletin of Symbolic Logic | 2018-08-13 | Paper |
Finding bases of uncountable free abelian groups is usually difficult
Transactions of the American Mathematical Society | 2018-03-28 | Paper |
Lowness for isomorphism and degrees of genericity
Computability | 2018-03-16 | Paper |
The finite intersection principle and genericity
Mathematical Proceedings of the Cambridge Philosophical Society | 2017-09-28 | Paper |
A van Lambalgen theorem for Demuth randomness
Proceedings of the 12th Asian Logic Conference | 2017-05-31 | Paper |
Coherent randomness tests and computing the \(K\)-trivial sets
Journal of the European Mathematical Society (JEMS) | 2016-05-02 | Paper |
Computuing \(K\)-trivial sets by incomplete random sets
The Bulletin of Symbolic Logic | 2014-10-21 | Paper |
Characterizing lowness for Demuth randomness
The Journal of Symbolic Logic | 2014-09-30 | Paper |
Joining non-low C.E. sets with diagonally non-computable functions
Journal Of Logic And Computation | 2014-04-01 | Paper |
