{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T17:52:40Z","timestamp":1648662760716},"reference-count":17,"publisher":"Cambridge University Press (CUP)","issue":"1","license":[{"start":{"date-parts":[[2014,3,12]],"date-time":"2014-03-12T00:00:00Z","timestamp":1394582400000},"content-version":"unspecified","delay-in-days":3663,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. symb. log."],"published-print":{"date-parts":[[2004,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We prove that a computably enumerable set <jats:italic>A<\/jats:italic> is effectively speedable (effectively levelable) if and only if there exists a splitting (<jats:italic>A<\/jats:italic><jats:sub>0<\/jats:sub>, <jats:italic>A<\/jats:italic><jats:sub>1<\/jats:sub>) of <jats:italic>A<\/jats:italic> such that both <jats:italic>A<\/jats:italic><jats:sub>0<\/jats:sub> and <jats:italic>A<\/jats:italic><jats:sub>1<\/jats:sub> are effectively speedable (effectively levelable). These results answer two questions raised by J. B. Remmel.<\/jats:p>","DOI":"10.2178\/jsl\/1080938833","type":"journal-article","created":{"date-parts":[[2005,3,2]],"date-time":"2005-03-02T21:27:59Z","timestamp":1109798879000},"page":"143-158","source":"Crossref","is-referenced-by-count":0,"title":["Splittings of effectively speedable sets and effectively levelable sets"],"prefix":"10.1017","volume":"69","author":[{"given":"Roland SH.","family":"Omanadze","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2014,3,12]]},"reference":[{"key":"S0022481200008082_ref005","first-page":"45","volume":"94","author":"Downey","year":"1998","journal-title":"Splitting theorems and the jump operator"},{"key":"S0022481200008082_ref009","first-page":"669","volume":"39","author":"Gill","year":"1974","journal-title":"On subcreative sets and S-reducibility"},{"key":"S0022481200008082_ref016","first-page":"545","volume":"42","author":"Soare","year":"1977","journal-title":"Computational complexity, speedable and levelable sets"},{"key":"S0022481200008082_ref015","volume-title":"Theory of recursive functions and effective computability","author":"Rogers","year":"1967"},{"key":"S0022481200008082_ref001","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(94)90008-6"},{"key":"S0022481200008082_ref002","doi-asserted-by":"publisher","DOI":"10.1145\/321386.321395"},{"key":"S0022481200008082_ref012","first-page":"79","article-title":"On sQ-completeness of recursively enumerable sets","volume":"52","author":"Omanadze","year":"1992","journal-title":"Matematicheskie Zametki"},{"key":"S0022481200008082_ref003","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(67)90546-3"},{"key":"S0022481200008082_ref017","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-02460-7"},{"key":"S0022481200008082_ref010","first-page":"1033","volume":"64","author":"Jahn","year":"1999","journal-title":"Implicit measuraments of dynamic complexity properties and splittings of speedable sets"},{"key":"S0022481200008082_ref006","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(93)90234-5"},{"key":"S0022481200008082_ref004","first-page":"579","volume":"38","author":"Blum","year":"1973","journal-title":"On computational complexity of recursively enumerable sets"},{"key":"S0022481200008082_ref008","doi-asserted-by":"publisher","DOI":"10.1002\/malq.19590050703"},{"key":"S0022481200008082_ref013","first-page":"425","article-title":"Complexity properties of recursively enumerable sets and sQ-completeness","volume":"62","author":"Omanadze","year":"1997","journal-title":"Matematicheskie Zametki"},{"key":"S0022481200008082_ref014","volume-title":"Computability and models: Perspectives east and west","author":"Omanadze","year":"2003"},{"key":"S0022481200008082_ref011","volume-title":"Classical recursion theory","volume":"I","author":"Odifreddi","year":"1989"},{"key":"S0022481200008082_ref007","first-page":"12","article-title":"On effectively levelable sets","volume":"2","author":"Filotti","year":"1972","journal-title":"Recursive Function Theory Newsletter"}],"container-title":["Journal of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0022481200008082","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,6]],"date-time":"2019-05-06T21:28:19Z","timestamp":1557178099000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0022481200008082\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,3]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2004,3]]}},"alternative-id":["S0022481200008082"],"URL":"https:\/\/doi.org\/10.2178\/jsl\/1080938833","relation":{},"ISSN":["0022-4812","1943-5886"],"issn-type":[{"value":"0022-4812","type":"print"},{"value":"1943-5886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,3]]}}}