{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:19:08Z","timestamp":1772119148965,"version":"3.50.1"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2024,10,12]],"date-time":"2024-10-12T00:00:00Z","timestamp":1728691200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,12]],"date-time":"2024-10-12T00:00:00Z","timestamp":1728691200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Arch. Math. Logic"],"published-print":{"date-parts":[[2025,2]]},"DOI":"10.1007\/s00153-024-00941-6","type":"journal-article","created":{"date-parts":[[2024,10,11]],"date-time":"2024-10-11T23:16:38Z","timestamp":1728688598000},"page":"333-349","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A characterization of strongly computable finite factorization domains"],"prefix":"10.1007","volume":"64","author":[{"given":"Geraldo","family":"Soto-Rosa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Victor","family":"Ocasio-Gonz\u00e1lez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,10,12]]},"reference":[{"key":"941_CR1","doi-asserted-by":"crossref","unstructured":"Anderson, D. F., Gotti, F.: Bounded and finite factorization domains, Rings, monoids and module theory: AUS-ICMS 2020, Sharjah, United Arab Emirates, february 6\u20139, pp. 7\u201357 (2022)","DOI":"10.1007\/978-981-16-8422-7_2"},{"key":"941_CR2","doi-asserted-by":"crossref","unstructured":"Anderson, D.D., Mullins, B.: Finite factorization domains, Proceedings of the American Mathematical Society 124 (1996)","DOI":"10.1090\/S0002-9939-96-03284-4"},{"key":"941_CR3","volume-title":"Abstract Algebra","author":"DS Dummit","year":"2004","unstructured":"Dummit, D.S., Foote, R.M.: Abstract Algebra, 3rd edn. Wiley, New York (2004)","edition":"3"},{"key":"941_CR4","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1215\/00294527-2017-0024","volume":"59","author":"D Dzhafarov","year":"2018","unstructured":"Dzhafarov, D., Mileti, J.: The complexity of primes in computable unique factorization domains. Notre Dame J. Formal Logic 59, 139\u2013156 (2018)","journal-title":"Notre Dame J. Formal Logic"},{"key":"941_CR5","doi-asserted-by":"crossref","unstructured":"Evron, L., Mileti, J., Ratliff-Crain, E.: Irreducibles and primes in computable integral domains, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 10010 (2017)","DOI":"10.1007\/978-3-319-50062-1_17"},{"issue":"950","key":"941_CR6","first-page":"407","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 Math. Phys. Sci. 248(950), 407\u2013432 (1956)","journal-title":"Philos. Trans. R. Soc. Lond. Ser. A Math. Phys. Sci."},{"issue":"4","key":"941_CR7","first-page":"323","volume":"18","author":"K Mahtews","year":"2000","unstructured":"Mahtews, K.: The diophantine equation x2 - dy2 = n, d> 0. Expositiones Mathematicae 18(4), 323\u2013332 (2000)","journal-title":"Expositiones Mathematicae"},{"issue":"7","key":"941_CR8","first-page":"798","volume":"55","author":"R Miller","year":"2008","unstructured":"Miller, R.: Computable fields and Galois theory. Notices Am. Math. Soc. 55(7), 798 (2008)","journal-title":"Notices Am. Math. Soc."},{"key":"941_CR9","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1515\/gcc.2011.002","volume":"3","author":"R Miller","year":"2011","unstructured":"Miller, R.: An introduction to computable model theory on groups and fields. Groups Complex. Cryptol. 3, 25\u201345 (2011)","journal-title":"Groups Complex. Cryptol."},{"key":"941_CR10","volume-title":"Computable Structure: Theory Within the Arithmetic, Perspectives in Logic","author":"A Montalb\u00e1n","year":"2021","unstructured":"Montalb\u00e1n, A.: Computable Structure: Theory Within the Arithmetic, Perspectives in Logic. Cambridge University Press, Cambridge (2021)"},{"key":"941_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31933-4","volume-title":"Turing Computability: Theory and Applications","author":"RI Soare","year":"2016","unstructured":"Soare, R.I.: Turing Computability: Theory and Applications. Springer, Berlin (2016)"}],"container-title":["Archive for Mathematical Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-024-00941-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00153-024-00941-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-024-00941-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T00:40:43Z","timestamp":1739320843000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00153-024-00941-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,12]]},"references-count":11,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["941"],"URL":"https:\/\/doi.org\/10.1007\/s00153-024-00941-6","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-3194613\/v1","asserted-by":"object"}]},"ISSN":["0933-5846","1432-0665"],"issn-type":[{"value":"0933-5846","type":"print"},{"value":"1432-0665","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10,12]]},"assertion":[{"value":"22 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 September 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 October 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}