{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:54:17Z","timestamp":1742914457056,"version":"3.40.3"},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319500614"},{"type":"electronic","value":"9783319500621"}],"license":[{"start":{"date-parts":[[2016,12,1]],"date-time":"2016-12-01T00:00:00Z","timestamp":1480550400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-50062-1_17","type":"book-chapter","created":{"date-parts":[[2016,11,30]],"date-time":"2016-11-30T10:09:42Z","timestamp":1480500582000},"page":"238-253","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Irreducibles and Primes in Computable Integral Domains"],"prefix":"10.1007","author":[{"given":"Leigh","family":"Evron","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph R.","family":"Mileti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ethan","family":"Ratliff-Crain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,12,1]]},"reference":[{"issue":"1","key":"17_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0022-4049(90)90074-R","volume":"69","author":"DD Anderson","year":"1990","unstructured":"Anderson, D.D., Anderson, D.F., Zafrullah, M.: Factorization in integral domains. J. Pure Appl. Algebra 69(1), 1\u201319 (1990)","journal-title":"J. Pure Appl. Algebra"},{"issue":"1","key":"17_CR2","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/0021-8693(92)90089-5","volume":"152","author":"DD Anderson","year":"1992","unstructured":"Anderson, D.D., Anderson, D.F., Zafrullah, M.: Factorization in integral domains. II. J. Algebra 152(1), 78\u201393 (1992)","journal-title":"J. Algebra"},{"issue":"2","key":"17_CR3","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1090\/S0002-9939-96-03284-4","volume":"124","author":"DD Anderson","year":"1996","unstructured":"Anderson, D.D., Mullins, B.: Finite factorization domains. Proc. Am. Math. Soc. 124(2), 389\u2013396 (1996)","journal-title":"Proc. Am. Math. Soc."},{"key":"17_CR4","unstructured":"Dzhafarov, D., Mileti, J.: The complexity of primes in computable UFDs. Notre Dame J. Form. Log. To appear"},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1098\/rsta.1956.0003","volume":"248","author":"A Fr\u00f6hlich","year":"1956","unstructured":"Fr\u00f6hlich, A., Shepherdson, J.C.: Effective procedures in field theory. Philos. Trans. R. Soc. Lond. Ser. A. 248, 407\u2013432 (1956)","journal-title":"Philos. Trans. R. Soc. Lond. Ser. A."},{"issue":"3","key":"17_CR6","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0003-4843(79)90011-1","volume":"17","author":"G Metakides","year":"1979","unstructured":"Metakides, G., Nerode, A.: Effective content of field theory. Ann. Math. Log. 17(3), 289\u2013320 (1979)","journal-title":"Ann. Math. Log."},{"issue":"7","key":"17_CR7","first-page":"798","volume":"55","author":"R Miller","year":"2008","unstructured":"Miller, R.: Computable fields and Galois theory. Not. Am. Math. Soc. 55(7), 798\u2013807 (2008)","journal-title":"Not. Am. Math. Soc."},{"key":"17_CR8","first-page":"341","volume":"95","author":"M Rabin","year":"1960","unstructured":"Rabin, M.: Computable algebra, general theory and theory of computable fields. Trans. Am. Math. Soc. 95, 341\u2013360 (1960)","journal-title":"Trans. Am. Math. Soc."},{"key":"17_CR9","series-title":"Handbook of Computability Theory","doi-asserted-by":"publisher","DOI":"10.1016\/S0049-237X(99)80028-7","volume-title":"Computable Rings and Fields","author":"V Stoltenberg-Hansen","year":"1999","unstructured":"Stoltenberg-Hansen, V., Tucker, J.V.: Computable Rings and Fields. Handbook of Computability Theory. Elsevier, Amsterdam (1999)"}],"container-title":["Lecture Notes in Computer Science","Computability and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-50062-1_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T16:56:06Z","timestamp":1709830566000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-50062-1_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,1]]},"ISBN":["9783319500614","9783319500621"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-50062-1_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016,12,1]]},"assertion":[{"value":"1 December 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}