{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:23:00Z","timestamp":1740108180811,"version":"3.37.3"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"7-8","license":[{"start":{"date-parts":[[2018,2,1]],"date-time":"2018-02-01T00:00:00Z","timestamp":1517443200000},"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":[[2018,11]]},"DOI":"10.1007\/s00153-018-0615-6","type":"journal-article","created":{"date-parts":[[2018,2,1]],"date-time":"2018-02-01T07:31:09Z","timestamp":1517470269000},"page":"889-907","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Hanf number for Scott sentences of computable structures"],"prefix":"10.1007","volume":"57","author":[{"given":"S. S.","family":"Goncharov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. F.","family":"Knight","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0879-2810","authenticated-orcid":false,"given":"I.","family":"Souldatos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,2,1]]},"reference":[{"key":"615_CR1","volume-title":"Computable Structures and the Hyperarithmetical Hierarchy","author":"CJ Ash","year":"2000","unstructured":"Ash, C.J., Knight, J.F.: Computable Structures and the Hyperarithmetical Hierarchy. Elsevier, Amsterdam (2000)"},{"key":"615_CR2","doi-asserted-by":"publisher","first-page":"66","DOI":"10.2178\/jsl\/1294170990","volume":"76","author":"B Csima","year":"2011","unstructured":"Csima, B., Harizanov, V., Miller, R., Montalb\u00e1n, A.: Computability of Fra\u00efss\u00e9 limits. J. Symb. Logic 76, 66\u201393 (2011)","journal-title":"J. Symb. Logic"},{"key":"615_CR3","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/BF01674776","volume":"17","author":"SS Goncharov","year":"1978","unstructured":"Goncharov, S.S.: Strong constructivizability of homogeneous models. Algebra i Logika 17, 363\u2013388 (1978)","journal-title":"Algebra i Logika"},{"key":"615_CR4","volume-title":"A Shorter Model Theory","author":"W Hodges","year":"1997","unstructured":"Hodges, W.: A Shorter Model Theory. Cambridge University Press, Cambridge (1997)"},{"key":"615_CR5","volume-title":"Model Theory for Infinitary Logic","author":"HJ Keisler","year":"1971","unstructured":"Keisler, H.J.: Model Theory for Infinitary Logic. North-Holland, Amsterdam (1971)"},{"key":"615_CR6","first-page":"271","volume-title":"Model-Theoretic Logics","author":"M Nadel","year":"1985","unstructured":"Nadel, M.: \n                    \n                      \n                    \n                    $$L_{\\omega _1,\\omega }$$\n                    \n                      \n                        \n                          L\n                          \n                            \n                              \u03c9\n                              1\n                            \n                            ,\n                            \u03c9\n                          \n                        \n                      \n                    \n                   and admissible fragments. In: Barwise, K.J., Feferman, S. (eds.) Model-Theoretic Logics, pp. 271\u2013316. Springer, New York (1985)"},{"key":"615_CR7","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0003-4843(74)90017-5","volume":"7","author":"M Nadel","year":"1974","unstructured":"Nadel, M.: Scott sentences and admissible sets. Ann. Math. Logic 7, 267\u2013294 (1974)","journal-title":"Ann. Math. Logic"},{"key":"615_CR8","first-page":"436","volume":"17","author":"MG Peretyat\u2019kin","year":"1978","unstructured":"Peretyat\u2019kin, M.G.: A criterion of strong constructivizability of a homogeneous model. Algebra i Logika 17, 436\u2013454 (1978)","journal-title":"Algebra i Logika"},{"key":"615_CR9","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0003-4843(73)90003-X","volume":"6","author":"J-P Ressayre","year":"1973","unstructured":"Ressayre, J.-P.: Boolean valued models and infinitary first order languages. Ann. Math. Logic 6, 41\u201392 (1973)","journal-title":"Ann. Math. Logic"},{"key":"615_CR10","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0003-4843(77)90009-2","volume":"11","author":"J-P Ressayre","year":"1977","unstructured":"Ressayre, J.-P.: Models with compactness properties relative to an admissible language. Ann. Math. Logic 11, 31\u201355 (1977)","journal-title":"Ann. Math. Logic"},{"key":"615_CR11","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H Rogers","year":"1967","unstructured":"Rogers, H.: Theory of Recursive Functions and Effective Computability. McGraw Hill, New York (1967)"},{"key":"615_CR12","first-page":"329","volume-title":"The Theory of Models","author":"D Scott","year":"1965","unstructured":"Scott, D.: Logic with denumerably long formulas and finite strings of quantifiers. In: Addison, J., Henkin, L., Tarski, A. (eds.) The Theory of Models, pp. 329\u2013341. North-Holland, Amsterdam (1965)"},{"key":"615_CR13","doi-asserted-by":"publisher","first-page":"131","DOI":"10.4064\/fm222-2-2","volume":"6","author":"I Souldatos","year":"2013","unstructured":"Souldatos, I.: Characterizing the power set by a complete Scott sentence. Fundam. Math. 6, 131\u2013154 (2013)","journal-title":"Fundam. Math."}],"container-title":["Archive for Mathematical Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00153-018-0615-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-018-0615-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-018-0615-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,31]],"date-time":"2019-01-31T21:10:12Z","timestamp":1548969012000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00153-018-0615-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,1]]},"references-count":13,"journal-issue":{"issue":"7-8","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["615"],"URL":"https:\/\/doi.org\/10.1007\/s00153-018-0615-6","relation":{},"ISSN":["0933-5846","1432-0665"],"issn-type":[{"type":"print","value":"0933-5846"},{"type":"electronic","value":"1432-0665"}],"subject":[],"published":{"date-parts":[[2018,2,1]]},"assertion":[{"value":"1 November 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 January 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 February 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}