{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,12]],"date-time":"2025-07-12T23:00:09Z","timestamp":1752361209019},"reference-count":11,"publisher":"Duke University Press","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Notre Dame J. Formal Logic"],"published-print":{"date-parts":[[2020,5,1]]},"DOI":"10.1215\/00294527-2020-0005","type":"journal-article","created":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T02:01:33Z","timestamp":1586224893000},"source":"Crossref","is-referenced-by-count":0,"title":["Effective Domination and the Bounded Jump"],"prefix":"10.1215","volume":"61","author":[{"given":"Keng Meng","family":"Ng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongyuan","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"73","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] Anderson, B., and B. F. Csima. \u201cA bounded jump for the bounded Turing degrees,\u201d <i>Notre Dame Journal of Formal Logic<\/i>, vol. 55 (2014), pp. 245\u201364.","DOI":"10.1215\/00294527-2420660"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] Anderson, B., B. F. Csima, and K. M. Lange, \u201cBounded low and high sets,\u201d <i>Archive for Mathematical Logic<\/i>, vol. 56 (2017), pp. 507\u201321.","DOI":"10.1007\/s00153-017-0537-8"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] Csima, B. F., R. Downey, and K. M. Ng, \u201cLimits on jump inversion for strong reducibilities,\u201d <i>Journal of Symbolic Logic<\/i>, vol. 76 (2011), pp. 1287\u201396.","DOI":"10.2178\/jsl\/1318338849"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] Downey, R., and N. Greenberg, \u201cA hierarchy of computably enumerable degrees,\u201d <i>Bulletin of Symbolic Logic<\/i>, vol. 24 (2018), pp. 53\u201389.","DOI":"10.1017\/bsl.2017.41"},{"key":"5","unstructured":"[5] Downey, R., and N. Greenberg, <i>A Transfinite Hierarchy of Lowness Notions in the Computably Enumerable Degrees, Unifying Classes, and Natural Definability<\/i>, vol. 385 of <i>Annals of Mathematics Studies<\/i>, Princeton University Press, Princeton, NJ, 2020."},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] Downey, R., N. Greenberg, and R. Weber, \u201cTotally $\\omega $-computably enumerable degrees and bounding critical triples,\u201d <i>Journal of Mathematical Logic<\/i>, vol. 7 (2007), pp. 145\u201371.","DOI":"10.1142\/S0219061307000640"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] Downey, R., C. Jockusch, and M. Stob, \u201cArray nonrecursive sets and multiple permitting arguments,\u201d pp. 141\u201373 in <i>Recursion Theory Week (Oberwolfach, 1989)<\/i>, edited by K. Ambos-Spies, G. H. M\u00fcller, and G. E. Sacks, vol. 1432 of <i>Lecture Notes in Mathematics<\/i>, Springer, Berlin, 1990.","DOI":"10.1007\/BFb0086116"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] Downey, R., A. G. Melnikov, and K. M. Ng, \u201cAbelian $p$-groups and the Halting problem,\u201d <i>Annals of Pure and Applied Logic<\/i>, vol. 167 (2016), pp. 1123\u201338.","DOI":"10.1016\/j.apal.2016.04.016"},{"key":"9","unstructured":"[9] Harris, K., \u201cThe effective content of classical theorems on saturated models,\u201d Ph.D. dissertation, University of Chicago, Chicago, 2007."},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] Ng, K. M., F. Stephan, Y. Yang, and L. Yu, \u201cThe computational aspects of hyperimmune-free degrees,\u201d pp. 271\u201384 in <i>Proceedings of the 12th Asian Logic Conference<\/i>, edited by R. Downey, J. Brendle, R. Goldblatt, and B. Kim, World Scientific, Hackensack, NJ, 2013.","DOI":"10.1142\/9789814449274_0015"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] Soare, R. I., <i>Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets<\/i>, <i>Perspectives in Mathematical Logic<\/i>, Springer, 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-2020-0005","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T21:00:10Z","timestamp":1706648410000},"score":1,"resource":{"primary":{"URL":"https:\/\/projecteuclid.org\/journals\/notre-dame-journal-of-formal-logic\/volume-61\/issue-2\/Effective-Domination-and-the-Bounded-Jump\/10.1215\/00294527-2020-0005.full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,1]]},"references-count":11,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2020,5,1]]}},"URL":"https:\/\/doi.org\/10.1215\/00294527-2020-0005","relation":{},"ISSN":["0029-4527"],"issn-type":[{"value":"0029-4527","type":"print"}],"subject":[],"published":{"date-parts":[[2020,5,1]]}}}