{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T10:18:30Z","timestamp":1775470710087,"version":"3.50.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"7-8","license":[{"start":{"date-parts":[[2023,6,9]],"date-time":"2023-06-09T00:00:00Z","timestamp":1686268800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,6,9]],"date-time":"2023-06-09T00:00:00Z","timestamp":1686268800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-2054477"],"award-info":[{"award-number":["DMS-2054477"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Arch. Math. Logic"],"published-print":{"date-parts":[[2023,11]]},"DOI":"10.1007\/s00153-023-00884-4","type":"journal-article","created":{"date-parts":[[2023,6,9]],"date-time":"2023-06-09T18:03:09Z","timestamp":1686333789000},"page":"1111-1129","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On the complexity of the theory of a computably presented metric structure"],"prefix":"10.1007","volume":"62","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6744-1375","authenticated-orcid":false,"given":"Caleb","family":"Camrud","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0341-0251","authenticated-orcid":false,"given":"Isaac","family":"Goldbring","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8334-4367","authenticated-orcid":false,"given":"Timothy H.","family":"McNicholl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,9]]},"reference":[{"issue":"4","key":"884_CR1","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1305\/ndjfl\/1039118866","volume":"39","author":"J Chisholm","year":"1998","unstructured":"Chisholm, J., Moses, M.: An undecidable linear order that is $$n$$-decidable for all $$n$$. Notre Dame J. Formal Logic 39(4), 519\u2013526 (1998)","journal-title":"Notre Dame J. Formal Logic"},{"issue":"4","key":"884_CR2","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1007\/s10469-015-9353-6","volume":"54","author":"EB Fokina","year":"2015","unstructured":"Fokina, E.B., Goncharov, S.S., Kharizanova, V., Kudinov, O.V., Turetski, D.: Index sets of $$n$$-decidable structures that are categorical with respect to $$m$$-decidable representations. Algebra Logika 54(4), 520\u2013528544545547548 (2015)","journal-title":"Algebra Logika"},{"key":"884_CR3","volume-title":"Turing\u2019s Legacy: Developments from Turing\u2019s Ideas in Logic","author":"EB Fokina","year":"2014","unstructured":"Fokina, E.B., Harizanov, V., Melnikov, A.G.: Computable model theory. In: Downey, R. (ed.) Turing\u2019s Legacy: Developments from Turing\u2019s Ideas in Logic. Cambridge University Press, Cambridge (2014)"},{"key":"884_CR4","doi-asserted-by":"crossref","unstructured":"Ben\u00a0Yaacov, I., Berenstein, A., Henson, C.W., Usvyatsov, A.: Model theory for metric structures. In: Model Theory with Applications to Algebra and Analysis. Vol. 2. London Math. Soc. Lecture Note Ser., vol. 350, pp. 315\u2013427. Cambridge Univ. Press, Cambridge (2008)","DOI":"10.1017\/CBO9780511735219.011"},{"issue":"4","key":"884_CR5","doi-asserted-by":"publisher","first-page":"1055","DOI":"10.2178\/jsl.7804030","volume":"78","author":"AG Melnikov","year":"2013","unstructured":"Melnikov, A.G.: Computably isometric spaces. J. Symb. Logic 78(4), 1055\u20131085 (2013)","journal-title":"J. Symb. Logic"},{"key":"884_CR6","doi-asserted-by":"publisher","first-page":"6","DOI":"10.4115\/jla.2020.12.6","volume":"12","author":"JNY Franklin","year":"2020","unstructured":"Franklin, J.N.Y., McNicholl, T.H.: Degrees of and lowness for isometric isomorphism. J. Log. Anal. 12, 6\u201323 (2020)","journal-title":"J. Log. Anal."},{"issue":"3","key":"884_CR7","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.apal.2007.10.011","volume":"158","author":"I Ben Yaacov","year":"2009","unstructured":"Ben Yaacov, I., Iovino, J.: Model theoretic forcing in analysis. Ann. Pure Appl. Logic 158(3), 163\u2013174 (2009)","journal-title":"Ann. Pure Appl. Logic"},{"key":"884_CR8","doi-asserted-by":"crossref","unstructured":"Eagle, C.J.: Expressive power of infinitary $$[0,1]$$-valued logics. In: Beyond First Order Model Theory, pp. 3\u201322. CRC Press, Boca Raton, FL (2017)","DOI":"10.1201\/9781315368078-2"},{"key":"884_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-02460-7","volume-title":"Recursively Enumerable Sets and Degrees","author":"RI Soare","year":"1987","unstructured":"Soare, R.I.: Recursively Enumerable Sets and Degrees. Springer, Berlin (1987)"},{"key":"884_CR10","volume-title":"Computability Theory","author":"SB Cooper","year":"2004","unstructured":"Cooper, S.B.: Computability Theory. Chapman & Hall\/CRC, Boca Raton (2004)"},{"key":"884_CR11","first-page":"346","volume-title":"Computable Structures and the Hyperarithmetical Hierarchy. Studies in Logic and the Foundations of Mathematics","author":"CJ Ash","year":"2000","unstructured":"Ash, C.J., Knight, J.: Computable Structures and the Hyperarithmetical Hierarchy. Studies in Logic and the Foundations of Mathematics, vol. 144, p. 346. North-Holland Publishing Co., Amsterdam (2000)"},{"key":"884_CR12","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/BFb0086109","volume-title":"Higher Recursion. Theory Perspectives in Mathematical Logic","author":"GE Sacks","year":"1990","unstructured":"Sacks, G.E.: Higher Recursion. Theory Perspectives in Mathematical Logic, p. 344. Springer, Berlin (1990). https:\/\/doi.org\/10.1007\/BFb0086109"},{"key":"884_CR13","doi-asserted-by":"crossref","unstructured":"Specker, E.: Der satz vom maximum in der rekursiven analysis. In: Ernst Specker Selecta, pp. 148\u2013159. Springer, Berlin (1990)","DOI":"10.1007\/978-3-0348-9259-9_12"},{"key":"884_CR14","volume-title":"Computable Analysis. Texts in Theoretical Computer Science. An EATCS Series","author":"K Weihrauch","year":"2000","unstructured":"Weihrauch, K.: Computable Analysis. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin (2000)"},{"issue":"4","key":"884_CR15","doi-asserted-by":"publisher","first-page":"1664","DOI":"10.1017\/jsl.2020.67","volume":"85","author":"M Harrison-Trainor","year":"2020","unstructured":"Harrison-Trainor, M., Melnikov, A., Meng Ng, K.: Computability of polish spaces up to homeomorphism. J. Symb. Logic 85(4), 1664\u20131686 (2020). https:\/\/doi.org\/10.1017\/jsl.2020.67","journal-title":"J. Symb. Logic"},{"issue":"2","key":"884_CR16","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1093\/logcom\/exaa059","volume":"31","author":"I Goldbring","year":"2020","unstructured":"Goldbring, I., Hart, B.: Operator algebras with hyperarithmetic theory. J. Logic Comput. 31(2), 612\u2013629 (2020). https:\/\/doi.org\/10.1093\/logcom\/exaa059","journal-title":"J. Logic Comput."},{"issue":"12","key":"884_CR17","doi-asserted-by":"publisher","first-page":"4265","DOI":"10.1090\/S0002-9939-2014-12170-8","volume":"142","author":"T Fritz","year":"2014","unstructured":"Fritz, T., Netzer, T., Thom, A.: Can you compute the operator norm? Proc. Am. Math. Soc. 142(12), 4265\u20134276 (2014)","journal-title":"Proc. Am. Math. Soc."},{"issue":"3","key":"884_CR18","doi-asserted-by":"publisher","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. Logic 42(3), 195\u2013205 (1989). https:\/\/doi.org\/10.1016\/0168-0072(89)90015-8","journal-title":"Ann. Pure Appl. Logic"},{"issue":"3","key":"884_CR19","doi-asserted-by":"publisher","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. Logic 55(3), 1168\u20131191 (1990)","journal-title":"J. Symb. Logic"},{"key":"884_CR20","unstructured":"Moody, J.G.: Computable Continuous Structure Theory, p. 116. ProQuest LLC, Ann Arbor, MI (2019). Thesis (Ph.D.)\u2013University of California, Berkeley"},{"key":"884_CR21","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/BF02259845","volume":"31","author":"Y Ventsov","year":"1992","unstructured":"Ventsov, Y.: Effective choice for relations and reducibilities in classes of constructive and positive models. Algebra and Logic 31, 63\u201373 (1992)","journal-title":"Algebra and Logic"},{"issue":"2","key":"884_CR22","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1017\/jsl.2017.91","volume":"83","author":"N Greenberg","year":"2018","unstructured":"Greenberg, N., Melnikov, A.G., Knight, J.F., Turetsky, D.: Uniform procedures in uncountable structures. J. Symb. Log. 83(2), 529\u2013550 (2018). https:\/\/doi.org\/10.1017\/jsl.2017.91","journal-title":"J. Symb. Log."}],"container-title":["Archive for Mathematical Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-023-00884-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00153-023-00884-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-023-00884-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,20]],"date-time":"2023-09-20T03:28:20Z","timestamp":1695180500000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00153-023-00884-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,9]]},"references-count":22,"journal-issue":{"issue":"7-8","published-print":{"date-parts":[[2023,11]]}},"alternative-id":["884"],"URL":"https:\/\/doi.org\/10.1007\/s00153-023-00884-4","relation":{},"ISSN":["0933-5846","1432-0665"],"issn-type":[{"value":"0933-5846","type":"print"},{"value":"1432-0665","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,6,9]]},"assertion":[{"value":"8 February 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 May 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 June 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}