Inherent enumerability of strong jump-traceability

Mathematics – Logic

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

25 pages

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Inherent enumerability of strong jump-traceability does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Inherent enumerability of strong jump-traceability, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Inherent enumerability of strong jump-traceability will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-132480

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.