Previous |  Up |  Next

Article

References:
[1] C. T. Chong C. G. Jockusch, Jr.: Minimal degrees and 1-generic sets below O'. іn: Computation and Proof Theory, Proceedings of the Logic Colloquium '83, Lecture Notes in Math. 1104 (1984), 63-77. MR 0775709
[2] R. L. Epstein: Degrees of unsolvability: Struclure and Theory. Lecture Notes in Math. 759 (1979).
[3] C. G. Jockusch, Jr.: Degrees of generic sets. in: Recursion Theory: Its Generalizations and Applications, Proceedins of Logic Colloquium '79, London Math. Society Lecture Notes 45 (1980), 110-139. MR 0598304 | Zbl 0457.03042
[4] C. G. Jockusch, Jr. R. I. Soare: $П^0_1$ classes and degrees of theories. Trans. Amer. Math. Soc. 173 (1972), 33-56. MR 0316227
[5] A. Kučera: An aliernative, priority-free, soluiion io Posťs problem. in: Proceedings MFCS 86, Lecture Notes in Computer Scince 233 (1986), 493-500. MR 0874627
[6] M. Lerman: Degrees of unsolvability. Omega Series, Springer - Verlag (1983). MR 0708718 | Zbl 0542.03023
[7] W. Miller D. A. Martin: The degrees of hyperimmune sets. Z. Math. Logik und Gгundlag. Math. 14 (1968), 159-166. MR 0228341
[8] R. I. Soare: Recursively Enumerable Sets and Degrees: A study of Computabe Functions and Computaby Generated Sets. Omega Series, Springer-Verlag (1987). MR 0882921
Partner of
EuDML logo