{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T11:47:43Z","timestamp":1759146463162},"reference-count":24,"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":1380,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. symb. log."],"published-print":{"date-parts":[[2010,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We give several characterizations of Schnorr trivial sets, including a new lowness notion for Schnorr triviality based on truth-table reducibility. These characterizations allow us to see not only that some natural classes of sets, including maximal sets, are composed entirely of Schnorr trivials, but also that the Schnorr trivial sets form an ideal in the truth-table degrees but not the weak truth-table degrees. This answers a question of Downey. Griffiths and LaForte.<\/jats:p>","DOI":"10.2178\/jsl\/1268917492","type":"journal-article","created":{"date-parts":[[2010,3,18]],"date-time":"2010-03-18T13:05:57Z","timestamp":1268917557000},"page":"501-521","source":"Crossref","is-referenced-by-count":20,"title":["Schnorr trivial sets and truth-table reducibility"],"prefix":"10.1017","volume":"75","author":[{"given":"Johanna N. Y.","family":"Franklin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Stephan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2014,3,12]]},"reference":[{"key":"S0022481200002656_ref011","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3860-5"},{"key":"S0022481200002656_ref023","volume-title":"Recursively enumerable sets and degrees. A study of computable functions and computably generated sets","author":"Soare","year":"1987"},{"key":"S0022481200002656_ref022","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(73)80030-3"},{"key":"S0022481200002656_ref019","volume-title":"Theory of recursive functions and effective computability","author":"Rogers","year":"1967"},{"key":"S0022481200002656_ref013","unstructured":"Mihailovi\u0107 Nenad , Algorithmic randomness, Inaugural-Dissertation, University of Heidelberg, 2007."},{"key":"S0022481200002656_ref024","volume-title":"Randomness and complexity, from Leibnitz to Chaitin","volume":"217","author":"Stephan","year":"2007"},{"key":"S0022481200002656_ref012","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(66)80018-9"},{"key":"S0022481200002656_ref008","first-page":"191","volume":"75","author":"Franklin","year":"2010","journal-title":"Schnorr triviality andgenericity"},{"key":"S0022481200002656_ref020","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1307\/mmj\/1028999130","article-title":"A maximal set which is not complete","volume":"11","author":"Sacks","year":"1964","journal-title":"Michigan Mathematical Journal"},{"key":"S0022481200002656_ref021","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0112458"},{"key":"S0022481200002656_ref004","doi-asserted-by":"publisher","DOI":"10.2178\/bsl\/1154698741"},{"key":"S0022481200002656_ref009","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/jdm041"},{"key":"S0022481200002656_ref001","first-page":"9","article-title":"On some generalizations of a fixed-point theorem","volume":"25","author":"Arslanov","year":"1981","journal-title":"Soviet Mathematics"},{"key":"S0022481200002656_ref007","doi-asserted-by":"publisher","DOI":"10.1007\/s00153-007-0061-3"},{"key":"S0022481200002656_ref015","doi-asserted-by":"publisher","DOI":"10.1016\/j.aim.2004.10.006"},{"key":"S0022481200002656_ref018","volume-title":"Classical recursion theory, Volume II","author":"Odifreddi","year":"1999"},{"key":"S0022481200002656_ref003","doi-asserted-by":"publisher","DOI":"10.1002\/malq.200310121"},{"key":"S0022481200002656_ref014","doi-asserted-by":"publisher","DOI":"10.1002\/malq.19680140704"},{"key":"S0022481200002656_ref006","first-page":"999","volume":"73","author":"Franklin","year":"2008","journal-title":"Hyperimmune-free degrees and Schnorr triviality"},{"key":"S0022481200002656_ref005","unstructured":"Franklin Johanna N. Y. , Aspects of Schnorr randomness, Ph.D. dissertation, University of California, Berkeley, 2007."},{"key":"S0022481200002656_ref016","first-page":"515","volume":"70","author":"Nies","year":"2005","journal-title":"Randomness, relativization and Turing degrees"},{"key":"S0022481200002656_ref010","doi-asserted-by":"publisher","DOI":"10.1002\/malq.19930390153"},{"key":"S0022481200002656_ref017","volume-title":"Classical recursion theory","author":"Odifreddi","year":"1989"},{"key":"S0022481200002656_ref002","first-page":"1162","article-title":"Chaitin \u03a9 numbers and strong rcducibililies","volume":"3","author":"Calude","year":"1997","journal-title":"Journal of Universal Computer Science"}],"container-title":["The Journal of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0022481200002656","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T19:37:51Z","timestamp":1556480271000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0022481200002656\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,6]]}},"alternative-id":["S0022481200002656"],"URL":"https:\/\/doi.org\/10.2178\/jsl\/1268917492","relation":{},"ISSN":["0022-4812","1943-5886"],"issn-type":[{"value":"0022-4812","type":"print"},{"value":"1943-5886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,6]]}}}