pith. sign in

arxiv: 1110.1435 · v1 · pith:RMAX4JNBnew · submitted 2011-10-07 · 🧮 math.LO

Inherent enumerability of strong jump-traceability

classification 🧮 math.LO
keywords jump-traceablestronglysetseverystrongcomputablejump-traceabilityprecisely
0
0 comments X
read the original abstract

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\"{o}f random sets; the strongly jump-traceable sets are precisely those that are a base for $\text{Demuth}_{\text{BLR}}$-randomness; and strong jump-traceability is equivalent to strong superlowness.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.