{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T05:54:23Z","timestamp":1774590863069,"version":"3.50.1"},"reference-count":14,"publisher":"Duke University Press","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Notre Dame J. Formal Logic"],"published-print":{"date-parts":[[2019,11,1]]},"DOI":"10.1215\/00294527-2019-0028","type":"journal-article","created":{"date-parts":[[2019,9,12]],"date-time":"2019-09-12T02:01:01Z","timestamp":1568253661000},"source":"Crossref","is-referenced-by-count":9,"title":["On the Degree Structure of Equivalence Relations Under Computable Reducibility"],"prefix":"10.1215","volume":"60","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] Andrews, U., S. Lempp, J. S. Miller, K. M. Ng, L. San Marco, and A. Sorbi, \u201cUniversal computably enumerable equivalence relations,\u201d <i>Journal of Symbolic Logic<\/i>, vol. 79 (2014), pp. 60\u201388.","DOI":"10.1017\/jsl.2013.8"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] Bernardi, C., and A. Sorbi, \u201cClassifying positive equivalence relations,\u201d <i>Journal of Symbolic Logic<\/i>, vol. 48 (1983), pp. 529\u201338.","DOI":"10.2307\/2273443"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] Calvert, W., D. Cummins, J. F. Knight, and S. Miller, \u201cComparing classes of finite structures\u201d (in Russian), <i>Algebra i Logika<\/i>, vol. 43 (2004), pp. 666\u2013701; English translation in <i>Algebra and Logic<\/i>, vol. 43 (2004), pp. 374\u201392.","DOI":"10.1023\/B:ALLO.0000048827.30718.2c"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] Calvert, W., and J. F. Knight, \u201cClassification from a computable viewpoint,\u201d <i>Bulletin of Symbolic Logic<\/i>, vol. 12 (2006), pp. 191\u2013218.","DOI":"10.2178\/bsl\/1146620059"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] Coskey, S., J. D. Hamkins, and R. Miller, \u201cThe hierarchy of equivalence relations on the natural numbers under computable reducibility,\u201d <i>Computability<\/i>, vol. 1 (2012), pp. 15\u201338.","DOI":"10.3233\/COM-2012-004"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] Ershov, Y. I., \u201cTheory of numberings,\u201d pp. 473\u2013503 in <i>Handbook of Computability Theory<\/i>, edited by E. R. Griffor, vol. 140 of <i>Studies in Logic and the Foundations of Mathematics<\/i>, North-Holland, Amsterdam, 1999.","DOI":"10.1016\/S0049-237X(99)80030-5"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] Fokina, E. B., and S.-D. Friedman, \u201cEquivalence relations on classes of computable structures,\u201d pp. 198\u2013207 in <i>Mathematical Theory and Computational Practice<\/i>, edited by K. Ambos-Spies, B. L\u00f6we, and W. Merkle, vol. 5635 of <i>Lecture Notes in Computer Science<\/i>, Springer, Berlin, 2009.","DOI":"10.1007\/978-3-642-03073-4_21"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] Friedman, H., and L. Stanley, \u201cA Borel reducibility theory for classes of countable structures,\u201d <i>Journal of Symbolic Logic<\/i>, vol. 54 (1989), pp. 894\u2013914.","DOI":"10.2307\/2274750"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] Gao, S., and P. Gerdes, \u201cComputably enumerable equivalence relations,\u201d <i>Studia Logica<\/i>, vol. 67 (2001), pp. 27\u201359.","DOI":"10.1023\/A:1010521410739"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] Ianovski, E., R. Miller, K. M. Ng, and A. Nies, \u201cComplexity of equivalence relations and preorders from computability theory,\u201d <i>Journal of Symbolic Logic<\/i>, vol. 79 (2014), pp. 859\u201381.","DOI":"10.1017\/jsl.2013.33"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] Lachlan, A. H., \u201cInitial segments of one-one degrees,\u201d <i>Pacific Journal of Mathematics<\/i>, vol. 29 (1969), pp. 351\u201366.","DOI":"10.2140\/pjm.1969.29.351"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] Miller, R., and K. M. Ng, \u201cFinitary reducibility on equivalence relations,\u201d <i>Journal of Symbolic Logic<\/i>, vol. 81 (2016), pp. 1225\u201354.","DOI":"10.1017\/jsl.2016.23"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] Soare, R. I., <i>Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets, Perspectives in Mathematical Logic<\/i>, Springer, Berlin, 1987.","DOI":"10.1007\/978-3-662-02460-7"},{"key":"14","unstructured":"[14] Young, P. R., \u201cNotes on the structure of recursively enumerable sets,\u201d Ph.D. dissertation, Massachusetts Institute of Technology, Cambridge, Mass., 1963."}],"container-title":["Notre Dame Journal of Formal Logic"],"original-title":[],"link":[{"URL":"https:\/\/projecteuclid.org\/journalArticle\/Download?urlid=10.1215\/00294527-2019-0028","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T20:59:58Z","timestamp":1706648398000},"score":1,"resource":{"primary":{"URL":"https:\/\/projecteuclid.org\/journals\/notre-dame-journal-of-formal-logic\/volume-60\/issue-4\/On-the-Degree-Structure-of-Equivalence-Relations-Under-Computable-Reducibility\/10.1215\/00294527-2019-0028.full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,1]]},"references-count":14,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2019,11,1]]}},"URL":"https:\/\/doi.org\/10.1215\/00294527-2019-0028","relation":{},"ISSN":["0029-4527"],"issn-type":[{"value":"0029-4527","type":"print"}],"subject":[],"published":{"date-parts":[[2019,11,1]]}}}