{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,31]],"date-time":"2024-01-31T00:12:57Z","timestamp":1706659977943},"reference-count":19,"publisher":"Duke University Press","issue":"2","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-0024","type":"journal-article","created":{"date-parts":[[2018,2,27]],"date-time":"2018-02-27T09:06:47Z","timestamp":1519722407000},"source":"Crossref","is-referenced-by-count":0,"title":["The Complexity of Primes in Computable Unique Factorization Domains"],"prefix":"10.1215","volume":"59","author":[{"given":"Damir D.","family":"Dzhafarov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph R.","family":"Mileti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"73","reference":[{"key":"5","unstructured":"[5] Conrad, K., \u201cFactoring in quadratic fields,\u201d preprint, <a href=\"http:\/\/www.math.uconn.edu\/~kconrad\/blurbs\/gradnumthy\/quadraticgrad.pdf\">http:\/\/www.math.uconn.edu\/~kconrad\/blurbs\/gradnumthy\/quadraticgrad.pdf<\/a> (accessed 4 October 2017)."},{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] Baur, W., \u201cRekursive Algebren mit Kettenbedingungen,\u201d <i>Mathematical Logic Quarterly<\/i>, vol. 20 (1974), pp. 37\u201346.","DOI":"10.1002\/malq.19740200105"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] Cohen, H., <i>A Course in Computational Algebraic Number Theory<\/i>, vol. 138 of <i>Graduate Texts in Mathematics<\/i>, Springer, Berlin, 1993.","DOI":"10.1007\/978-3-662-02945-9"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] Cohen, H., <i>Advanced Topics in Computational Number Theory<\/i>, vol. 193 of <i>Graduate Texts in Mathematics<\/i>, Springer, New York, 2000.","DOI":"10.1007\/978-1-4419-8489-0"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] Conidis, C. J., \u201cOn the complexity of radicals in noncommutative rings,\u201d <i>Journal of Algebra<\/i>, vol. 322 (2009), pp. 3670\u201380.","DOI":"10.1016\/j.jalgebra.2009.07.039"},{"key":"6","unstructured":"[6] Crandall, R., and C. Pomerance, <i>Prime Numbers: A Computational Perspective<\/i>, 2nd edition, Springer, New York, 2005."},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] Downey, R. G., and A. M. Kach, \u201cEuclidean functions of computable Euclidean domains,\u201d <i>Notre Dame Journal of Formal Logic<\/i>, vol. 52 (2011), pp. 163\u201372.","DOI":"10.1215\/00294527-1306172"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] Downey, R. G., S. Lempp, and J. R. Mileti, \u201cIdeals in computable rings,\u201d <i>Journal of Algebra<\/i>, vol. 314 (2007), pp. 872\u201387.","DOI":"10.1016\/j.jalgebra.2007.02.058"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] Eisenbud, D., <i>Commutative Algebra: With a View Toward Algebraic Geometry<\/i>, vol. 150 of <i>Graduate Texts in Mathematics<\/i>, Springer, New York, 1995.","DOI":"10.1007\/978-1-4612-5350-1"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] Friedman, H. M., S. G. Simpson, and R. L. Smith, \u201cCountable algebra and set existence axioms,\u201d <i>Annals of Pure and Applied Logic<\/i>, vol. 25 (1983), pp. 141\u201381. Addendum, <i>Annals of Pure and Applied Logic<\/i>, vol. 28 (1985), pp. 319\u201320.","DOI":"10.1016\/0168-0072(83)90012-X"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] Fr\u00f6hlich, A., and J. C. Shepherdson, \u201cEffective procedures in field theory,\u201d <i>Philosophical Transactions of the Royal Society of London, Series A<\/i>, vol. 248 (1956), pp. 407\u201332.","DOI":"10.1098\/rsta.1956.0003"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] Kl\u00fcners, J., \u201cAlgorithms for function fields,\u201d <i>Experimental Mathematics<\/i>, vol. 11 (2002), pp. 171\u201381.","DOI":"10.1080\/10586458.2002.10504684"},{"key":"13","unstructured":"[13] Matsumura, H., <i>Commutative Ring Theory<\/i>, vol. 8 of <i>Cambridge Studies in Advanced Mathematics<\/i>, Cambridge University Press, Cambridge, 1986."},{"key":"14","doi-asserted-by":"publisher","unstructured":"[14] Metakides, G., and A. Nerode, \u201cEffective content of field theory,\u201d <i>Annals of Mathematical Logic<\/i>, vol. 17 (1979), pp. 289\u2013320.","DOI":"10.1016\/0003-4843(79)90011-1"},{"key":"15","unstructured":"[15] Miller, R., \u201cComputable fields and Galois theory,\u201d <i>Notices of the American Mathematical Society<\/i>, vol. 55 (2008), pp. 798\u2013807."},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] M\u00fcller-Quade, J., and R. Steinwandt, \u201cBasic algorithms for rational function fields,\u201d <i>Journal of Symbolic Computation<\/i>, vol. 27 (1999), pp. 143\u201370.","DOI":"10.1006\/jsco.1998.0246"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] Rabin, M. O., \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":"18","doi-asserted-by":"crossref","unstructured":"[18] 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"},{"key":"19","doi-asserted-by":"crossref","unstructured":"[19] Stoltenberg-Hansen, V., and J. V. Tucker, \u201cComputable rings and fields,\u201d pp. 363\u2013447 in <i>Handbook of Computability Theory<\/i>, vol. 140 of <i>Studies in Logic and the Foundations of Mathematics<\/i>, North-Holland, Amsterdam, 1999.","DOI":"10.1016\/S0049-237X(99)80028-7"}],"container-title":["Notre Dame Journal of Formal Logic"],"original-title":[],"link":[{"URL":"https:\/\/projecteuclid.org\/journalArticle\/Download?urlid=10.1215\/00294527-2017-0024","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T20:59:22Z","timestamp":1706648362000},"score":1,"resource":{"primary":{"URL":"https:\/\/projecteuclid.org\/journals\/notre-dame-journal-of-formal-logic\/volume-59\/issue-2\/The-Complexity-of-Primes-in-Computable-Unique-Factorization-Domains\/10.1215\/00294527-2017-0024.full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,1]]},"references-count":19,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2018,1,1]]}},"URL":"https:\/\/doi.org\/10.1215\/00294527-2017-0024","relation":{},"ISSN":["0029-4527"],"issn-type":[{"value":"0029-4527","type":"print"}],"subject":[],"published":{"date-parts":[[2018,1,1]]}}}