Π 0 1 Classes, Peano Arithmetic, Randomness, and Computable Domination (2009)
by
David E. Diamondstone
,
Damir D. Dzhafarov
,
Robert I. Soare
BibTeX
@MISC{Diamondstone09π0,
author = {David E. Diamondstone and Damir D. Dzhafarov and Robert I. Soare},
title = {Π 0 1 Classes, Peano Arithmetic, Randomness, and Computable Domination},
year = {2009}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Citations
| 123 | Algorithmic randomness and complexity - Downey, Hirschfeldt - 2010 |
| 106 | Recursively enumerable sets of positive integers and their decision problems - Post - 1944 |
| 103 | Π 0 1 classes and degrees of theories - Soare - 1972 |
| 68 | Computability and Randomness - Nies - 2009 |
| 32 | Algebras of sets binumerable in complete extensions of arithmetic - Scott - 1962 |
| 24 | Soare, Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets - I - 1987 |
| 14 | The degrees of hyperimmune sets - Martin, Miller - 1968 |
| 11 | A theorem on hypersimple sets - Dekker - 1954 |
| 11 | Lowness for the Class of Schnorr Random Reals - Kjos-Hanssen, Nies, et al. - 2005 |
| 2 | Ramsey’s Theorem and cone avoidance, this - Dzhafarov, Jockusch |
| 1 | Soare, A minimal pair - I - 1971 |
| 1 | Randomness, relativization and Turing degrees, (234 - Nies, Stephan, et al. |
