{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T21:10:30Z","timestamp":1706649030699},"reference-count":15,"publisher":"Duke University Press","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Notre Dame J. Formal Logic"],"published-print":{"date-parts":[[2009,10,1]]},"DOI":"10.1215\/00294527-2009-022","type":"journal-article","created":{"date-parts":[[2010,2,11]],"date-time":"2010-02-11T14:39:11Z","timestamp":1265899151000},"source":"Crossref","is-referenced-by-count":0,"title":["On the Degrees of Diagonal Sets and the Failure of the Analogue of a Theorem of Martin"],"prefix":"10.1215","volume":"50","author":[{"given":"Keng Meng","family":"Ng","sequence":"first","affiliation":[]}],"member":"73","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] Ambos-Spies, K., \"Contiguous r.e. degrees\", pp. 1--37 in <i>Computation and Proof Theory (Aachen, 1983)<\/i>, vol. 1104 of <i>Lecture Notes in Mathematics<\/i>, Springer, Berlin, 1984.","DOI":"10.1007\/BFb0099477"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] Cholak, P., R. Downey, and E. Herrmann, \"Some orbits for $\\mathcalE$\", <i>Annals of Pure and Applied Logic<\/i>, vol. 107 (2001), pp. 193--226.","DOI":"10.1016\/S0168-0072(00)00060-9"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] Cholak, P. A., R. Downey, and L. A. Harrington, \"The complexity of orbits of computably enumerable sets\", <i>Bulletin of Symbolic Logic<\/i>, vol. 14 (2008), pp. 69--87.","DOI":"10.2178\/bsl\/1208358844"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] Downey, R. G., \"$\\Delta\\sp 0\\sb 2$\" degrees and transfer theorems\", <i>Illinois Journal of Mathematics<\/i>, vol. 31 (1987), pp. 419--27.","DOI":"10.1215\/ijm\/1256069291"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] Downey, R. G., and M. Stob, \"Automorphisms of the lattice of recursively enumerable sets: Orbits\", <i>Advances in Mathematics<\/i>, vol. 92 (1992), pp. 237--65.","DOI":"10.1016\/0001-8708(92)90065-S"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] Downey, R., and L. Harrington, \"There is no fat orbit\", <i>Annals of Pure and Applied Logic<\/i>, vol. 80 (1996), pp. 277--89.","DOI":"10.1016\/0168-0072(96)83748-1"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] Downey, R., and M. Stob, \"Splitting theorems in recursion theory\", <i>Annals of Pure and Applied Logic<\/i>, vol. 65 (1993), pp. 1--106.","DOI":"10.1016\/0168-0072(93)90234-5"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] Downey, R., and M. Stob, \"Jumps of hemimaximal sets\", <i>Zeitschrift f\u00fcr mathematische Logik und Grundlagen der Mathematik<\/i>, vol. 37 (1991), pp. 113--20.","DOI":"10.1002\/malq.19910370802"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] Friedberg, R. M., \"Three theorems on recursive enumeration. I. Decomposition. II\". Maximal set. III. Enumeration without duplication, <i>The Journal of Symbolic Logic<\/i>, vol. 23 (1958), pp. 309--16.","DOI":"10.2307\/2964290"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] Herrmann, E., and M. Kummer, \"Diagonals and $\\mathcalD$-maximal sets\", <i>The Journal of Symbolic Logic<\/i>, vol. 59 (1994), pp. 60--72.","DOI":"10.2307\/2275249"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] Kummer, M., \"Diagonals and semihyperhypersimple sets\", <i>The Journal of Symbolic Logic<\/i>, vol. 56 (1991), pp. 1068--74.","DOI":"10.2178\/jsl\/1183743752"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] Lachlan, A. H., \"On the lattice of recursively enumerable sets\", <i>Transactions of the American Mathematical Society<\/i>, vol. 130 (1968), pp. 1--37.","DOI":"10.2307\/1994768"},{"key":"13","doi-asserted-by":"publisher","unstructured":"[13] Martin, D. A., \"Classes of recursively enumerable sets and degrees of unsolvability\", <i>Zeitschrift f\u00fcr mathematische Logik und Grundlagen der Mathematik<\/i>, vol. 12 (1966), pp. 295--310.","DOI":"10.1002\/malq.19660120125"},{"key":"14","doi-asserted-by":"publisher","unstructured":"[14] Soare, R. I., \"Automorphisms of the lattice of recursively enumerable sets. I. Maximal sets\", <i>Annals of Mathematics. Second Series<\/i>, vol. 100 (1974), pp. 80--120.","DOI":"10.2307\/1970842"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] Soare, R. I., <i>Recursively Enumerable Sets and Degrees. A Study of Computable Functions and Computably Generated Sets<\/i>, Perspectives in Mathematical Logic. Springer-Verlag, Berlin, 1987.","DOI":"10.1007\/978-3-662-02460-7"}],"container-title":["Notre Dame Journal of Formal Logic"],"original-title":[],"link":[{"URL":"https:\/\/projecteuclid.org\/journalArticle\/Download?urlid=10.1215\/00294527-2009-022","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T20:57:22Z","timestamp":1706648242000},"score":1,"resource":{"primary":{"URL":"https:\/\/projecteuclid.org\/journals\/notre-dame-journal-of-formal-logic\/volume-50\/issue-4\/On-the-Degrees-of-Diagonal-Sets-and-the-Failure-of\/10.1215\/00294527-2009-022.full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,10,1]]},"references-count":15,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2009,10,1]]}},"URL":"https:\/\/doi.org\/10.1215\/00294527-2009-022","relation":{},"ISSN":["0029-4527"],"issn-type":[{"value":"0029-4527","type":"print"}],"subject":[],"published":{"date-parts":[[2009,10,1]]}}}