A basis theorem for Π 1 0 classes of positive measure and jump inversion for random reals

Proceedings of the American Mathematical Society

Volumn 134, Issue 1, 2006, Pages 283-288

  Downey, Rod ^a   Miller, Joseph S ^b  

^a VICTORIA UNIVERSITY OF WELLINGTON   (New Zealand)

^b UNIVERSITY OF CONNECTICUT   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 31144471070     PISSN: 00029939     EISSN: None     Source Type: Journal    
DOI: 10.1090/S0002-9939-05-07901-3     Document Type: Article

References (19)

1. M. M. Arslanov, R. F. Nadyrov, and V. D. Solov'ev, A criterion for the completeness of recursively enumerable sets, and some generalizations of a fixed point theorem, Izv. Vyss. Učebn. Zaved. Matematika 4 (179) (1977), 3-7. MR0446930 (56:5247)
2. 0 classes in computability theory, Handbook of computability theory, Stud. Logic Found. Math., vol. 140, North-Holland, Amsterdam, 1999, pp. 37-85. MR1720779 (2001d:03110)
3. R. Downey and D. Hirschfeldt, Algorithmic randomness and complexity, Springer-Verlag, Berlin, to appear.
4. Rodney G. Downey, Denis R. Hirschfeldt, André Nies, and Sebastiaan A. Terwijn, Calibrating randomness, Bulletin of Symbolic Logic, to appear.
5. Richard Friedberg, A criterion for completeness of degrees of unsolvability, J. Symb. Logic 22 (1957), 159-160. MR0098025 (20:4488)
6. Péter Gács, Every sequence is reducible to a random one, Inform, and Control 70 (1986), no. 2-3, 186-192. MR0859105 (87k:03043)
7. 0 classes and degrees of theories, Trans. Amer. Math. Soc. 173 (1972), 33-56. MR0316227 (47:4775)
8. S. Kautz, Degrees of random sets, Ph.D. Dissertation, Cornell University, 1991.
9. 0-classes and complete extensions of PA, Recursion theory week (Oberwolfach, 1984), Lecture Notes in Math., vol. 1141, Springer, Berlin, 1985, pp. 245-259. MR0820784 (87e:03102)
10. _, On the use of diagonally nonrecursive functions, Logic Colloquium '87 (Granada. 1987), Stud. Logic Found. Math., vol. 129, North-Holland, Amsterdam, 1989, pp. 219-239. MR1015310 (91c:03037)
11. S. Kurtz, Randomness and genericity in the degrees of unsolvability, Ph.D. Dissertation, University of Illinois, Urbana. 1981.
12. M. Li and P. Vitányi, An introduction to Kolmogorov complexity and its applications, Texts and Monographs in Computer Science, Springer-Verlag, New York, 1993. MR1238938 (94j:68121)
13. Per Martin-Löf, The definition of random sequences, Information and Control 9 (1966), 602-619. MR0223179 (36:6228)
14. Joseph S. Miller and Liang Yu, On initial segment complexity and degrees of randomness, to appear.
15. Gerald E. Sacks, A minimal degree less than 0′, Bull. Amer. Math. Soc. 67 (1961), 416-419. MR0126380 (23:A3676)
16. Dana Scott, Algebras of sets binumerable m complete extensions of arithmetic, Proc. Sympos. Pure Math., Vol. V, American Mathematical Society, Providence, R.I., 1962. pp. 117-121. MR0141595 (25:4993)
17. J. R. Shoenfield, On degrees of unsolvability, Ann. of Math. (2) 69 (1959), 644-653. MR0105355 (21:4097)
18. Robert I. Soare. Recursively enumerable sets and degrees, Springer-Verlag, Berlin, 1987. MR0882921 (88m:03003)
19. Frank Stephan, Martin-Löf random sets and PA-complete sets, to appear.