| Publication | Date of Publication | Type |
|---|
Minimal covers in the Weihrauch degrees
Proceedings of the American Mathematical Society | 2024-10-18 | 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 |
PA RELATIVE TO AN ENUMERATION ORACLE
Journal of Symbolic Logic | 2023-12-22 | Paper |
Complexity profiles and generic Muchnik reducibility
Advances in Mathematics | 2023-12-21 | Paper |
Minimal covers in the Weihrauch degrees
| 2023-11-21 | Paper |
EXPANDING THE REALS BY CONTINUOUS FUNCTIONS ADDS NO COMPUTATIONAL POWER
Journal of Symbolic Logic | 2023-09-11 | Paper |
MAXIMAL TOWERS AND ULTRAFILTER BASES IN COMPUTABILITY THEORY
Journal of Symbolic Logic | 2023-09-11 | Paper |
Redundancy of information: lowering dimension
| 2023-07-21 | Paper |
Computability and the symmetric difference operator
Logic Journal of the IGPL | 2022-07-22 | Paper |
A structural dichotomy in the enumeration degrees
Journal of Symbolic Logic | 2022-06-15 | Paper |
Highness properties close to PA completeness
Israel Journal of Mathematics | 2021-12-01 | Paper |
Computing from projections of random points
Journal of Mathematical Logic | 2020-06-26 | Paper |
Chaitin's \(\Omega\) as a continuous function
Journal of Symbolic Logic | 2020-04-17 | Paper |
Characterizing the continuous degrees
Israel Journal of Mathematics | 2019-12-17 | Paper |
Connected choice and the Brouwer fixed point theorem
Journal of Mathematical Logic | 2019-07-08 | Paper |
On cototality and the skip operator in the enumeration degrees
Transactions of the American Mathematical Society | 2019-07-03 | Paper |
Degree spectra of unary relations on $\langle \omega, \leq \rangle$
| 2019-04-23 | Paper |
Energy randomness
Israel Journal of Mathematics | 2018-11-13 | Paper |
Two more characterizations of \(K\)-triviality
Notre Dame Journal of Formal Logic | 2018-05-18 | Paper |
Density of the cototal enumeration degrees
Annals of Pure and Applied Logic | 2018-03-21 | Paper |
Dimension 1 sequences are close to randoms
Theoretical Computer Science | 2017-11-16 | Paper |
Forcing with bushy trees
The Bulletin of Symbolic Logic | 2017-10-06 | Paper |
Martin-L\"of reducibility and cost functions
| 2017-07-02 | Paper |
Nullifying randomness and genericity using symmetric difference
Annals of Pure and Applied Logic | 2017-06-15 | Paper |
Theory spectra and classes of theories
Transactions of the American Mathematical Society | 2017-06-14 | Paper |
THE COMPLEMENTS OF LOWER CONES OF DEGREES AND THE DEGREE SPECTRA OF STRUCTURES
Journal of Symbolic Logic | 2017-04-28 | Paper |
On Work of Barmpalias and Lewis-Pye: A Derivation on the D.C.E. Reals
Computability and Complexity | 2017-04-04 | Paper |
Generic Muchnik reducibility and presentations of fields
Israel Journal of Mathematics | 2017-01-11 | Paper |
The Brouwer fixed point theorem revisited
Pursuit of the Universal | 2016-08-17 | Paper |
Defining totality in the enumeration degrees
Journal of the American Mathematical Society | 2016-07-25 | Paper |
On Kalimullin pairs
Computability | 2016-07-25 | Paper |
Counting the changes of random \(\Delta_2^0\) sets
Journal Of Logic And Computation | 2016-01-28 | Paper |
Randomness and differentiability
Transactions of the American Mathematical Society | 2015-11-03 | Paper |
Density, forcing, and the covering problem
Mathematical Research Letters | 2015-07-28 | Paper |
On the structure of the degrees of relative provability
Israel Journal of Mathematics | 2015-06-26 | Paper |
Lowness for effective Hausdorff dimension
Journal of Mathematical Logic | 2015-03-03 | Paper |
Spectra of theories and structures
Proceedings of the American Mathematical Society | 2015-02-02 | Paper |
Computuing \(K\)-trivial sets by incomplete random sets
The Bulletin of Symbolic Logic | 2014-10-21 | Paper |
Universal computably enumerable equivalence relations
The Journal of Symbolic Logic | 2014-09-30 | Paper |
Random strings and truth-table degrees of Turing complete c.e. sets
Logical Methods in Computer Science | 2014-09-30 | Paper |
Cupping with random sets
Proceedings of the American Mathematical Society | 2014-09-12 | Paper |
Denjoy, Demuth and density
Journal of Mathematical Logic | 2014-09-05 | Paper |
Joining non-low C.E. sets with diagonally non-computable functions
Journal Of Logic And Computation | 2014-04-01 | Paper |
The degrees of bi-hyperhyperimmune sets
Annals of Pure and Applied Logic | 2013-12-16 | Paper |
Randomness notions and partial relativization
Israel Journal of Mathematics | 2013-11-01 | Paper |
Randomness for non-computable measures
Transactions of the American Mathematical Society | 2013-09-04 | 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 |
Effectiveness for embedded spheres and balls
Electronic Notes in Theoretical Computer Science | 2013-04-19 | Paper |
The Denjoy alternative for computable functions
| 2012-08-23 | Paper |
Lowness notions, measure and domination
Journal of the London Mathematical Society. Second Series | 2012-06-08 | Paper |
Two notes on subshifts
Proceedings of the American Mathematical Society | 2012-04-27 | Paper |
scientific article; zbMATH DE number 6019537 (Why is no real title available?)
| 2012-03-29 | Paper |
Randomness and lowness notions via open covers
Annals of Pure and Applied Logic | 2012-03-13 | Paper |
Diagonally non-recursive functions and effective Hausdorff dimension
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 |
Extracting information is hard: a Turing degree of non-integral effective Hausdorff dimension
Advances in Mathematics | 2010-12-10 | Paper |
The \(K\)-degrees, low for \(K\) degrees, and weakly low for \(K\) sets
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 Kurtz randomness
Journal of Symbolic Logic | 2009-06-04 | Paper |
Indifferent Sets
Journal Of Logic And Computation | 2009-04-16 | Paper |
The upward closure of a perfect thin class
Annals of Pure and Applied Logic | 2008-12-05 | Paper |
Prompt simplicity, array computability and cupping
| 2008-10-20 | Paper |
On initial segment complexity and degrees of randomness
Transactions of the American Mathematical Society | 2008-06-17 | Paper |
Randomness and halting probabilities
Journal of Symbolic Logic | 2007-01-19 | Paper |
Every 1-generic computes a properly 1-generic
Journal of Symbolic Logic | 2007-01-19 | Paper |
Randomness and Computability: Open Questions
The Bulletin of Symbolic Logic | 2006-12-06 | Paper |
Uniform almost everywhere domination
Journal of Symbolic Logic | 2006-11-29 | Paper |
RELATIVIZING CHAITIN'S HALTING PROBABILITY
Journal of Mathematical Logic | 2006-04-06 | Paper |
Kolmogorov-Loveland randomness and stochasticity
Annals of Pure and Applied Logic | 2005-12-29 | Paper |
On self-embeddings of computable linear orderings
Annals of Pure and Applied Logic | 2005-12-29 | Paper |
The undecidability of iterated modal relativization
Studia Logica | 2005-12-02 | Paper |
STACS 2005
Lecture Notes in Computer Science | 2005-12-02 | Paper |
A basis theorem for Π₁⁰ classes of positive measure and jump inversion for random reals
Proceedings of the American Mathematical Society | 2005-10-06 | Paper |
Every 2-random real is Kolmogorov random
Journal of Symbolic Logic | 2005-08-29 | Paper |
Degrees of unsolvability of continuous functions
Journal of Symbolic Logic | 2005-08-29 | Paper |
Effectiveness for infinite variable words and the dual Ramsey theorem
Archive for Mathematical Logic | 2004-12-16 | Paper |
scientific article; zbMATH DE number 1444359 (Why is no real title available?)
| 2002-09-08 | Paper |
A jump operator on the Weihrauch degrees
| N/A | Paper |
