Author:
Brodhead Paul,Downey Rod,Ng Keng Meng
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Barmpalias, G., Downey, R., Greenberg, N.: Working with strong reducibilities above totally ω-c.e. degrees. Transactions of the American Mathematical Society 362, 777–813 (2010)
2. Downey, R.: On
$\Pi^0_1$
classes and their ranked points. Notre Dame Journal of Formal Logic 32(4), 499–512 (1991)
3. Downey, R., Greenberg, N.: Turing degrees of reals of positive effective packing dimension. Information Processing Letters 108, 298–303 (2008)
4. Downey, R., Greenberg, N.: A Hierarchy of Computably Enumerable Degrees, Unifying Classes and Natural Definability (in preparation)
5. Downey, R., Greenberg, N., Weber, R.: Totally < ω computably enumerable degrees and bounding critical triples. Journal of Mathematical Logic 7, 145–171 (2007)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Multiple genericity: a new transfinite hierarchy of genericity notions;Israel Journal of Mathematics;2022-08-11
2. A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES;The Bulletin of Symbolic Logic;2018-03
3. Kobayashi compressibility;Theoretical Computer Science;2017-05
4. DEMUTH’S PATH TO RANDOMNESS;The Bulletin of Symbolic Logic;2015-09
5. Sub-computable Bounded Pseudorandomness;Logical Foundations of Computer Science;2013