Low upper bounds of ideals

dc.creatorKucera, Antonin
dc.creatorSlaman, Theodore A.
dc.date2007-08-28
dc.date2009-02-03
dc.date.accessioned2026-07-07T12:36:40Z
dc.date.available2026-07-07T12:36:40Z
dc.descriptionWe 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.
dc.descriptionThe second version repairs the details of one argument and makes other minor corrections
dc.identifierhttps://arxiv.org/abs/0708.3793
dc.identifierhttp://arxiv.org/abs/0708.3793
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/218170
dc.subjectLogic
dc.subject03D15; 68Q30
dc.titleLow upper bounds of ideals
dc.typetext

Files

Collections