|
|
|
|
Литература
|
|
| |
| 1. |
Downey R. G., Kach A. M., Turetsky D., “Limitwise monotonic functions and their applications”, Proceedings of the 11th Asian Logic Conference, World Sci. Publ., River Edge, N.J., 2011, 59–85  |
| 2. |
Khoussainov B., Nies A., Shore R., “Computable models of theories with few models”, Notre Dame J. Formal Logic, 38:2 (1997), 165–178   |
| 3. |
Nies A., Computability and randomness, Oxford Univ. Press, N.Y., 2009, 420 pp. |
| 4. |
Jockusch C. G. (Jr.), Soare R. I., “$\Pi^0_1$-classes and degrees of theories”, Trans. Amer. Math. Soc., 173 (1972), 33–56 |
| 5. |
Wallbaum J., Computability of algebraic structures, Ph D Thesis, University of Notre Dame, Notre Dame, Indiana, 2010 |
| 6. |
Kautz S. M., Degrees of Random Sets, Ph D Thesis, Cornell University, Ithaca, N.Y., 1991 |
| 7. |
Kautz S. M., “An improved zero-one law for algorithmically random sequences”, Theor. Comput. Sci., 191:1–2 (1998), 185–192  |
| 8. |
Stillwell J., “Decidability of the “almost all” theory of degrees”, J. Symbolic Logic, 37:3 (1972), 501–506 |
| 9. |
Kechris A., Classical Descriptive Set Theory, Springer-Verlag, N.Y., 1995, 428 pp. |
| 10. |
Oxtoby J. C., Measure and Category: A Survey of the Analogies Between Topological and Measure Spaces, Springer-Verlag, N.Y., 1980, 124 pp. |
