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.

Detalles Bibliográficos
Publicado en:	Journal of Symbolic Logic Vol. 74; no. 2; pp. 517 - 535
Autores principales:	KUČERA, ANTONÍN, SLAMAN, THEODORE A.
Formato:	Artículo
Publicado:	Cambridge University Press Jun2009
Materias:	Mathematical logic Set theory Ideals (Algebra) Recursion theory Tree graphs
Acceso en línea:	Ver este registro en EBSCOhost

Descripción
Sumario:	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.