{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,28]],"date-time":"2024-06-28T00:14:32Z","timestamp":1719533672254},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"5-6","license":[{"start":{"date-parts":[[2024,3,28]],"date-time":"2024-03-28T00:00:00Z","timestamp":1711584000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,3,28]],"date-time":"2024-03-28T00:00:00Z","timestamp":1711584000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"NSF","award":["DMS-2152095"],"award-info":[{"award-number":["DMS-2152095"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Arch. Math. Logic"],"published-print":{"date-parts":[[2024,7]]},"DOI":"10.1007\/s00153-024-00916-7","type":"journal-article","created":{"date-parts":[[2024,3,28]],"date-time":"2024-03-28T13:01:41Z","timestamp":1711630901000},"page":"679-702","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Cohesive powers of structures"],"prefix":"10.1007","volume":"63","author":[{"given":"Valentina","family":"Harizanov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keshav","family":"Srinivasan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,3,28]]},"reference":[{"key":"916_CR1","volume-title":"Computable Structures and the Hyperarithmetical Hierarchy","author":"C Ash","year":"2000","unstructured":"Ash, C., Knight, J.: Computable Structures and the Hyperarithmetical Hierarchy. Elsevier, Amsterdam (2000)"},{"issue":"4","key":"916_CR2","first-page":"329","volume":"25","author":"A Blass","year":"1977","unstructured":"Blass, A.: A model without ultrafilters. Bulletin de l\u2019Acad\u00e9mie Polonaise des Sciences, S\u00e9rie des Sciences Math\u00e9matiques, Astronomiques et Physiques 25(4), 329\u2013331 (1977)","journal-title":"Bulletin de l\u2019Acad\u00e9mie Polonaise des Sciences, S\u00e9rie des Sciences Math\u00e9matiques, Astronomiques et Physiques"},{"key":"916_CR3","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1093\/logcom\/exab057","volume":"32","author":"W Calvert","year":"2022","unstructured":"Calvert, W., Cenzer, D., Harizanov, V.: Densely computable structures. J. Log. Comput. 32, 581\u2013607 (2022)","journal-title":"J. Log. Comput."},{"key":"916_CR4","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.apal.2005.10.002","volume":"141","author":"W Calvert","year":"2006","unstructured":"Calvert, W., Cenzer, D., Harizanov, V., Morozov, A.: Effective categoricity of equivalence structures. Ann. Pure Appl. Logic 141, 61\u201378 (2006)","journal-title":"Ann. Pure Appl. Logic"},{"key":"916_CR5","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s10469-014-9270-0","volume":"53","author":"D Cenzer","year":"2014","unstructured":"Cenzer, D., Harizanov, V., Remmel, J.B.: Computability-theoretic properties of injection structures. Algebra Logic 53, 39\u201369 (2014)","journal-title":"Algebra Logic"},{"key":"916_CR6","doi-asserted-by":"publisher","first-page":"1195","DOI":"10.1093\/logcom\/ext040","volume":"23","author":"D Cenzer","year":"2013","unstructured":"Cenzer, D., Harizanov, V., Remmel, J.B.: Two-to-one structures. J. Log. Comput. 23, 1195\u20131223 (2013)","journal-title":"J. Log. Comput."},{"key":"916_CR7","volume-title":"Model Theory","author":"CC Chang","year":"1990","unstructured":"Chang, C.C., Keisler, H.J.: Model Theory. North-Holland, Amsterdam (1990)"},{"key":"916_CR8","volume-title":"Computability Theory","author":"SB Cooper","year":"2004","unstructured":"Cooper, S.B.: Computability Theory. CRC Press, Boca Raton (2004)"},{"key":"916_CR9","doi-asserted-by":"crossref","unstructured":"Csima, B.F., Khoussainov, B., Liu, J.: Computable categoricity of graphs with finite components. In: Logic and Theory of Algorithms, CiE 2008, A. Beckmann, C. Dimitracopoulos, and B. L\u00f6we, editors, Lecture Notes in Computer Science 5028, 139\u2013148 (2008)","DOI":"10.1007\/978-3-540-69407-6_15"},{"key":"916_CR10","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/s00153-003-0196-9","volume":"43","author":"RD Dimitrov","year":"2004","unstructured":"Dimitrov, R.D.: Quasimaximality and principal filters isomorphism between $${\\cal{E} }^{ \\ast }$$ and $${\\cal{L} }^{ \\ast } (V_{\\infty })$$. Arch. Math. Logic 43, 415\u2013424 (2004)","journal-title":"Arch. Math. Logic"},{"key":"916_CR11","first-page":"193","volume":"99","author":"RD Dimitrov","year":"2009","unstructured":"Dimitrov, R.D.: Cohesive powers of computable structures, Annuare de l\u2019Universit\u00e9 de Sofia \u201cSt. Kliment Ohridski\u2019\u2019. Facult\u00e9 de Math\u00e9matiques et Informatique 99, 193\u2013201 (2009)","journal-title":"Facult\u00e9 de Math\u00e9matiques et Informatique"},{"key":"916_CR12","first-page":"183","volume":"99","author":"RD Dimitrov","year":"2009","unstructured":"Dimitrov, R.D.: Extensions of certain partial automorphisms of $${\\cal{L} }^{ \\ast } (V_{\\infty })$$, Annuare de l\u2019Universit\u00e9 de Sofia \u201cSt. Kliment Ohridski\u2019\u2019. Facult\u00e9 de Math\u00e9matiques et Informatique 99, 183\u2013191 (2009)","journal-title":"Facult\u00e9 de Math\u00e9matiques et Informatique"},{"key":"916_CR13","doi-asserted-by":"crossref","unstructured":"Dimitrov, R.D., Harizanov, V.: Effective ultrapowers and applications. In: Aspects of Computation and Automata Theory with Applications, N. Greenberg, S. Jain, K.M. Ng, S. Schewe, F. Stephan, G. Wu, Y. Yang, eds., IMS, National University of Singapore, LNS vol. 42, World Scientific, 201\u2013221 (2023)","DOI":"10.1142\/9789811278631_0008"},{"key":"916_CR14","unstructured":"Dimitrov, R.D., Harizanov, V.: Countable nonstandard models: following Skolem\u2019s approach. In: Sriraman, B. (ed.) Handbook of the History and Philosophy of Mathematical Practice. Springer (to appear)"},{"key":"916_CR15","doi-asserted-by":"crossref","unstructured":"Dimitrov, R.D., Harizanov, V.: Orbits of maximal vector spaces. Algebra Logic 54, 440\u2013477 (2016)","DOI":"10.1007\/s10469-016-9366-9"},{"key":"916_CR16","doi-asserted-by":"crossref","unstructured":"Dimitrov, R., Harizanov, V., Miller, R., Mourad, K.J.: Isomorphisms of non-standard fields and Ash\u2019s conjecture. In: 10th Conference on Computability in Europe, A. Beckmann, E. Csuhaj-Varj\u00fa, and K. Meer, editors, Lecture Notes in Computer Science 8493 (2014), Springer, pp. 143\u2013152","DOI":"10.1007\/978-3-319-08019-2_15"},{"key":"916_CR17","doi-asserted-by":"publisher","first-page":"947","DOI":"10.1017\/jsl.2023.14","volume":"88","author":"R Dimitrov","year":"2023","unstructured":"Dimitrov, R., Harizanov, V., Morozov, A., Shafer, P., Soskova, A.A., Vatev, S.V.: On cohesive powers of linear orders. J. Symb. Log. 88, 947\u20131004 (2023)","journal-title":"J. Symb. Log."},{"key":"916_CR18","doi-asserted-by":"crossref","unstructured":"Dimitrov, R., Harizanov, V., Morozov, A., Shafer, P., Soskova, A., Vatev, S.: Cohesive powers of linear orders. In: Manea, F., Martin, B., Paulusma, D., Primiero, G. (eds.) Computing with Foresight and Industry, pp. 168\u2013180. Springer, Computability in Europe, Durham, UK (2019)","DOI":"10.1007\/978-3-030-22996-2_15"},{"key":"916_CR19","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Remmel, J.B.: Computable algebras and closure systems: coding properties. In: Ershov, Yu.L., Goncharov, S.S., Nerode, A., Remmel, J.B. (eds.) Handbook of Recursive Mathematics, vol. 2, pp. 977\u20131039. Elsevier, Amsterdam (1998)","DOI":"10.1016\/S0049-237X(98)80048-7"},{"key":"916_CR20","doi-asserted-by":"crossref","unstructured":"Feferman, S., Scott, D.S., Tennenbaum, S.: Models of arithmetic through function rings, Notices of the American Mathematical Society 6 (1959), pp. 173\u2013174. Abstract #556-31","DOI":"10.1093\/ajcp\/31.2.173"},{"key":"916_CR21","doi-asserted-by":"crossref","unstructured":"Fokina, E., Harizanov, V., Melnikov, A.: Computable model theory. In: Turing\u2019s Legacy: Developments from Turing\u2019s Ideas in Logic, R. Downey, editor, Lecture Notes in Logic 42, Cambridge University Press (2014), pp. 124\u2013194","DOI":"10.1017\/CBO9781107338579.006"},{"key":"916_CR22","doi-asserted-by":"publisher","first-page":"195","DOI":"10.4064\/fm-51-3-195-228","volume":"51","author":"T Frayne","year":"1962","unstructured":"Frayne, T., Morel, A.C., Scott, D.S.: Reduced direct products. Fundam. Math. 51, 195\u2013228 (1962)","journal-title":"Fundam. Math."},{"key":"916_CR23","unstructured":"Harizanov, V., Srinivasan, K.: Effective ultrapowers of graphs and other structures, accepted for publication in Contemporary Mathematics"},{"key":"916_CR24","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF02757881","volume":"20","author":"J Hirschfeld","year":"1975","unstructured":"Hirschfeld, J.: Models of arithmetic and recursive functions. Israel J. Math. 20, 111\u2013126 (1975)","journal-title":"Israel J. Math."},{"key":"916_CR25","doi-asserted-by":"crossref","unstructured":"Hirschfeld, J., Wheeler, W.H.: Forcing, arithmetic, division rings. Lecture Notes in Mathematics, vol. 454. Springer, Berlin (1975)","DOI":"10.1007\/BFb0064082"},{"key":"916_CR26","first-page":"429","volume":"148","author":"M Lerman","year":"1970","unstructured":"Lerman, M.: Recursive functions modulo co-$$r$$-maximal sets. Trans. Am. Math. Soc. 148, 429\u2013444 (1970)","journal-title":"Trans. Am. Math. Soc."},{"key":"916_CR27","unstructured":"Marshall, L.: Computability-Theoretic Properties of Partial Injections, Trees, and Nested Equivalences, PhD dissertation, George Washington University, 2015"},{"key":"916_CR28","doi-asserted-by":"crossref","unstructured":"McLaughlin, T.G.: Some extension and rearrangement theorems for Nerode semirings. Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik 35, 197\u2013209 (1989)","DOI":"10.1002\/malq.19890350303"},{"key":"916_CR29","doi-asserted-by":"crossref","unstructured":"McLaughlin, T.G.: Sub-arithmetical ultrapowers: a survey. Ann. Pure Appl. Logic 49, 143\u2013191 (1990)","DOI":"10.1016\/0168-0072(90)90064-9"},{"key":"916_CR30","doi-asserted-by":"crossref","unstructured":"McLaughlin, T.G.: $$ \\Delta _{1}$$ ultrapowers are totally rigid. Arch. Math. Logic 46, 379\u2013384 (2007)","DOI":"10.1007\/s00153-007-0038-2"},{"key":"916_CR31","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1305\/ndjfl\/1093634407","volume":"33","author":"GC Nelson","year":"1992","unstructured":"Nelson, G.C.: Constructive ultraproducts and isomorphisms of recursively saturated ultrapowers. Notre Dame J. Formal Logic 33, 433\u2013441 (1992)","journal-title":"Notre Dame J. Formal Logic"},{"key":"916_CR32","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. A Study of Computable Functions and Computably Generated Sets. Springer-Verlag, Berlin (1987)"}],"container-title":["Archive for Mathematical Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-024-00916-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00153-024-00916-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-024-00916-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,27]],"date-time":"2024-06-27T05:02:38Z","timestamp":1719464558000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00153-024-00916-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,28]]},"references-count":32,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2024,7]]}},"alternative-id":["916"],"URL":"https:\/\/doi.org\/10.1007\/s00153-024-00916-7","relation":{},"ISSN":["0933-5846","1432-0665"],"issn-type":[{"value":"0933-5846","type":"print"},{"value":"1432-0665","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3,28]]},"assertion":[{"value":"30 March 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 February 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 March 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 competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}