| Publication | Date of Publication | Type |
|---|
Finite final segments of the d.c.e. Turing degrees
(available as arXiv preprint) | N/A | Paper |
The computational content of multidimensional discontinuity
(available as arXiv preprint) | N/A | Paper |
Every nonzero enumeration degree contains infinitely many singleton degrees
Algebra and Logic | 2026-05-27 | Paper |
The computational content of multidimensional discontinuity
Annals of Pure and Applied Logic | 2026-02-12 | Paper |
On cardinalities of Rogers semilattices for families in the Ershov hierarchy
Information and Computation | 2025-12-15 | Paper |
Limit complexities, minimal descriptions, and n-randomness
The Journal of Symbolic Logic | 2025-12-10 | Paper |
A pathological punctually 1-decidable structure
Proceedings of the American Mathematical Society | 2025-08-27 | Paper |
The singleton degrees of the \({\Sigma}_2^0\) sets are not dense
Annals of Pure and Applied Logic | 2025-07-27 | Paper |
A discrete linear order with non-dense punctual degrees
Theoretical Computer Science | 2025-06-19 | Paper |
Computable topological groups
The Journal of Symbolic Logic | 2025-05-06 | Paper |
Computable classifications of continuous, transducer, and regular functions
Theoretical Computer Science | 2025-02-26 | Paper |
Punctually presented structures. II: Comparing presentations.
Archive for Mathematical Logic | 2025-02-18 | Paper |
Notes on Sacks' splitting theorem
The Journal of Symbolic Logic | 2025-02-03 | Paper |
| Computability and categoricity of weakly homogeneous Boolean algebras and p-groups | 2025-02-03 | Paper |
On cupping and Ahmad pairs
Journal of Symbolic Logic | 2024-11-25 | Paper |
On the c.e. degrees realizable in ^0_1 classes
Journal of Symbolic Logic | 2024-11-25 | Paper |
Computably and punctually universal spaces
Annals of Pure and Applied Logic | 2024-10-07 | Paper |
Every \(\Delta^0_2\) Polish space is computable topological
Proceedings of the American Mathematical Society | 2024-06-13 | Paper |
Separating notions in effective topology
International Journal of Algebra and Computation | 2024-01-04 | Paper |
Minimal degrees and downwards density in some strong positive reducibilities and quasi-reducibilities
Journal Of Logic And Computation | 2023-08-03 | Paper |
Primitive recursive equivalence relations and their primitive recursive complexity
Computability | 2023-01-12 | Paper |
Extensions of two constructions of Ahmad
Computability | 2023-01-12 | Paper |
Every Δ20 degree is a strong degree of categoricity
Journal of Mathematical Logic | 2022-12-13 | Paper |
Multiple genericity: a new transfinite hierarchy of genericity notions
Israel Journal of Mathematics | 2022-10-24 | Paper |
| Computable topological groups | 2022-09-10 | Paper |
| Limit Complexities, Minimal Descriptions, and n-Randomness | 2022-08-05 | Paper |
Separating weak -change and -change genericity
Annals of Pure and Applied Logic | 2022-05-23 | Paper |
A recursion theoretic foundation of computation over real numbers
Journal Of Logic And Computation | 2021-11-09 | Paper |
Foundations of online structure theory. II: The operator approach
(available as arXiv preprint) | 2021-10-08 | Paper |
| Foundations of online structure theory. II: The operator approach | 2021-10-08 | Paper |
Punctual equivalence relations and their (punctual) complexity
(available as arXiv preprint) | 2021-09-09 | Paper |
Turing degrees in Polish spaces and decomposability of Borel functions
Journal of Mathematical Logic | 2021-06-04 | Paper |
PUNCTUAL CATEGORICITY AND UNIVERSALITY
Journal of Symbolic Logic | 2021-04-15 | Paper |
Cupping and jump classes in the computably enumerable degrees
Journal of Symbolic Logic | 2021-04-15 | Paper |
Computability of Polish spaces up to homeomorphism
Journal of Symbolic Logic | 2021-04-15 | Paper |
Online presentations of finitely generated structures
Theoretical Computer Science | 2020-10-21 | Paper |
| Computable classifications of continuous, transducer, and regular functions | 2020-10-19 | Paper |
Incomparability in local structures of \(s\)-degrees and \(Q\)-degrees
Archive for Mathematical Logic | 2020-10-15 | Paper |
Enumerating abelian \(p\)-groups
Journal of Algebra | 2020-08-25 | Paper |
Effective domination and the bounded jump
Notre Dame Journal of Formal Logic | 2020-07-20 | Paper |
Foundations of Online Structure Theory II: The Operator Approach
(available as arXiv preprint) | 2020-07-14 | Paper |
Minimal weak truth table degrees and computably enumerable Turing degrees
Memoirs of the American Mathematical Society | 2020-06-19 | Paper |
A structure of punctual dimension two
Proceedings of the American Mathematical Society | 2020-05-27 | Paper |
On the degree structure of equivalence relations under computable reducibility
Notre Dame Journal of Formal Logic | 2020-02-14 | Paper |
On the degree structure of equivalence relations under computable reducibility
Notre Dame Journal of Formal Logic | 2020-02-14 | Paper |
AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
Journal of Symbolic Logic | 2020-01-10 | Paper |
The back-and-forth method and computability without delay
Israel Journal of Mathematics | 2019-12-17 | Paper |
On Kierstead's conjecture
Transactions of the American Mathematical Society | 2019-08-07 | Paper |
Categorical linearly ordered structures
Annals of Pure and Applied Logic | 2019-07-10 | Paper |
| Enumeration degrees and non-metrizable topology | 2019-04-08 | Paper |
Splitting into degrees with low computational strength
Annals of Pure and Applied Logic | 2018-06-05 | Paper |
Computable torsion abelian groups
Advances in Mathematics | 2018-01-11 | Paper |
The diversity of categoricity without delay
Algebra and Logic | 2018-01-05 | Paper |
A Friedberg enumeration of equivalence structures
Journal of Mathematical Logic | 2017-12-04 | Paper |
Lowness and logical depth
Theoretical Computer Science | 2017-11-06 | Paper |
Optimal depth-first algorithms and equilibria of independent distributions on multi-branching trees
Information Processing Letters | 2017-06-13 | Paper |
An analogy between cardinal characteristics and highness properties of oracles
Proceedings of the 13th Asian Logic Conference | 2017-06-09 | Paper |
Minimal Pairs in the C.E. Truth-table Degrees
Proceedings of the 13th Asian Logic Conference | 2017-06-09 | Paper |
Algebraic structures computable without delay
Theoretical Computer Science | 2017-05-12 | Paper |
Finitary reducibility on equivalence relations
Journal of Symbolic Logic | 2017-04-28 | Paper |
On being Rod's graduate student
Computability and Complexity | 2017-04-04 | Paper |
Abelian p-groups and the halting problem
Annals of Pure and Applied Logic | 2016-08-31 | Paper |
Computable structures and operations on the space of continuous functions
Fundamenta Mathematicae | 2016-04-28 | Paper |
Computably enumerable Turing degrees and the meet property
Proceedings of the American Mathematical Society | 2016-03-03 | Paper |
Counting the changes of random _2⁰ sets
Journal Of Logic And Computation | 2016-01-28 | Paper |
On \(\Delta_2^0\)-categoricity of equivalence relations
Annals of Pure and Applied Logic | 2015-05-26 | Paper |
Lowness for effective Hausdorff dimension
Journal of Mathematical Logic | 2015-03-03 | Paper |
Iterated effective embeddings of abelian p-groups
International Journal of Algebra and Computation | 2015-01-21 | Paper |
JSL volume 79 issue 2 Cover and Front matter
Journal of Symbolic Logic | 2014-12-05 | Paper |
Complexity of equivalence relations and preorders from computability theory
Journal of Symbolic Logic | 2014-12-05 | Paper |
Complexity of equivalence relations and preorders from computability theory
Journal of Symbolic Logic | 2014-12-05 | Paper |
Universal computably enumerable equivalence relations
The Journal of Symbolic Logic | 2014-09-30 | Paper |
The complexity of recursive splittings of random sets
Computability | 2014-06-19 | Paper |
Martin-Löf random points satisfy Birkhoff's ergodic theorem for effectively closed sets
Proceedings of the American Mathematical Society | 2013-09-03 | Paper |
Lowness for bounded randomness
Theoretical Computer Science | 2012-11-27 | Paper |
Bounded randomness
Computation, Physics and Beyond | 2012-06-15 | Paper |
Limits on jump inversion for strong reducibilities
Journal of Symbolic Logic | 2011-12-23 | Paper |
Strengthening prompt simplicity
Journal of Symbolic Logic | 2011-10-10 | Paper |
Jump inversions inside effectively closed sets and applications to randomness
Journal of Symbolic Logic | 2011-06-28 | Paper |
Beyond strong jump traceability
Proceedings of the London Mathematical Society | 2011-03-25 | Paper |
Difference randomness
Proceedings of the American Mathematical Society | 2011-03-10 | Paper |
On the degrees of diagonal sets and the failure of the analogue of a theorem of Martin
Notre Dame Journal of Formal Logic | 2010-09-02 | Paper |
Counting the changes of random \({\Delta}^0_2\) sets
Programs, Proofs, Processes | 2010-07-29 | Paper |
Lowness for Demuth Randomness
Mathematical Theory and Computational Practice | 2010-07-28 | Paper |
Effective packing dimension and traceability
Notre Dame Journal of Formal Logic | 2010-07-20 | Paper |
The importance of \(\Pi^0_1\) classes in effective randomness
Journal of Symbolic Logic | 2010-03-15 | Paper |
| scientific article; zbMATH DE number 5354050 (Why is no real title available?) | 2008-10-20 | Paper |
On strongly jump traceable reals
Annals of Pure and Applied Logic | 2008-05-23 | Paper |
On very high degrees
Journal of Symbolic Logic | 2008-05-08 | Paper |
Logical Approaches to Computational Barriers
Lecture Notes in Computer Science | 2007-04-30 | Paper |
