{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T11:45:02Z","timestamp":1649072702968},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2010,7,15]],"date-time":"2010-07-15T00:00:00Z","timestamp":1279152000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Arch. Math. Logic"],"published-print":{"date-parts":[[2011,2]]},"DOI":"10.1007\/s00153-010-0198-3","type":"journal-article","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T19:47:38Z","timestamp":1279136858000},"page":"33-44","source":"Crossref","is-referenced-by-count":1,"title":["A superhigh diamond in the c.e. tt-degrees"],"prefix":"10.1007","volume":"50","author":[{"given":"Douglas","family":"Cenzer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johanna N. Y.","family":"Franklin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiang","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guohua","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,7,15]]},"reference":[{"key":"198_CR1","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0003-4843(72)90011-3","volume":"4","author":"S.B. Cooper","year":"1972","unstructured":"Cooper S.B.: Degrees of unsolvability complementary between recursively enumerable degrees I. Ann. Math. Logic 4, 31\u201373 (1972)","journal-title":"Ann. Math. Logic"},{"key":"198_CR2","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1112\/blms\/21.1.43","volume":"21","author":"R. Downey","year":"1989","unstructured":"Downey R.: D.r.e. degrees and the nondiamond theorem. Bull. Lond. Math. Soc. 21, 43\u201350 (1989)","journal-title":"Bull. Lond. Math. Soc."},{"key":"198_CR3","doi-asserted-by":"crossref","unstructured":"Epstein, R.L.: Minimal degrees of unsolvability and the full approximation construction. Mem. Amer. Math. Soc., 162(3), (1975)","DOI":"10.1090\/memo\/0162"},{"key":"198_CR4","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1090\/S0002-9939-1985-0781069-3","volume":"94","author":"C.G. Jockusch Jr","year":"1985","unstructured":"Jockusch C.G. Jr, Mohrherr J.: Embedding the diamond lattice in the recursively enumerable truth-table degrees. Proc. Amer. Math. Soc. 94, 123\u2013128 (1985)","journal-title":"Proc. Amer. Math. Soc."},{"key":"198_CR5","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1112\/plms\/s3-16.1.537","volume":"16","author":"A.H. Lachlan","year":"1966","unstructured":"Lachlan A.H.: Lower bounds for pairs of recursively enumerable degrees. Proc. Lond. Math. Soc. 16, 537\u2013569 (1966)","journal-title":"Proc. Lond. Math. Soc."},{"key":"198_CR6","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1002\/malq.19660120125","volume":"12","author":"D. Martin","year":"1966","unstructured":"Martin D.: Classes of recursively enumerable sets and degrees of unsolvability. Z. Math. Logik Grundlag. Math. 12, 295\u2013310 (1966)","journal-title":"Z. Math. Logik Grundlag. Math."},{"key":"198_CR7","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1002\/malq.19860320103","volume":"32","author":"J. Mohrherr","year":"1986","unstructured":"Mohrherr J.: A refinement of\u00a0 low n and high n for the r.e. degrees. Z. Math. Logik Grundlag. Math. 32, 5\u201312 (1986)","journal-title":"Z. Math. Logik Grundlag. Math."},{"key":"198_CR8","doi-asserted-by":"crossref","first-page":"309","DOI":"10.2178\/jsl\/1208358755","volume":"73","author":"K.M. Ng","year":"2008","unstructured":"Ng K.M.: On very high degrees. J. Symb. Logic 73, 309\u2013342 (2008)","journal-title":"J. Symb. Logic"},{"key":"198_CR9","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1002\/malq.200710012","volume":"53","author":"S.G. Simpson","year":"2007","unstructured":"Simpson S.G.: Almost everywhere domination and superhighness. Math. Log. Q. 53, 462\u2013482 (2007)","journal-title":"Math. Log. Q."},{"key":"198_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02460-7","volume-title":"Recursively Enumerable Sets and Degrees","author":"R.I. Soare","year":"1987","unstructured":"Soare R.I.: Recursively Enumerable Sets and Degrees. Springer, Heidelberg (1987)"}],"container-title":["Archive for Mathematical Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-010-0198-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00153-010-0198-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-010-0198-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T02:09:40Z","timestamp":1559268580000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00153-010-0198-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7,15]]},"references-count":10,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2011,2]]}},"alternative-id":["198"],"URL":"https:\/\/doi.org\/10.1007\/s00153-010-0198-3","relation":{},"ISSN":["0933-5846","1432-0665"],"issn-type":[{"value":"0933-5846","type":"print"},{"value":"1432-0665","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,7,15]]}}}