| Publication | Date of Publication | Type |
|---|
Milliken’s Tree Theorem and Its Applications: A Computability-Theoretic Perspective
Memoirs of the American Mathematical Society | 2024-02-20 | Paper |
| Computability. Randomness, reverse mathematics and hypercomputability | 2022-10-04 | Paper |
| Partition genericity and pigeonhole basis theorems | 2022-04-06 | Paper |
The weakness of the pigeonhole principle under hyperarithmetical reductions
Journal of Mathematical Logic | 2021-11-03 | Paper |
Muchnik degrees and cardinal characteristics
Journal of Symbolic Logic | 2021-10-27 | Paper |
\( \mathsf{SRT}_2^2\) does not imply \(\mathsf{RT}_2^2\) in \(\omega \)-models
Advances in Mathematics | 2021-08-23 | Paper |
Bad oracles in higher computability and randomness
Israel Journal of Mathematics | 2021-04-29 | Paper |
An answer to the gamma question
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-20 | Paper |
| scientific article; zbMATH DE number 7204368 (Why is no real title available?) | 2020-05-26 | Paper |
Genericity and randomness with ITTMs
Journal of Symbolic Logic | 2020-01-10 | Paper |
Pigeons do not jump high
Advances in Mathematics | 2019-07-19 | Paper |
\({\Pi}_1^0\)-encodability and omniscient reductions
Notre Dame Journal of Formal Logic | 2019-05-29 | Paper |
\({\Pi}_1^0\)-encodability and omniscient reductions
Notre Dame Journal of Formal Logic | 2019-05-29 | Paper |
SRT22 does not imply RT22 in omega-models
(available as arXiv preprint) | 2019-05-20 | Paper |
A computable analysis of variable words theorems
Proceedings of the American Mathematical Society | 2019-01-07 | Paper |
Two more characterizations of \(K\)-triviality
Notre Dame Journal of Formal Logic | 2018-05-18 | Paper |
Algorithmic identification of probabilities is hard
Journal of Computer and System Sciences | 2018-05-08 | Paper |
A unifying approach to the Gamma question
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
Higher randomness and genericity
Forum of Mathematics, Sigma | 2017-12-19 | Paper |
Higher randomness and forcing with closed sets
Theory of Computing Systems | 2017-07-17 | Paper |
Continuous higher randomness
Journal of Mathematical Logic | 2017-06-20 | Paper |
Von Neumann's biased coin revisited
2012 27th Annual IEEE Symposium on Logic in Computer Science | 2017-05-16 | Paper |
| Higher randomness and forcing with closed sets | 2017-03-03 | Paper |
Pi01 encodability and omniscient reductions
(available as arXiv preprint) | 2016-03-03 | Paper |
Algorithmic identification of probabilities is hard
Lecture Notes in Computer Science | 2015-01-14 | Paper |
