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.
| Publicado en: | Journal of Symbolic Logic Vol. 74; no. 2; pp. 517 - 535 |
|---|---|
| Autores principales: | , |
| Formato: | Artículo |
| Publicado: |
Cambridge University Press
Jun2009
|
| Materias: | |
| Acceso en línea: | Ver este registro en EBSCOhost |
| fields | @attributes: recordID: 1 pdfLink: plink: https://search.ebscohost.com/login.aspx?direct=true&db=hlh&AN=40309920&site=ehost-live header: @attributes: shortDbName: hlh uiTerm: 40309920 longDbName: Humanities International Complete uiTag: AN controlInfo: bkinfo: jinfo: jid: 00224812 3TY jtl: Journal of Symbolic Logic issn: 00224812 maglogo: N pubinfo: dt: Jun2009 vid: 74 iid: 2 pid: 15979 pub: Cambridge University Press artinfo: ui: 40309920 ppf: 517 ppct: 18 formats: tig: atl: LOW UPPER BOUNDS OF IDEALS. aug: au: KUČERA, ANTONÍN SLAMAN, THEODORE A. affil: CHARLES UNIVERSITY, FACULTY OF MATHEMATICS AND PHYSICS, DEPARTMENT OF THEORETICAL COMPUTER SCIENCE, AND MATHEMATICAL LOGIC, MALOSTRANSKÉ NÁM, 25, 11800 PRAHA I. CZECH REPUBLIC. UNIVERSITY OF CALIFORNIA, BERKELEY, DEPARTMENT OF MATHEMATICS, BERKELEY, CA 94720-3840 USA. su: Mathematical logic Set theory Ideals (Algebra) Recursion theory Tree graphs sug: subj: Mathematical logic Set theory Ideals (Algebra) Recursion theory Tree graphs ab: 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. pubtype: Academic Journal doctype: Article src: R language: English refInfo: copyright: @attributes: flag: Y dt: @attributes: year: 2009 holdings: @attributes: islocal: N |
|---|