{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:22:57Z","timestamp":1740108177551,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2016,3,10]],"date-time":"2016-03-10T00:00:00Z","timestamp":1457568000000},"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":["Arch. Math. Logic"],"published-print":{"date-parts":[[2016,5]]},"DOI":"10.1007\/s00153-016-0478-7","type":"journal-article","created":{"date-parts":[[2016,3,10]],"date-time":"2016-03-10T11:54:15Z","timestamp":1457610855000},"page":"519-534","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Computable dimension for ordered fields"],"prefix":"10.1007","volume":"55","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5316-4530","authenticated-orcid":false,"given":"Oscar","family":"Levin","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,10]]},"reference":[{"issue":"3","key":"478_CR1","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0168-0072(89)90015-8","volume":"42","author":"C. Ash","year":"1989","unstructured":"Ash C., Knight J., Manasse M., Slaman T.: Generic copies of countable structures. Ann. Pure Appl. Log. 42(3), 195\u2013205 (1989). doi: 10.1016\/0168-0072(89)90015-8","journal-title":"Ann. Pure Appl. Log."},{"issue":"3","key":"478_CR2","doi-asserted-by":"crossref","first-page":"1168","DOI":"10.2307\/2274481","volume":"55","author":"J. Chisholm","year":"1990","unstructured":"Chisholm J.: Effective model theory vs. recursive model theory. J. Symb. Log. 55(3), 1168\u20131191 (1990). doi: 10.2307\/2274481","journal-title":"J. Symb. Log."},{"key":"478_CR3","unstructured":"Csima, B.F., Khoussainov, B., Liu, J.: Computable categoricity of graphs with finite components. In: Logic and Theory of Algorithms. 4th Conference on Computability in Europe, CiE 2008, Athens, Greece, June 15\u201320, 2008. Proceedings, pp. 139\u2013148. Springer, Berlin (2008). doi: 10.1007\/978-3-540-69407-6-15"},{"key":"478_CR4","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BF01669101","volume":"19","author":"S. Goncharov","year":"1980","unstructured":"Goncharov S.: Autostability of models and Abelian groups. Algebra Log. 19, 13\u201327 (1980). doi: 10.1007\/BF01669101","journal-title":"Algebra Log."},{"key":"478_CR5","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1007\/BF01669102","volume":"19","author":"S. Goncharov","year":"1980","unstructured":"Goncharov S., Dzgoev V.: Autostability of models. Algebra Log. 19, 28\u201337 (1980). doi: 10.1007\/BF01669102","journal-title":"Algebra Log."},{"issue":"1","key":"478_CR6","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF01054216","volume":"30","author":"S. Goncharov","year":"1989","unstructured":"Goncharov S., Molokov A., Romanovskij N.: Nilpotent groups of finite algorithmic dimension. Sib. Math. J. 30(1), 63\u201368 (1989). doi: 10.1007\/BF01054216","journal-title":"Sib. Math. J."},{"key":"478_CR7","unstructured":"Goncharov, S.S.: Limit equivalent constructivizations. In: Mathematical Logic and the Theory of Algorithms, Trudy Inst. Mat., vol. 2, pp. 4\u201312. \u201cNauka\u201d Sibirsk. Otdel., Novosibirsk (1982)"},{"issue":"1","key":"478_CR8","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1016\/S0001-8708(02)00042-7","volume":"175","author":"S.S. Goncharov","year":"2003","unstructured":"Goncharov S.S., Lempp S., Solomon R.: The computable dimension of ordered abelian groups. Adv. Math. 175(1), 102\u2013143 (2003). doi: 10.1016\/S0001-8708(02)00042-7","journal-title":"Adv. Math."},{"key":"478_CR9","unstructured":"Hungerford, T.W.: Algebra. Holt, Rinehart and Winston, Inc., New York (1974)"},{"key":"478_CR10","doi-asserted-by":"crossref","unstructured":"Jacobson, N.: Lectures in Abstract Algebra. Theory of Fields and Galois Theory, vol. III. D. Van Nostrand Co. Inc., Princeton, New Jersey (1964)","DOI":"10.1007\/978-1-4612-9872-4"},{"key":"478_CR11","doi-asserted-by":"crossref","unstructured":"Lang, S.: Algebra, Graduate Texts in Mathematics, vol. 211, 3rd edn. Springer, New York (2002). doi: 10.1007\/978-1-4613-0041-0","DOI":"10.1007\/978-1-4613-0041-0"},{"issue":"1","key":"478_CR12","doi-asserted-by":"crossref","first-page":"151","DOI":"10.2178\/jsl\/1107298515","volume":"70","author":"S. Lempp","year":"2005","unstructured":"Lempp S., McCoy C., Miller R., Solomon R.: Computable categoricity of trees of finite height. J. Symb. Log. 70(1), 151\u2013215 (2005). doi: 10.2178\/jsl\/1107298515","journal-title":"J. Symb. Log."},{"key":"478_CR13","unstructured":"Levin, O.: Computability Theory, Reverse Mathematics, and Ordered Fields. Ph.D. thesis, University of Connecticut, Storrs, CT (2009)"},{"key":"478_CR14","doi-asserted-by":"crossref","first-page":"239","DOI":"10.2307\/2270515","volume":"35","author":"E.W. Madison","year":"1970","unstructured":"Madison E.W.: A note on computable real fields. J. Symb. Log. 35, 239\u2013241 (1970)","journal-title":"J. Symb. Log."},{"key":"478_CR15","volume-title":"Model Theory, Graduate Texts in Mathematics, vol. 217","author":"D. Marker","year":"2002","unstructured":"Marker D.: Model Theory, Graduate Texts in Mathematics, vol. 217. Springer, New York (2002)"},{"issue":"3","key":"478_CR16","doi-asserted-by":"crossref","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). doi: 10.1016\/0003-4843(79)90011-1","journal-title":"Ann. Math. Log."},{"issue":"4","key":"478_CR17","doi-asserted-by":"crossref","first-page":"1325","DOI":"10.2178\/jsl\/1254748694","volume":"74","author":"R. Miller","year":"2009","unstructured":"Miller R.: d-computable categoricity for algebraic fields. J. Symb. Log. 74(4), 1325\u20131351 (2009). doi: 10.2178\/jsl\/1254748694","journal-title":"J. Symb. Log."},{"issue":"1","key":"478_CR18","doi-asserted-by":"crossref","first-page":"51","DOI":"10.3233\/COM-13017","volume":"2","author":"R. Miller","year":"2013","unstructured":"Miller R., Schoutens H.: Computably categorical fields via Fermat\u2019s last theorem. Computability 2(1), 51\u201365 (2013)","journal-title":"Computability"},{"key":"478_CR19","doi-asserted-by":"crossref","unstructured":"Nurtazin, A.T.: Strong and weak constructivizations, and enumerable families. Algebra i Logika 13, 311\u2013323, 364 (1974)","DOI":"10.1007\/BF01463352"},{"key":"478_CR20","volume-title":"Lectures on Formally Real Fields, Lecture Notes in Mathematics, vol. 1093","author":"A. Prestel","year":"1984","unstructured":"Prestel A.: Lectures on Formally Real Fields, Lecture Notes in Mathematics, vol. 1093. Springer, Berlin (1984)"},{"issue":"2","key":"478_CR21","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1090\/S0002-9939-1981-0624937-1","volume":"83","author":"J.B. Remmel","year":"1981","unstructured":"Remmel J.B.: Recursively categorical linear orderings. Proc. Am. Math. Soc. 83(2), 387\u2013391 (1981)","journal-title":"Proc. Am. Math. Soc."},{"key":"478_CR22","doi-asserted-by":"crossref","unstructured":"Soare, R.I.: Recursively Enumerable Sets and Degrees. A Study of Computable Functions and Computably Generated Sets. Perspectives in Mathematical Logic. Springer, Berlin (1987). doi: 10.1007\/978-3-662-02460-7","DOI":"10.1007\/978-3-662-02460-7"}],"container-title":["Archive for Mathematical Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-016-0478-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00153-016-0478-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-016-0478-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,16]],"date-time":"2020-09-16T23:41:32Z","timestamp":1600299692000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00153-016-0478-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3,10]]},"references-count":22,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2016,5]]}},"alternative-id":["478"],"URL":"https:\/\/doi.org\/10.1007\/s00153-016-0478-7","relation":{},"ISSN":["0933-5846","1432-0665"],"issn-type":[{"type":"print","value":"0933-5846"},{"type":"electronic","value":"1432-0665"}],"subject":[],"published":{"date-parts":[[2016,3,10]]}}}