On n-Tardy Sets

Details On n-Tardy Sets On n-Tardy Sets

2010-12-31

arxiv.org/abs/1101.0228v1

Mathematics

Logic

Scientific paper

Harrington and Soare introduced the notion of an n-tardy set. They showed that there is a nonempty $\mathcal{E}$ property Q(A) such that if Q(A) then A is 2-tardy. Since they also showed no 2-tardy set is complete, Harrington and Soare showed that there exists an orbit of computably enumerable sets such that every set in that orbit is incomplete. Our study of n-tardy sets takes off from where Harrington and Soare left off. We answer all the open questions asked by Harrington and Soare about n-tardy sets. We show there is a 3-tardy set A that is not computed by any 2-tardy set B. We also show that there are nonempty $\mathcal{E}$ properties $Q_n(A)$ such that if $Q_n(A)$ then A is properly n-tardy.

Affiliated with

Also associated with

No associations

Rating

On n-Tardy Sets 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 On n-Tardy Sets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On n-Tardy Sets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-295806