LOW UPPER BOUNDS OF IDEALS.

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 Δ T-degrees for which there is slow T-upper bound.

Bibliographic Details
Published in:	Journal of Symbolic Logic Vol. 74; no. 2; pp. 517 - 535
Main Authors:	KUČERA, ANTONÍN, SLAMAN, THEODORE A.
Format:	Article
Published:	Cambridge University Press Jun2009
Subjects:	Mathematical logic Set theory Ideals (Algebra) Recursion theory Tree graphs
Online Access:	View this record in EBSCOhost

Description
Summary:	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 Δ T-degrees for which there is slow T-upper bound.