{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T21:10:36Z","timestamp":1706649036230},"reference-count":11,"publisher":"Duke University Press","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Notre Dame J. Formal Logic"],"published-print":{"date-parts":[[2011,4,1]]},"DOI":"10.1215\/00294527-1306172","type":"journal-article","created":{"date-parts":[[2011,4,28]],"date-time":"2011-04-28T13:02:18Z","timestamp":1303995738000},"source":"Crossref","is-referenced-by-count":2,"title":["Euclidean Functions of Computable Euclidean Domains"],"prefix":"10.1215","volume":"52","author":[{"given":"Rodney G.","family":"Downey","sequence":"first","affiliation":[]},{"given":"Asher M.","family":"Kach","sequence":"additional","affiliation":[]}],"member":"73","reference":[{"key":"1","unstructured":"[1] Friedman, H., \"Some systems of second order arithmetic and their use\", pp. 235\u201342 in <i>Proceedings of the International Congress of Mathematicians. Vol. 1, Vancouver, BC, August 21\u201329, 1974<\/i>, Canadian Mathematical Congress, Montreal, 1975."},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] Fr\u00f6hlich, A., and J. C. Shepherdson, \"Effective procedures in field theory\", <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":"3","doi-asserted-by":"publisher","unstructured":"[3] Hermann, G., \"Die Frage der endlich vielen Schritte in der Theorie der Polynomideale\", <i>Mathematische Annalen<\/i>, vol. 95 (1926), pp. 736\u201388.","DOI":"10.1007\/BF01206635"},{"key":"4","unstructured":"[4] Mal$'$cev, A. I., \"Constructive algebras. I\", <i>Uspekhi Matematicheskikh Nauk<\/i>, vol. 16 (1961), pp. 3\u201360."},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] Motzkin, T., \"The Euclidean algorithm\", <i>Bulletin of the American Mathematical Society<\/i>, vol. 55 (1949), pp. 1142\u201346.","DOI":"10.1090\/S0002-9904-1949-09344-8"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] Rabin, M. O., \"Computable algebra, general theory and theory of computable fields\", <i>Transactions of the American Mathematical Society<\/i>, vol. 95 (1960), pp. 341\u201360.","DOI":"10.2307\/1993295"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] Samuel, P., \"About Euclidean rings\", <i>Journal of Algebra<\/i>, vol. 19 (1971), pp. 282\u2013301.","DOI":"10.1016\/0021-8693(71)90110-4"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] Schrieber, L., \"Recursive properties of Euclidean domains\", <i>Annals of Pure and Applied Logic<\/i>, vol. 29 (1985), pp. 59\u201377.","DOI":"10.1016\/0168-0072(85)90035-1"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] Simpson, S. G., <i>Subsystems of Second Order Arithmetic<\/i>, Perspectives in Mathematical Logic. Springer-Verlag, Berlin, 1999.","DOI":"10.1007\/978-3-642-59971-2"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] Stoltenberg-Hansen, V., and J. V. Tucker, \"Computable rings and fields\", 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"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] van der Waerden, B. L., \"Eine Bemerkung \u00fcber die Unzerlegbarkeit von Polynomen\", <i>Mathematische Annalen<\/i>, vol. 102 (1930), pp. 738\u201339.","DOI":"10.1007\/BF01782374"}],"container-title":["Notre Dame Journal of Formal Logic"],"original-title":[],"link":[{"URL":"https:\/\/projecteuclid.org\/journalArticle\/Download?urlid=10.1215\/00294527-1306172","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T20:57:39Z","timestamp":1706648259000},"score":1,"resource":{"primary":{"URL":"https:\/\/projecteuclid.org\/journals\/notre-dame-journal-of-formal-logic\/volume-52\/issue-2\/Euclidean-Functions-of-Computable-Euclidean-Domains\/10.1215\/00294527-1306172.full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4,1]]},"references-count":11,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2011,4,1]]}},"URL":"https:\/\/doi.org\/10.1215\/00294527-1306172","relation":{},"ISSN":["0029-4527"],"issn-type":[{"value":"0029-4527","type":"print"}],"subject":[],"published":{"date-parts":[[2011,4,1]]}}}