{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:00:42Z","timestamp":1725552042250},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540340218"},{"type":"electronic","value":"9783540340225"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11750321_65","type":"book-chapter","created":{"date-parts":[[2006,5,4]],"date-time":"2006-05-04T06:11:16Z","timestamp":1146723076000},"page":"694-703","source":"Crossref","is-referenced-by-count":0,"title":["Immunity Properties and the n-C.E. Hierarchy"],"prefix":"10.1007","author":[{"given":"Bahareh","family":"Afshari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George","family":"Barmpalias","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. Barry","family":"Cooper","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"65_CR1","unstructured":"Afshari, B., Barmpalias, G., Cooper, S.B.: Characterising the highness of d.c.e. degrees (in preparation)"},{"issue":"8","key":"65_CR2","doi-asserted-by":"publisher","first-page":"1045","DOI":"10.1007\/s00153-005-0288-9","volume":"44","author":"G. Barmpalias","year":"2005","unstructured":"Barmpalias, G.: Hypersimplicity and Semicomputability in the Weak Truth Table Degrees. Archive for Math. Logic\u00a044(8), 1045\u20131065 (2005)","journal-title":"Archive for Math. Logic"},{"key":"65_CR3","unstructured":"Barmpalias, G., Lewis, A.: The Hypersimple-free c.e. wtt degrees are dense in the c.e. wtt degrees, to appear in Notre Dame Journal of Formal Logic"},{"key":"65_CR4","volume-title":"Computability Theory","author":"S.B. Cooper","year":"2004","unstructured":"Cooper, S.B.: Computability Theory. Chapman & Hall\/ CRC Press, Boca Raton (2004)"},{"key":"65_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1090\/S0002-9947-1968-0227009-1","volume":"130","author":"A.H. Lachlan","year":"1968","unstructured":"Lachlan, A.H.: On the lattice of recursively enumerable sets. Trans. Am. Math. Soc.\u00a0130, 1\u201337 (1968)","journal-title":"Trans. Am. Math. Soc."},{"key":"65_CR6","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1002\/malq.19660120125","volume":"12","author":"D.A. Martin","year":"1966","unstructured":"Martin, D.A.: 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":"65_CR7","unstructured":"Odifreddi, P.: Classical recursion theory, vol.\u00a0I,II. North- Holland, Amsterdam (1989, 1999)"},{"key":"65_CR8","doi-asserted-by":"publisher","first-page":"173","DOI":"10.2307\/2271654","volume":"32","author":"J.C. Owings","year":"1967","unstructured":"Owings, J.C.: Recursion, metarecursion and inclusion. Journal of Symbolic Logic\u00a032, 173\u2013178 (1967)","journal-title":"Journal of Symbolic Logic"},{"key":"65_CR9","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1090\/S0002-9904-1944-08111-1","volume":"50","author":"E.L. Post","year":"1944","unstructured":"Post, E.L.: Recursively enumerable sets of positive integers and their decision problems. Bull. Am. Math. Soc.\u00a050, 284\u2013316 (1944)","journal-title":"Bull. Am. Math. Soc."},{"key":"65_CR10","doi-asserted-by":"publisher","first-page":"695","DOI":"10.2307\/2272046","volume":"41","author":"J.R. Shoenfield","year":"1976","unstructured":"Shoenfield, J.R.: Degrees of classes of r.e. sets. J. Symbolic Logic\u00a041, 695\u2013696 (1976)","journal-title":"J. Symbolic Logic"},{"key":"65_CR11","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, Berlin (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\/11750321_65.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:56:51Z","timestamp":1619506611000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11750321_65"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540340218","9783540340225"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11750321_65","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}