{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,12]],"date-time":"2025-09-12T17:53:59Z","timestamp":1757699639860},"reference-count":23,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2014,3,12]],"date-time":"2014-03-12T00:00:00Z","timestamp":1394582400000},"content-version":"unspecified","delay-in-days":1745,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. symb. log."],"published-print":{"date-parts":[[2009,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We show that there is a low<jats:italic>T<\/jats:italic>-upper bound for the class of<jats:italic>K<\/jats:italic>-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<jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"gif\" xlink:type=\"simple\" xlink:href=\"S0022481200003546_inline1\" \/><jats:italic>T<\/jats:italic>-degrees for which there is a low<jats:italic>T<\/jats:italic>-upper bound.<\/jats:p>","DOI":"10.2178\/jsl\/1243948325","type":"journal-article","created":{"date-parts":[[2009,6,2]],"date-time":"2009-06-02T13:12:25Z","timestamp":1243948345000},"page":"517-534","source":"Crossref","is-referenced-by-count":7,"title":["Low upper bounds of ideals"],"prefix":"10.1017","volume":"74","author":[{"given":"Anton\u00edn","family":"Ku\u010dera","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Theodore A.","family":"Slaman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2014,3,12]]},"reference":[{"key":"S0022481200003546_ref011","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2606-0"},{"key":"S0022481200003546_ref005","doi-asserted-by":"publisher","DOI":"10.2178\/bsl\/1154698741"},{"key":"S0022481200003546_ref018","volume-title":"Classical Recursion Theory, vol. II","volume":"143","author":"Odifreddi","year":"1999"},{"key":"S0022481200003546_ref021","doi-asserted-by":"publisher","DOI":"10.1016\/S0049-237X(08)71117-0"},{"key":"S0022481200003546_ref003","unstructured":"Downey R. and Hirschfeldt D. R. , Algorithmic Randomness and Complexity , Springer, to appear."},{"key":"S0022481200003546_ref023","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1969-0241295-4"},{"key":"S0022481200003546_ref001","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/257\/04023"},{"key":"S0022481200003546_ref008","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/S0049-237X(08)70130-7","volume-title":"Logic Colloquium '87 (Granada, 1987)","volume":"129","author":"Ku\u010dera","year":"1989"},{"key":"S0022481200003546_ref017","volume-title":"Classical Recursion Theory, vol. I: The Theory of Functions and Sets of Natural Numbers","volume":"125","author":"Odifreddi","year":"1989"},{"key":"S0022481200003546_ref013","doi-asserted-by":"publisher","DOI":"10.1016\/0003-4843(80)90004-2"},{"key":"S0022481200003546_ref002","doi-asserted-by":"publisher","DOI":"10.1147\/rd.214.0350"},{"key":"S0022481200003546_ref006","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/jdm041"},{"key":"S0022481200003546_ref007","first-page":"33","article-title":"\u03a010 classes and degrees of theories","volume":"173","author":"Jockusch","year":"1972","journal-title":"Transactions of the American Mathematical Society"},{"key":"S0022481200003546_ref009","first-page":"61","volume-title":"Annals of Pure and Applied Logic","volume":"63","author":"Ku\u010dera","year":"1993"},{"key":"S0022481200003546_ref012","doi-asserted-by":"publisher","DOI":"10.2178\/bsl\/1154698740"},{"key":"S0022481200003546_ref019","doi-asserted-by":"publisher","DOI":"10.2307\/1970776"},{"key":"S0022481200003546_ref014","doi-asserted-by":"publisher","DOI":"10.1016\/j.aim.2004.10.006"},{"key":"S0022481200003546_ref015","first-page":"261","volume-title":"Proceedings of Logic Colloquium '02","volume":"27","author":"Nies","year":"2006"},{"key":"S0022481200003546_ref016","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199230761.001.0001"},{"key":"S0022481200003546_ref020","doi-asserted-by":"publisher","DOI":"10.1090\/pspum\/005\/0141595"},{"key":"S0022481200003546_ref022","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-02460-7"},{"key":"S0022481200003546_ref004","doi-asserted-by":"publisher","DOI":"10.1142\/9789812705815_0005"},{"key":"S0022481200003546_ref010","first-page":"1396","volume":"64","author":"Ku\u010dera","year":"1999","journal-title":"Lownessfor the class of random sets"}],"container-title":["The Journal of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0022481200003546","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,19]],"date-time":"2020-05-19T02:08:24Z","timestamp":1589854104000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0022481200003546\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,6]]}},"alternative-id":["S0022481200003546"],"URL":"https:\/\/doi.org\/10.2178\/jsl\/1243948325","relation":{},"ISSN":["0022-4812","1943-5886"],"issn-type":[{"value":"0022-4812","type":"print"},{"value":"1943-5886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,6]]}}}