{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:50:35Z","timestamp":1709826635672},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,10,17]],"date-time":"2013-10-17T00:00:00Z","timestamp":1381968000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2014,11]]},"DOI":"10.1007\/s00224-013-9508-6","type":"journal-article","created":{"date-parts":[[2013,10,16]],"date-time":"2013-10-16T04:33:04Z","timestamp":1381897984000},"page":"856-880","source":"Crossref","is-referenced-by-count":2,"title":["Model-Theoretic Properties of \u03c9-Automatic Structures"],"prefix":"10.1007","volume":"55","author":[{"given":"Faried Abu","family":"Zaid","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erich","family":"Gr\u00e4del","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u0141ukasz","family":"Kaiser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wied","family":"Pakusa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,10,17]]},"reference":[{"key":"9508_CR1","first-page":"577","volume-title":"Proceedings of the International Symposium on Theoretical Aspects of Computer Science, STACS 2012","author":"F.A. Zaid","year":"2012","unstructured":"Zaid, F.A., Gr\u00e4del, E., Kaiser, \u0141.: The field of reals is not omega-automatic. In: D\u00fcrr, C., Wilke,\u00a0T. (eds.) Proceedings of the International Symposium on Theoretical Aspects of Computer Science, STACS 2012, pp. 577\u2013588 (2012)"},{"key":"9508_CR2","unstructured":"Blumensath, A.: Automatic structures. Diploma thesis, RWTH-Aachen (1999)"},{"key":"9508_CR3","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1007\/s00224-004-1133-y","volume":"37","author":"A. Blumensath","year":"2004","unstructured":"Blumensath, A., Gr\u00e4del, E.: Finite presentations of infinite structures: automata and interpretations. Theory Comput. Syst. 37, 641\u2013674 (2004)","journal-title":"Theory Comput. Syst."},{"key":"9508_CR4","first-page":"1","volume-title":"Proceedings of the International Congress on Logic, Methodology and Philosophy of Science","author":"J.R. B\u00fcchi","year":"1962","unstructured":"B\u00fcchi, J.R.: On decision method in restricted second order arithmetic. In: Proceedings of the International Congress on Logic, Methodology and Philosophy of Science, pp. 1\u201311 (1962)"},{"key":"9508_CR5","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/j.crma.2004.03.035","volume":"339","author":"C. Delhomm\u00e9","year":"2004","unstructured":"Delhomm\u00e9, C.: Automaticit\u00e9 des ordinaux et des graphes homog\u00e8nes. C. R. Acad. Sci., S\u00e9r. 1 Math. 339, 5\u201310 (2004)","journal-title":"C. R. Acad. Sci., S\u00e9r. 1 Math."},{"key":"9508_CR6","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1109\/LICS.2008.28","volume-title":"Proceedings of the IEEE Symposium on Logic in Computer Science, LICS 2008","author":"G. Hjorth","year":"2008","unstructured":"Hjorth, G., Khoussainov, B., Montalb\u00e1n, A., Nies, A.: From automatic structures to Borel structures. In: Proceedings of the IEEE Symposium on Logic in Computer Science, LICS 2008, pp. 431\u2013441 (2008)"},{"key":"9508_CR7","first-page":"385","volume-title":"Proceedings of the International Symposium on Theoretical Aspects of Computer Science, STACS 2008","author":"\u0141. Kaiser","year":"2008","unstructured":"Kaiser, \u0141., Rubin, S., B\u00e1r\u00e1ny, V.: Cardinality and counting quantifiers on \u03c9-automatic structures. In: Proceedings of the International Symposium on Theoretical Aspects of Computer Science, STACS 2008, pp. 385\u2013396. Schloss Dagstuhl\u2014Leibniz-Zentrum f\u00fcr Informatik, Germany (2008)"},{"key":"9508_CR8","doi-asserted-by":"crossref","unstructured":"Khoussainov, B., Nies, A., Rubin, S., Stephan, F.: Automatic structures: Richness and limitations. Log. Methods Comput. Sci. 3(2) (2007)","DOI":"10.2168\/LMCS-3(2:2)2007"},{"key":"9508_CR9","first-page":"537","volume-title":"Proceedings of the International Symposium on Theoretical Aspects of Computer Science, STACS 2010","author":"D. Kuske","year":"2010","unstructured":"Kuske, D.: Is Ramsey\u2019s Theorem \u03c9-automatic? In: Proceedings of the International Symposium on Theoretical Aspects of Computer Science, STACS 2010, pp. 537\u2013548 (2010)"},{"key":"9508_CR10","doi-asserted-by":"crossref","first-page":"129","DOI":"10.2178\/jsl\/1208358745","volume":"73","author":"D. Kuske","year":"2008","unstructured":"Kuske, D., Lohrey, M.: First-order and counting theories of \u03c9-automatic structures. J. Symb. Log. 73, 129\u2013150 (2008)","journal-title":"J. Symb. Log."},{"issue":"3","key":"9508_CR11","doi-asserted-by":"crossref","first-page":"305","DOI":"10.2178\/bsl\/1186666149","volume":"13","author":"A. Nies","year":"2007","unstructured":"Nies, A.: Describing groups. Bull. Symb. Log. 13(3), 305\u2013339 (2007)","journal-title":"Bull. Symb. Log."},{"key":"9508_CR12","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/978-94-011-0149-3_3","volume-title":"Semigroups, Formal Languages and Groups","author":"D. Perrin","year":"1995","unstructured":"Perrin, D., Pin, J.-E.: Semigroups and automata on infinite words. In: Semigroups, Formal Languages and Groups, York, 1993, pp. 49\u201372. Kluwer Academic, Dordrecht (1995)"},{"key":"9508_CR13","first-page":"1","volume":"41","author":"M.O. Rabin","year":"1969","unstructured":"Rabin, M.O.: Decidability of second-order theories and automata on infinite trees. Trans. Am. Math. Soc. 41, 1\u201335 (1969)","journal-title":"Trans. Am. Math. Soc."},{"issue":"30","key":"9508_CR14","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1112\/plms\/s2-30.1.264","volume":"3","author":"F.P. Ramsey","year":"1930","unstructured":"Ramsey, F.P.: On a problem in formal logic. Proc. Lond. Math. Soc. 3(30), 264\u2013286 (1930)","journal-title":"Proc. Lond. Math. Soc."},{"key":"9508_CR15","doi-asserted-by":"crossref","DOI":"10.1525\/9780520348097","volume-title":"A Decision Method for Elementary Algebra and Geometry","author":"A. Tarski","year":"1951","unstructured":"Tarski, A.: A Decision Method for Elementary Algebra and Geometry. University of California Press, Berkeley (1951)"},{"key":"9508_CR16","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/978-3-642-59126-6_7","volume-title":"Handbook of Formal Languages","author":"W. Thomas","year":"1997","unstructured":"Thomas, W.: Languages, automata, and logic. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 3, pp. 389\u2013455. Springer, New York (1997)"},{"issue":"4","key":"9508_CR17","doi-asserted-by":"crossref","first-page":"1341","DOI":"10.2178\/jsl\/1318338853","volume":"76","author":"T. Todor","year":"2011","unstructured":"Todor, T.: The additive group of the rationals does not have an automatic presentation. J. Symb. Log. 76(4), 1341\u20131351 (2011)","journal-title":"J. Symb. Log."},{"issue":"4","key":"9508_CR18","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1142\/S0218196793000287","volume":"3","author":"T. Wilke","year":"1993","unstructured":"Wilke, T.: An algebraic theory for regular languages of finite and infinite words. Int. J. Algebra Comput. 3(4), 447\u2013489 (1993)","journal-title":"Int. J. Algebra Comput."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-013-9508-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-013-9508-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-013-9508-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,9]],"date-time":"2022-03-09T05:57:33Z","timestamp":1646805453000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-013-9508-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,17]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,11]]}},"alternative-id":["9508"],"URL":"https:\/\/doi.org\/10.1007\/s00224-013-9508-6","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10,17]]}}}