David Diamondstone
From MaRDI portal
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Limit computability and ultrafilters Computability | 2023-09-13 | Paper |
| The finite intersection principle and genericity Mathematical Proceedings of the Cambridge Philosophical Society | 2017-09-28 | Paper |
| Theory spectra and classes of theories Transactions of the American Mathematical Society | 2017-06-14 | Paper |
| A van Lambalgen theorem for Demuth randomness Proceedings of the 12th Asian Logic Conference | 2017-05-31 | Paper |
| Asymptotic density, computable traceability, and 1-randomness Fundamenta Mathematicae | 2016-07-08 | Paper |
| On the structure of the degrees of relative provability Israel Journal of Mathematics | 2015-06-26 | Paper |
| Inherent enumerability of strong jump-traceability Transactions of the American Mathematical Society | 2015-02-02 | Paper |
| Lowness for difference tests Notre Dame Journal of Formal Logic | 2014-04-04 | Paper |
| Lowness for difference tests Notre Dame Journal of Formal Logic | 2014-04-04 | Paper |
| Natural large degree spectra Computability | 2013-10-10 | Paper |
| Low upper bounds in the LR degrees Annals of Pure and Applied Logic | 2012-04-13 | Paper |
| Martin-Löf randomness and Galton-Watson processes Annals of Pure and Applied Logic | 2012-03-13 | Paper |
| Strengthening prompt simplicity Journal of Symbolic Logic | 2011-10-10 | Paper |
| Members of Random Closed Sets Mathematical Theory and Computational Practice | 2010-07-28 | Paper |
| \(\Pi_1^0\) classes, Peano arithmetic, randomness, and computable domination Notre Dame Journal of Formal Logic | 2010-06-11 | Paper |
| Promptness does not imply superlow cuppability Journal of Symbolic Logic | 2010-01-07 | Paper |
Research outcomes over time
This page was built for person: David Diamondstone
