We present an overview of the topics in the title and of some of the key results
pertaining to them. These have historically been topics of interest in
computability theory and continue to be a rich source of problems and ideas. In
particular, we draw attention to the links and connections between these topics
and explore their significance to modern research in the field.
@article{1273002114,
author = {Diamondstone, David E. and Dzhafarov, Damir D. and Soare, Robert I.},
title = {$\Pi^0\_1$ Classes, Peano Arithmetic, Randomness, and Computable Domination},
journal = {Notre Dame J. Formal Logic},
volume = {51},
number = {1},
year = {2010},
pages = { 127-159},
language = {en},
url = {http://dml.mathdoc.fr/item/1273002114}
}
Diamondstone, David E.; Dzhafarov, Damir D.; Soare, Robert I. $\Pi^0_1$ Classes, Peano Arithmetic, Randomness, and Computable Domination. Notre Dame J. Formal Logic, Tome 51 (2010) no. 1, pp. 127-159. http://gdmltest.u-ga.fr/item/1273002114/