| Publication | Date of Publication | Type |
|---|
A distributed event-triggered dynamic average consensus scheme with a time-varying threshold and its application in DC microgrid
Asian Journal of Control | 2024-08-06 | Paper |
SOME CONSEQUENCES OF AND
Journal of Symbolic Logic | 2023-12-22 | Paper |
LUZIN’S (N) AND RANDOMNESS REFLECTION
Journal of Symbolic Logic | 2022-06-15 | Paper |
TD implies \(\operatorname{CC}_{\mathbb{R}} \)
Advances in Mathematics | 2021-10-27 | Paper |
An application of recursion theory to analysis
The Bulletin of Symbolic Logic | 2021-01-05 | Paper |
TD implies CCR
| 2020-12-17 | Paper |
Luzin's (N) and randomness reflection
| 2020-06-12 | Paper |
Chaitin's \(\Omega\) as a continuous function
Journal of Symbolic Logic | 2020-04-17 | Paper |
Being low along a sequence and elsewhere
Journal of Symbolic Logic | 2020-04-06 | Paper |
Degree spectra of unary relations on $\langle \omega, \leq \rangle$
| 2019-04-23 | Paper |
Basis theorem for \(\Sigma_2^1\)-sets
Journal of Symbolic Logic | 2019-03-15 | Paper |
A model with everything except for a well-ordering of the reals
| 2018-09-27 | Paper |
Hamel bases and well–ordering the continuum
Proceedings of the American Mathematical Society | 2018-06-04 | Paper |
Degree spectra of equivalence relations
Proceedings of the 13th Asian Logic Conference | 2017-06-09 | Paper |
On the Reals Which Cannot Be Random
Computability and Complexity | 2017-04-04 | Paper |
Measure-theoretic applications of higher Demuth's theorem
Transactions of the American Mathematical Society | 2016-09-22 | Paper |
On Martin’s pointed tree theorem
Computability | 2016-07-25 | Paper |
Randomness in the higher setting
The Journal of Symbolic Logic | 2016-03-22 | Paper |
A reducibility related to being hyperimmune-free
Annals of Pure and Applied Logic | 2015-06-17 | Paper |
Recursion theory. Computational aspects of definability
De Gruyter Series in Logic and Its Applications | 2015-03-10 | Paper |
Cofinal maximal chains in the Turing degrees
Proceedings of the American Mathematical Society | 2014-03-13 | Paper |
Characterizing strong randomness via Martin-Löf randomness
Annals of Pure and Applied Logic | 2012-04-13 | Paper |
Descriptive set theoretical complexity of randomness notions
Fundamenta Mathematicae | 2011-11-24 | Paper |
A new proof of Friedman's conjecture
The Bulletin of Symbolic Logic | 2011-10-11 | Paper |
Maximal pairs of c.e. reals in the computably Lipschitz degrees
Annals of Pure and Applied Logic | 2011-09-12 | Paper |
Higher Kurtz randomness
Annals of Pure and Applied Logic | 2011-08-26 | Paper |
Relativizations of randomness and genericity notions
Bulletin of the London Mathematical Society | 2011-08-16 | Paper |
Oscillation in the initial segment complexity of random reals
Advances in Mathematics | 2011-03-29 | Paper |
Turing degrees and the Ershov hierarchy
| 2010-06-17 | Paper |
The strength of the projective Martin conjecture
Fundamenta Mathematicae | 2010-04-09 | Paper |
Bounding non-GL2 and R.E.A.
Journal of Symbolic Logic | 2009-09-29 | Paper |
A Π¹₁-uniformization principle for reals
Transactions of the American Mathematical Society | 2009-07-23 | Paper |
Lowness of higher randomness notions
Israel Journal of Mathematics | 2008-10-16 | Paper |
On initial segment complexity and degrees of randomness
Transactions of the American Mathematical Society | 2008-06-17 | Paper |
Maximal chains in the Turing degrees
Journal of Symbolic Logic | 2008-02-25 | Paper |
Thin Maximal Antichains in the Turing Degrees
Lecture Notes in Computer Science | 2007-11-13 | Paper |
Theory and Applications of Models of Computation
Lecture Notes in Computer Science | 2007-04-30 | Paper |
Theory and Applications of Models of Computation
Lecture Notes in Computer Science | 2007-04-30 | Paper |
An extension of Harrington's noncupping theorem
Science in China. Series F | 2007-02-20 | Paper |
When van Lambalgen’s Theorem fails
Proceedings of the American Mathematical Society | 2007-02-01 | Paper |
On Σ1-Structural Differences Among Finite Levels of the Ershov Hierarchy
Journal of Symbolic Logic | 2007-01-19 | Paper |
Lowness and nullsets
Journal of Symbolic Logic | 2006-11-29 | Paper |
Measure theory aspects of locally countable orderings
Journal of Symbolic Logic | 2006-11-29 | Paper |
Arithmetical Sacks forcing
Archive for Mathematical Logic | 2006-09-26 | Paper |
Lowness for genericity
Archive for Mathematical Logic | 2006-03-21 | Paper |
On the definable ideal generated by nonbounding c.e. degrees
Journal of Symbolic Logic | 2006-02-08 | Paper |
There is no SW-complete c.e. real
Journal of Symbolic Logic | 2005-08-29 | Paper |
There are no maximal low d.c.e. degrees
Notre Dame Journal of Formal Logic | 2005-07-06 | Paper |
Infimum properties differ in the weak truth-table degrees and the Turing degrees
Acta Mathematica Sinica, English Series | 2004-11-26 | Paper |
The Kolmogorov complexity of random reals
Annals of Pure and Applied Logic | 2004-11-22 | Paper |
There are 2^{ℵ₀} many 𝐻-degrees in the random reals
Proceedings of the American Mathematical Society | 2004-08-13 | Paper |
