Inherent enumerability of strong jump-traceability

David Diamondstone, Noam Greenberg, Daniel D. Turetsky
2014 Transactions of the American Mathematical Society  
We show that every strongly jump-traceable set obeys every benign cost function. Moreover, we show that every strongly jump-traceable set is computable from a computably enumerable strongly jump-traceable set. This allows us to generalise properties of c.e. strongly jump-traceable sets to all such sets. For example, the strongly jump-traceable sets induce an ideal in the Turing degrees; the strongly jump-traceable sets are precisely those that are computable from all superlow Martin-Löf random
more » ... ets; the strongly jumptraceable sets are precisely those that are a base for Demuth BLR -randomness; and strong jump-traceability is equivalent to strong superlowness.
doi:10.1090/s0002-9947-2014-06089-3 fatcat:a6yfjsocibch3drlnqdwwz3lhy