{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,29]],"date-time":"2023-10-29T18:00:08Z","timestamp":1698602408615},"reference-count":12,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1990,12,1]],"date-time":"1990-12-01T00:00:00Z","timestamp":660009600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8264,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1990,12]]},"DOI":"10.1016\/0022-0000(90)90024-f","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"321-366","source":"Crossref","is-referenced-by-count":16,"title":["On the theory of the PTIME degrees of the recursive sets"],"prefix":"10.1016","volume":"41","author":[{"given":"Juichi","family":"Shinoda","sequence":"first","affiliation":[]},{"given":"Theodore A.","family":"Slaman","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(90)90024-F_BIB1","unstructured":"K. Ambos-Spies, Minimal pairs for polynomial time reducibilities, to appear."},{"key":"10.1016\/0022-0000(90)90024-F_BIB2","series-title":"Proceedings, Third Annual ACM Sympos. on Theory of Comput.","first-page":"151","article-title":"The complexity of theorem proving procedures","author":"Cook","year":"1971"},{"key":"10.1016\/0022-0000(90)90024-F_BIB3","unstructured":"M. J. Groszek and T. A. Slaman, Foundations of the priority method I: Finite and infinite injury, to appear."},{"key":"10.1016\/0022-0000(90)90024-F_BIB4","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1090\/S0273-0979-1982-14970-9","article-title":"The undecidability of the recursively enumerable degrees","volume":"6","author":"Harrington","year":"1982","journal-title":"Bull. Amer. Math. Soc. (N. S.)"},{"key":"10.1016\/0022-0000(90)90024-F_BIB5","unstructured":"L. A. Harrington and T. A. Slaman, Interpreting arithmetic in the Turing degrees of the recursively enumerable sets, to appear."},{"key":"10.1016\/0022-0000(90)90024-F_BIB6","doi-asserted-by":"crossref","first-page":"379","DOI":"10.2307\/1969708","article-title":"The upper sem-lattice of degrees of recursive unsolvability","volume":"59","author":"Kleene","year":"1954","journal-title":"Ann. of Math."},{"key":"10.1016\/0022-0000(90)90024-F_BIB7","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1145\/321864.321877","article-title":"On the structure of polynomial time reducibility","volume":"22","author":"Ladner","year":"1975","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(90)90024-F_BIB8","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0003-4843(80)90004-2","article-title":"Reducibility orderings: Theories, definability and automorphisms","volume":"18","author":"Nerode","year":"1980","journal-title":"Ann. Math. Logic"},{"issue":"2","key":"10.1016\/0022-0000(90)90024-F_BIB9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1112\/jlms\/s2-24.1.1","article-title":"The theory of the degrees below 0\u2032","volume":"24","author":"Shore","year":"1981","journal-title":"J. London Math. Soc."},{"key":"10.1016\/0022-0000(90)90024-F_BIB10","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1215\/ijm\/1256044641","article-title":"Definability in the Turing degrees","volume":"30","author":"Slaman","year":"1986","journal-title":"Illinois J. Math."},{"key":"10.1016\/0022-0000(90)90024-F_BIB11","article-title":"Recursively Enumerable Sets and Degrees","author":"Shore","year":"1987"},{"key":"10.1016\/0022-0000(90)90024-F_BIB12","doi-asserted-by":"crossref","first-page":"581","DOI":"10.2307\/1969604","article-title":"On degrees of recursive unsolvability","volume":"64","author":"Spector","year":"1958","journal-title":"Ann. of Math."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009090024F?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009090024F?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,27]],"date-time":"2020-03-27T16:29:28Z","timestamp":1585326568000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002200009090024F"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,12]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1990,12]]}},"alternative-id":["002200009090024F"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(90)90024-f","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1990,12]]}}}