| Publication | Date of Publication | Type |
|---|
Thin set versions of Hindman's theorem
Notre Dame Journal of Formal Logic | 2022-12-19 | Paper |
Thin set versions of Hindman's theorem
Notre Dame Journal of Formal Logic | 2022-12-19 | Paper |
Reduction games, provability and compactness
Journal of Mathematical Logic | 2022-12-13 | Paper |
Thin Set Versions of Hindman's Theorem
(available as arXiv preprint) | 2022-03-16 | Paper |
| scientific article; zbMATH DE number 7460091 (Why is no real title available?) | 2022-01-19 | Paper |
| A Feiner Look at the Intermediate Degrees | 2021-10-12 | Paper |
| Coarse computability, the density metric, Hausdorff distances between Turing degrees, perfect trees, and reverse mathematics | 2021-06-24 | Paper |
Ramsey's theorem and products in the Weihrauch degrees
Computability | 2020-11-09 | Paper |
Some results concerning the \(\mathsf{SRT}_2^2\) vs. \(\mathsf{COH}\) problem
Computability | 2020-11-09 | Paper |
Combinatorial principles equivalent to weak induction
Computability | 2020-11-09 | Paper |
Reduction games, provability, and compactness
(available as arXiv preprint) | 2020-08-03 | Paper |
A minimal pair in the generic degrees
Journal of Symbolic Logic | 2020-04-17 | 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 |
Computability and Randomness
Notices of the American Mathematical Society | 2019-10-28 | Paper |
Induction, bounding, weak combinatorial principles, and the homogeneous model theorem
Memoirs of the American Mathematical Society | 2017-10-10 | Paper |
Coarse reducibility and algorithmic randomness
Journal of Symbolic Logic | 2017-04-28 | Paper |
Some Questions in Computable Mathematics
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 and the coarse computability bound
Computability | 2016-04-13 | Paper |
Counting the changes of random \(\Delta_2^0\) sets
Journal Of Logic And Computation | 2016-01-28 | Paper |
Asymptotic density and the coarse computability bound
(available as arXiv preprint) | 2015-05-07 | Paper |
Categoricity properties for computable algebraic fields
Transactions of the American Mathematical Society | 2015-04-22 | Paper |
Slicing the truth. On the computable and reverse mathematics of combinatorial principles
Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore | 2014-09-24 | Paper |
Trivial Reals
Electronic Notes in Theoretical Computer Science | 2013-04-19 | Paper |
Finitely presented expansions of computably enumerable semigroups
Algebra and Logic | 2013-02-21 | Paper |
Finite self-information
Computability | 2013-01-30 | Paper |
Characterizing the strongly jump-traceable sets via randomness
Advances in Mathematics | 2012-10-16 | Paper |
Algorithmic randomness and complexity.
Theory and Applications of Computability | 2010-10-14 | Paper |
Counting the changes of random \({\Delta}^0_2\) sets
Programs, Proofs, Processes | 2010-07-29 | Paper |
The atomic model theorem and type omitting
Transactions of the American Mathematical Society | 2009-11-06 | Paper |
The Strength of Some Combinatorial Principles Related to Ramsey's Theorem for Pairs
(available as arXiv preprint) | 2008-10-20 | Paper |
| Limit computability and constructive measure | 2008-10-20 | Paper |
Order-computable sets
Notre Dame Journal of Formal Logic | 2008-02-05 | Paper |
Subspaces of computable vector spaces
Journal of Algebra | 2007-10-17 | Paper |
Π<sub>1</sub><sup>0</sup> classes and strong degree spectra of relations
Journal of Symbolic Logic | 2007-10-17 | Paper |
Using random sets as oracles
Journal of the London Mathematical Society | 2007-09-27 | Paper |
Undecidability of the structure of the Solovay degrees of c.e. reals
Journal of Computer and System Sciences | 2007-05-30 | Paper |
Combinatorial principles weaker than Ramsey's Theorem for pairs
Journal of Symbolic Logic | 2007-03-12 | Paper |
Bounding homogenous models
Journal of Symbolic Logic | 2007-03-12 | Paper |
Every 1-generic computes a properly 1-generic
Journal of Symbolic Logic | 2007-01-19 | Paper |
Calibrating Randomness
The Bulletin of Symbolic Logic | 2006-12-06 | Paper |
An uncountably categorical theory whose only computably presentable model is saturated
Notre Dame Journal of Formal Logic | 2006-10-04 | Paper |
RELATIVIZING CHAITIN'S HALTING PROBABILITY
Journal of Mathematical Logic | 2006-04-06 | Paper |
Computable trees, prime models, and relative decidability
Proceedings of the American Mathematical Society | 2006-02-17 | Paper |
New Computational Paradigms
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Bounding prime models
Journal of Symbolic Logic | 2005-08-29 | Paper |
| scientific article; zbMATH DE number 2167522 (Why is no real title available?) | 2005-05-12 | Paper |
A computably categorical structure whose expansion by a constant has infinite computable dimension
Journal of Symbolic Logic | 2005-02-09 | Paper |
Randomness and reducibility
Journal of Computer and System Sciences | 2004-09-08 | Paper |
Realizing levels of the hyperarithmetic hierarchy as degree spectra of relations on computable structures
Notre Dame Journal of Formal Logic | 2004-05-27 | Paper |
| scientific article; zbMATH DE number 2063218 (Why is no real title available?) | 2004-03-29 | Paper |
Computability-theoretic and proof-theoretic aspects of partial and linear orderings
Israel Journal of Mathematics | 2004-03-17 | Paper |
| scientific article; zbMATH DE number 2047485 (Why is no real title available?) | 2004-02-29 | Paper |
Degree spectra of relations on computable structures in the presence of Δ<sub>2</sub><sup>0</sup>isomorphisms
Journal of Symbolic Logic | 2002-12-04 | Paper |
| scientific article; zbMATH DE number 1834658 (Why is no real title available?) | 2002-11-25 | Paper |
Degree spectra and computable dimensions in algebraic structures
Annals of Pure and Applied Logic | 2002-08-22 | Paper |
Degree spectra of relations on structures of finite computable dimension
Annals of Pure and Applied Logic | 2002-08-22 | Paper |
A \(\Delta_2^0\) set with no infinite low subset in either it or its complement
The Journal of Symbolic Logic | 2002-07-18 | Paper |
Degree spectra of intrinsically c. e. relations
The Journal of Symbolic Logic | 2002-05-15 | Paper |
Randomness, computability, and density
SIAM Journal on Computing | 2002-04-23 | Paper |
| scientific article; zbMATH DE number 1688364 (Why is no real title available?) | 2002-01-09 | Paper |
Undecidability and 1-types in intervals of the computably enumerable degrees
Annals of Pure and Applied Logic | 2001-10-23 | Paper |
Degree Spectra of Relations on Computable Structures
The Bulletin of Symbolic Logic | 2001-09-11 | Paper |
Prime models of theories of computable linear orderings
Proceedings of the American Mathematical Society | 2001-07-05 | Paper |
