{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T10:44:01Z","timestamp":1656240241220},"reference-count":12,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2013,5,1]],"date-time":"2013-05-01T00:00:00Z","timestamp":1367366400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2017,5,1]],"date-time":"2017-05-01T00:00:00Z","timestamp":1493596800000},"content-version":"vor","delay-in-days":1461,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100000947","name":"Australian Cancer Research Foundation","doi-asserted-by":"publisher","award":["ARC 17\/11","M45110030","M52110101","MOE2011-T2-1-071","RG37\/09"],"id":[{"id":"10.13039\/501100000947","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001352","name":"National University of Singapore","doi-asserted-by":"publisher","award":["R252-000-308-112","R252-000-420-112"],"id":[{"id":"10.13039\/501100001352","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001459","name":"Ministry of Education - Singapore","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001459","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Pure and Applied Logic"],"published-print":{"date-parts":[[2013,5]]},"DOI":"10.1016\/j.apal.2012.11.008","type":"journal-article","created":{"date-parts":[[2012,12,4]],"date-time":"2012-12-04T16:32:53Z","timestamp":1354638773000},"page":"511-522","source":"Crossref","is-referenced-by-count":0,"title":["Highness, locally noncappability and nonboundings"],"prefix":"10.1016","volume":"164","author":[{"given":"Frank","family":"Stephan","sequence":"first","affiliation":[]},{"given":"Guohua","family":"Wu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.apal.2012.11.008_br0010","doi-asserted-by":"crossref","first-page":"655","DOI":"10.2307\/2272849","article-title":"Minimal pairs and high recursively enumerable degrees","volume":"39","author":"Cooper","year":"1974","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/j.apal.2012.11.008_br0020","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1002\/malq.19930390151","article-title":"Highness and bounding minimal pairs","volume":"39","author":"Downey","year":"1993","journal-title":"Math. Log. Q."},{"key":"10.1016\/j.apal.2012.11.008_br0030","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF02773633","article-title":"Minimal pairs in initial segments of the recursively enumerable degrees","volume":"100","author":"Downey","year":"1997","journal-title":"Israel J. Math."},{"key":"10.1016\/j.apal.2012.11.008_br0040","series-title":"Logic Year 1979\u201380: University of Connecticut","first-page":"49","article-title":"The plus-cupping theorem for the recursively enumerable degrees","volume":"vol. 859","author":"Fejer","year":"1981"},{"key":"10.1016\/j.apal.2012.11.008_br0050","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/s00153-003-0187-x","article-title":"The computably enumerable degrees are locally non-cappable","volume":"43","author":"Giorgi","year":"2004","journal-title":"Arch. Math. Logic"},{"key":"10.1016\/j.apal.2012.11.008_br0060","series-title":"Set Theory of the Continuum, Proceedings of Workshop on Set Theory and the Continuum","first-page":"39","article-title":"Games in recursion theory and continuity properties of capping degrees","author":"Harrington","year":"1992"},{"key":"10.1016\/j.apal.2012.11.008_br0070","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0168-0072(95)00044-5","article-title":"Nonbounding and Slaman triples","volume":"79","author":"Leonhardi","year":"1996","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/j.apal.2012.11.008_br0080","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0168-0072(86)90022-9","article-title":"Degrees which do not bound minimal degrees","volume":"30","author":"Lerman","year":"1986","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/j.apal.2012.11.008_br0090","series-title":"Classical Recursion Theory","author":"Odifreddi","year":"1989"},{"key":"10.1016\/j.apal.2012.11.008_br0100","unstructured":"D. Seetapun, Contributions to Recursion Theory, PhD Thesis, Trinity College, 1991."},{"key":"10.1016\/j.apal.2012.11.008_br0110","doi-asserted-by":"crossref","first-page":"824","DOI":"10.2307\/2275099","article-title":"Working below a high recursively enumerable degrees","volume":"58","author":"Shore","year":"1993","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/j.apal.2012.11.008_br0120","series-title":"Recursively Enumerable Sets and Degrees","author":"Soare","year":"1987"}],"container-title":["Annals of Pure and Applied Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0168007212001893?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0168007212001893?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T10:07:55Z","timestamp":1656238075000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0168007212001893"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5]]},"references-count":12,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2013,5]]}},"alternative-id":["S0168007212001893"],"URL":"https:\/\/doi.org\/10.1016\/j.apal.2012.11.008","relation":{},"ISSN":["0168-0072"],"issn-type":[{"value":"0168-0072","type":"print"}],"subject":[],"published":{"date-parts":[[2013,5]]}}}