{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T11:11:53Z","timestamp":1758280313802},"reference-count":18,"publisher":"Duke University Press","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Notre Dame J. Formal Logic"],"published-print":{"date-parts":[[2018,1,1]]},"DOI":"10.1215\/00294527-2017-0015","type":"journal-article","created":{"date-parts":[[2017,6,30]],"date-time":"2017-06-30T02:05:09Z","timestamp":1498788309000},"source":"Crossref","is-referenced-by-count":3,"title":["Classifications of Computable Structures"],"prefix":"10.1215","volume":"59","author":[{"given":"Karen","family":"Lange","sequence":"first","affiliation":[]},{"given":"Russell","family":"Miller","sequence":"additional","affiliation":[]},{"given":"Rebecca M.","family":"Steiner","sequence":"additional","affiliation":[]}],"member":"73","reference":[{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] Frolov, A., I. Kalimullin, and R. Miller, \u201cSpectra of algebraic fields and subfields,\u201d pp. 232\u201341, in <i>Mathematical Theory and Computational Practice: Fifth Conference on Computability in Europe, CiE 2009<\/i>, edited by K. Ambos-Spies, B. L\u00f6we, and W. Merkle, vol. 5635 of <i>Lecture Notes in Computer Science<\/i>, Berlin, Springer, 2009. (For Appendix A, see <a href=\"qcpages.qc.cuny.edu\/~rmiller\/research.html\">qcpages.qc.cuny.edu\/~rmiller\/research.html<\/a>).","DOI":"10.1007\/978-3-642-03073-4_24"},{"key":"1","unstructured":"[1] Ash, C., and J. F. Knight, <i>Computable Structures and the Hyperarithmetical Hierarchy<\/i>, Amsterdam, North-Holland, 2000."},{"key":"2","unstructured":"[2] Calvert, W., \u201cAlgebraic structure and computable structure,\u201d Ph.D. dissertation, University of Notre Dame, Notre Dame, Indiana, 2005."},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] Calvert, W., D. Cenzer, V. Harizanov, and A. Morozov, \u201cEffective categoricity of equivalence structures,\u201d <i>Annals of Pure and Applied Logic<\/i>, vol. 141 (2006), pp. 306\u201325.","DOI":"10.1016\/j.apal.2005.10.002"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] Calvert, W., V. Harizanov, J. F. Knight, and S. Miller, \u201cIndex sets for computable structures,\u201d <i>Algebra and Logic<\/i>, vol. 45 (2006), pp. 61\u201378.","DOI":"10.1007\/s10469-006-0029-0"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] Calvert, W., and J. F. Knight, \u201cClassification from a computable viewpoint,\u201d <i>Bulletin of Symbolic Logic<\/i>, <b>12<\/b> (2006), pp. 191\u2013218.","DOI":"10.2178\/bsl\/1146620059"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] Coles, R. J., R. G. Downey, and T. A. Slaman, \u201cEvery set has a least jump enumeration,\u201d <i>Journal of the London Mathematical Society<\/i>, vol. 62 (2000), pp. 641\u201349.","DOI":"10.1112\/S0024610700001459"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] Ershov, Yu. L., \u201cTheorie der Numerierungen,\u201d <i>Zeitschrift f\u00fcr Mathematische Logik und Grundlagen Mathematik<\/i>, vol. 23 (1977), pp. 289\u2013371.","DOI":"10.1002\/malq.19770231902"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] Friedberg, R. M., \u201cThree theorems on recursive enumeration, I, Decomposition, II, Maximal set, III, Enumeration without duplication,\u201d <i>Journal of Symbolic Logic<\/i>, vol. 23 (1958), pp. 309\u201316.","DOI":"10.2307\/2964290"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] Goncharov, S. S., and J. F. Knight, \u201cComputable structure and non-structure theorems,\u201d <i>Algebra and Logic<\/i>, vol. 41 (2002), pp. 351\u201373.","DOI":"10.1023\/A:1021758312697"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] Goncharov, S. S., S. Lempp, and D. R. Solomon, \u201cFriedberg numberings of families of of $n$-computably enumerable sets,\u201d <i>Algebra and Logic<\/i> vol. 41 (2002), pp. 81\u20136.","DOI":"10.1023\/A:1015352513117"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] Hirschfeldt, D. R., B. Khoussainov, R. A. Shore, and A. M. Slinko, \u201cDegree spectra and computable dimensions in algebraic structures,\u201d <i>Annals of Pure and Applied Logic<\/i>, vol. 115 (2002), pp. 71\u2013113.","DOI":"10.1016\/S0168-0072(01)00087-2"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] Kronecker, L., Grundz\u00fcge einer arithmetischen Theorie der algebraischen Gr\u00f6\u00dfen, <i>Journal f\u00fcr die Reine und Angewandte Mathematik<\/i>, vol. 92 (1882), pp. 1\u2013122.","DOI":"10.1515\/9783112342404-001"},{"key":"14","doi-asserted-by":"publisher","unstructured":"[14] Miller, R., \u201c$\\mathbf{d}$-Computable categoricity for algebraic fields,\u201d <i>Journal of Symbolic Logic<\/i>, vol. 74 (2009), pp. 1325\u201351.","DOI":"10.2178\/jsl\/1254748694"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] Miller, R., and A. Shlapentokh, \u201cComputable categoricity for algebraic fields with splitting algorithms,\u201d <i>Transactions of the American Mathematical Society<\/i>, vol. 367 (2015), pp. 3955\u201380.","DOI":"10.1090\/S0002-9947-2014-06093-5"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] Rabin, M., \u201cComputable algebra, general theory, and theory of computable fields,\u201d <i>Transactions of the American Mathematical Society<\/i>, vol. 95 (1960), pp. 341\u201360.","DOI":"10.2307\/1993295"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] Soare, R. I., <i>Recursively Enumerable Sets and Degrees<\/i>, Berlin, Springer, 1987.","DOI":"10.1007\/978-3-662-02460-7"},{"key":"18","doi-asserted-by":"crossref","unstructured":"[18] Steiner, R. M., \u201cEffective algebraicity,\u201d <i>Archive for Mathematical Logic<\/i>, vol. 52 (2013), pp. 91\u2013112.","DOI":"10.1007\/s00153-012-0308-5"}],"container-title":["Notre Dame Journal of Formal Logic"],"original-title":[],"link":[{"URL":"https:\/\/projecteuclid.org\/journalArticle\/Download?urlid=10.1215\/00294527-2017-0015","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T20:59:18Z","timestamp":1706648358000},"score":1,"resource":{"primary":{"URL":"https:\/\/projecteuclid.org\/journals\/notre-dame-journal-of-formal-logic\/volume-59\/issue-1\/Classifications-of-Computable-Structures\/10.1215\/00294527-2017-0015.full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,1]]},"references-count":18,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2018,1,1]]}},"URL":"https:\/\/doi.org\/10.1215\/00294527-2017-0015","relation":{},"ISSN":["0029-4527"],"issn-type":[{"value":"0029-4527","type":"print"}],"subject":[],"published":{"date-parts":[[2018,1,1]]}}}