{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:31:32Z","timestamp":1725532292343},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642020162"},{"type":"electronic","value":"9783642020179"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02017-9_44","type":"book-chapter","created":{"date-parts":[[2009,5,11]],"date-time":"2009-05-11T11:38:06Z","timestamp":1242041886000},"page":"420-429","source":"Crossref","is-referenced-by-count":0,"title":["Embedding the Diamond Lattice in the c.e. tt-Degrees with Superhigh Atoms"],"prefix":"10.1007","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","reference":[{"key":"44_CR1","doi-asserted-by":"publisher","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\u00a04, 31\u201373 (1972)","journal-title":"Ann. Math. Logic"},{"key":"44_CR2","doi-asserted-by":"publisher","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. London Math. Soc.\u00a021, 43\u201350 (1989)","journal-title":"Bull. London Math. Soc."},{"key":"44_CR3","doi-asserted-by":"crossref","unstructured":"Epstein, R.L.: Minimal degrees of unsolvability and the full approximation construction. Mem. Amer. Math. Soc.\u00a0162(3) (1975)","DOI":"10.1090\/memo\/0162"},{"key":"44_CR4","doi-asserted-by":"publisher","first-page":"123","DOI":"10.2307\/2044964","volume":"94","author":"C.G. Jockusch Jr.","year":"1985","unstructured":"Jockusch Jr., C.G., Mohrherr, J.: Embedding the diamond lattice in the recursively enumerable truth-table degrees. Proc. Amer. Math. Soc.\u00a094, 123\u2013128 (1985)","journal-title":"Proc. Amer. Math. Soc."},{"key":"44_CR5","doi-asserted-by":"publisher","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. London Math. Soc.\u00a016, 537\u2013569 (1966)","journal-title":"Proc. London Math. Soc."},{"key":"44_CR6","doi-asserted-by":"publisher","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.\u00a012, 295\u2013310 (1966)","journal-title":"Z. Math. Logik Grundlag. Math."},{"key":"44_CR7","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1002\/malq.19860320103","volume":"32","author":"J. Mohrherr","year":"1986","unstructured":"Mohrherr, J.: A refinement of low\n                    n\n                   and high\n                    n\n                   for the r.e. degrees. Z. Math. Logik Grundlag. Math.\u00a032, 5\u201312 (1986)","journal-title":"Z. Math. Logik Grundlag. Math."},{"key":"44_CR8","doi-asserted-by":"publisher","first-page":"309","DOI":"10.2178\/jsl\/1208358755","volume":"73","author":"K.M. Ng","year":"2008","unstructured":"Ng, K.M.: On Very High Degrees. Jour. Symb. Logic\u00a073, 309\u2013342 (2008)","journal-title":"Jour. Symb. Logic"},{"key":"44_CR9","doi-asserted-by":"publisher","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.\u00a053, 462\u2013482 (2007)","journal-title":"Math. Log. Q."},{"key":"44_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":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02017-9_44.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T06:17:35Z","timestamp":1619763455000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02017-9_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642020162","9783642020179"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02017-9_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}