On arithmetical level of the class of superhigh sets
-
Published:2014-04-29
Issue:5
Volume:58
Page:43-47
-
ISSN:1066-369X
-
Container-title:Russian Mathematics
-
language:en
-
Short-container-title:Russ Math.
Author:
Faizrahmanov M. Kh.
Subject
General Mathematics
Reference11 articles.
1. J. Mohrherr, “A Refinement of lown and highn for the R. E. Degrees,” Z. Math. Logik Grundlag. Math. 32(1), 5–12 (1986).
2. B. Kjos-Hanssen and A. Nies, “Superhighness,” Notre Dame J. Formal Logic 50(4), 445–452 (2009).
3. A. Nies, Computability and Randomness (Oxford University Press, 2009).
4. N. L. Dobrinen and S. G. Simpson, “Almost Everywhere Domination,” J. Symbolic Logic 69(3), 914–922 (2004).
5. P. Cholak, R. Downey, and N. Greenberg, “Strong Jump-Traceabilty I: The Computably Enumerable Case,” Adv. Math. 217(5), 2045–2074 (2008).