Mathematics – Logic
Scientific paper
2007-08-28
Mathematics
Logic
The second version repairs the details of one argument and makes other minor corrections
Scientific paper
We show that there is a low T-upper bound for the class of K-trivial sets,
namely those which are weak from the point of view of algorithmic randomness.
This result is a special case of a more general characterization of ideals in
the T-degrees below 0' for which there is a low T-upper bound.
Kučera Antonín
Slaman Theodore A.
No associations
LandOfFree
Low upper bounds of ideals 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 Low upper bounds of ideals, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Low upper bounds of ideals will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-363199