{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,28]],"date-time":"2026-07-28T08:31:26Z","timestamp":1785227486006,"version":"3.55.0"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031643088","type":"print"},{"value":"9783031643095","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-64309-5_18","type":"book-chapter","created":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T22:01:49Z","timestamp":1719871309000},"page":"218-232","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Existential Definability of\u00a0Unary Predicates in\u00a0B\u00fcchi Arithmetic"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2288-9483","authenticated-orcid":false,"given":"Mikhail R.","family":"Starchak","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,7,2]]},"reference":[{"key":"18_CR1","unstructured":"Bruy\u00e8re, V.: Entiers et automates finis. M\u00e9moire de fin d\u2019\u00e9tudes, University of Mons, Belgium (1985)"},{"issue":"2","key":"18_CR2","doi-asserted-by":"publisher","first-page":"191","DOI":"10.36045\/bbms\/1103408547","volume":"1","author":"V Bruy\u00e8re","year":"1994","unstructured":"Bruy\u00e8re, V., Hansel, G., Michaux, C., Villemaire, R.: Logic and $$p$$-recognizable sets of integers. Bull. Belgian Math. Soc. Simon Stevin 1(2), 191\u2013238 (1994). https:\/\/doi.org\/10.36045\/bbms\/1103408547","journal-title":"Bull. Belgian Math. Soc. Simon Stevin"},{"issue":"1\u20136","key":"18_CR3","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1002\/malq.19600060105","volume":"6","author":"RJ B\u00fcchi","year":"1960","unstructured":"B\u00fcchi, R.J.: Weak second-order arithmetic and finite automata. Math. Log. Q. 6(1\u20136), 66\u201392 (1960). https:\/\/doi.org\/10.1002\/malq.19600060105","journal-title":"Math. Log. Q."},{"issue":"2","key":"18_CR4","doi-asserted-by":"publisher","first-page":"285","DOI":"10.2140\/pjm.1966.16.285","volume":"16","author":"S Ginsburg","year":"1966","unstructured":"Ginsburg, S., Spanier, E.: Semigroups, Presburger formulas, and languages. Pac. J. Math 16(2), 285\u2013296 (1966). https:\/\/doi.org\/10.2140\/pjm.1966.16.285","journal-title":"Pac. J. Math"},{"key":"18_CR5","doi-asserted-by":"publisher","unstructured":"Gr\u00e4del, E.: Automatic structures: twenty years later. In: Proceedings of the 35th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS 2020), pp. 21\u201334. Association for Computing Machinery, New York (2020). https:\/\/doi.org\/10.1145\/3373718.3394734","DOI":"10.1145\/3373718.3394734"},{"issue":"3","key":"18_CR6","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1145\/3242953.3242964","volume":"5","author":"C Haase","year":"2018","unstructured":"Haase, C.: A survival guide to Presburger arithmetic. ACM SIGLOG News 5(3), 67\u201382 (2018). https:\/\/doi.org\/10.1145\/3242953.3242964","journal-title":"ACM SIGLOG News"},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/978-3-030-71995-1_16","volume-title":"Foundations of Software Science and Computation Structures","author":"C Haase","year":"2021","unstructured":"Haase, C., R\u00f3\u017cycki, J.: On the expressiveness of B\u00fcchi arithmetic. In: Kiefer, S., Tasson, C. (eds.) FOSSACS 2021. LNCS, vol. 12650, pp. 310\u2013323. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-71995-1_16"},{"issue":"1","key":"18_CR8","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0022-0000(83)90031-4","volume":"27","author":"K Hashiguchi","year":"1983","unstructured":"Hashiguchi, K.: Representation theorems on regular languages. J. Comput. Syst. Sci. 27(1), 101\u2013115 (1983). https:\/\/doi.org\/10.1016\/0022-0000(83)90031-4","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"18_CR9","doi-asserted-by":"publisher","first-page":"1433","DOI":"10.1016\/s0304-3975(02)00047-6","volume":"290","author":"A Muchnik","year":"2003","unstructured":"Muchnik, A.: The definable criterion for definability in Presburger arithmetic and its applications. Theor. Comput. Sci. 290(3), 1433\u20131444 (2003). https:\/\/doi.org\/10.1016\/s0304-3975(02)00047-6","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"18_CR10","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1070\/im1980v015n02abeh001252","volume":"15","author":"A Sem\u00ebnov","year":"1980","unstructured":"Sem\u00ebnov, A.: On certain extensions of the arithmetic of addition of natural numbers. Math. USSR-Izvestiya 15(2), 401\u2013418 (1980). https:\/\/doi.org\/10.1070\/im1980v015n02abeh001252","journal-title":"Math. USSR-Izvestiya"},{"key":"18_CR11","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/978-3-031-30829-1_9","volume-title":"FOSSACS 2023","author":"M Starchak","year":"2023","unstructured":"Starchak, M.: On the existential arithmetics with addition and bitwise minimum. In: Kupferman, O., Sobocinski, P. (eds.) FOSSACS 2023. LNCS, vol. 13992, pp. 176\u2013195. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30829-1_9"},{"key":"18_CR12","doi-asserted-by":"publisher","unstructured":"Shallit, J.: The Logical Approach to Automatic Sequences: Exploring Combinatorics on Words with Walnut, 1st edn. Cambridge University Press (2022). https:\/\/doi.org\/10.1017\/9781108775267","DOI":"10.1017\/9781108775267"},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1007\/3-540-55808-X_48","volume-title":"Mathematical Foundations of Computer Science 1992","author":"A Szilard","year":"1992","unstructured":"Szilard, A., Yu, S., Zhang, K., Shallit, J.: Characterizing regular languages with polynomial densities. In: Havel, I.M., Koubek, V. (eds.) MFCS 1992. LNCS, vol. 629, pp. 494\u2013503. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-55808-X_48"},{"issue":"2","key":"18_CR14","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/0304-3975(92)90256-f","volume":"106","author":"R Villemaire","year":"1992","unstructured":"Villemaire, R.: The theory of $$\\left\\langle \\mathbb{N}; +, V_{k}, V_{l}\\right\\rangle $$ is undecidable. Theor. Comput. Sci. 106(2), 337\u2013349 (1992). https:\/\/doi.org\/10.1016\/0304-3975(92)90256-f","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Twenty Years of Theoretical and Practical Synergies"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-64309-5_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T22:03:39Z","timestamp":1719871419000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-64309-5_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031643088","9783031643095"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-64309-5_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"2 July 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The author have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"CiE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Computability in Europe","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Amsterdam","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cie2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}