{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,29]],"date-time":"2026-07-29T10:06:28Z","timestamp":1785319588303,"version":"3.55.0"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030719944","type":"print"},{"value":"9783030719951","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,3,23]],"date-time":"2021-03-23T00:00:00Z","timestamp":1616457600000},"content-version":"vor","delay-in-days":81,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We show that the existential fragment of B\u00fcchi arithmetic is strictly less expressive than full B\u00fcchi arithmetic of any base, and moreover establish that its <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\varSigma _2$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msub>\n                    <mml:mi>\u03a3<\/mml:mi>\n                    <mml:mn>2<\/mml:mn>\n                  <\/mml:msub>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>-fragment is already expressively complete. Furthermore, we show that regular languages of polynomial growth are definable in the existential fragment of B\u00fcchi arithmetic.<\/jats:p>","DOI":"10.1007\/978-3-030-71995-1_16","type":"book-chapter","created":{"date-parts":[[2021,3,22]],"date-time":"2021-03-22T17:03:39Z","timestamp":1616432619000},"page":"310-323","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["On the Expressiveness of B\u00fcchi Arithmetic"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5452-936X","authenticated-orcid":false,"given":"Christoph","family":"Haase","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jakub","family":"R\u00f3\u017cycki","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,3,23]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Benedikt, M., Libkin, L., Schwentick, T., Segoufin, L.: Definable relations and first-order query languages over strings. J. ACM 50(5), 694\u2013751 (2003). https:\/\/doi.org\/10.1145\/876638.876642","DOI":"10.1145\/876638.876642"},{"key":"16_CR2","unstructured":"Bruy\u00e8re, V.: Entiers et automates finis. M\u00e9moire de fin d\u2019\u00e9tudes (1985)"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Bruy\u00e8re, V., Hansel, G., Michaux, C., Villemaire, R.: Logic and $$p$$-recognizable sets of integers. Bull. Belg. Math. Soc. Simon Stevin 1(2), 191\u2013238 (1994). https:\/\/doi.org\/10.36045\/bbms\/1103408547","DOI":"10.36045\/bbms\/1103408547"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"B\u00fcchi, J.: Weak second-order arithmetic and finite automata. Math. Logic Quart. 6(1\u20136), 66\u201392 (1960). https:\/\/doi.org\/10.1002\/malq.19600060105","DOI":"10.1002\/malq.19600060105"},{"key":"16_CR5","unstructured":"Chistikov, D., Haase, C.: The taming of the semi-linear set. In: Automata, Languages, and Programming, ICALP. LIPIcs, vol. 55, pp. 128:1\u2013128:13. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2016). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2016.128"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Chrobak, M.: Finite automata and unary languages. Theor. Comput. Sci. 47(3), 149\u2013158 (1986). https:\/\/doi.org\/10.1016\/0304-3975(86)90142-8","DOI":"10.1016\/0304-3975(86)90142-8"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Ginsburg, S., Spanier, E.: Bounded ALGOL-like languages. T. Am. Math. Soc. pp. 333\u2013368 (1964). https:\/\/doi.org\/10.2307\/1994067","DOI":"10.2307\/1994067"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Gu\u00e9pin, F., Haase, C., Worrell, J.: On the existential theories of B\u00fcchi arithmetic and linear p-adic fields. In: Logic in Computer Science, LICS. pp. 1\u201310. IEEE (2019). https:\/\/doi.org\/10.1109\/LICS.2019.8785681","DOI":"10.1109\/LICS.2019.8785681"},{"key":"16_CR9","unstructured":"Lohrey, M., Zetzsche, G.: Knapsack and the power word problem in solvable Baumslag-Solitar groups. In: Mathematical Foundations of Computer Science, MFCS. LIPIcs, vol. 170, pp. 67:1\u201367:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2020.67"},{"key":"16_CR10","unstructured":"Presburger, M.: \u00dcber die Vollst\u00e4ndigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt. In: Comptes Rendus du I congres de Mathematiciens des Pays Slaves, pp. 92\u2013101 (1929)"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Szilard, A., Yu, S., Zhang, K., Shallit, J.: Characterizing regular languages with polynomial densities. In: Mathematical Foundations of Computer Science, MFCS. Lect. Notes Comp. Sci., vol. 629, pp. 494\u2013503. Springer (1992). https:\/\/doi.org\/10.1007\/3-540-55808-X_48","DOI":"10.1007\/3-540-55808-X_48"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"To, A.: Unary finite automata vs. arithmetic progressions. Inf. Process. Lett. 109(17), 1010\u20131014 (2009). https:\/\/doi.org\/10.1016\/j.ipl.2009.06.005","DOI":"10.1016\/j.ipl.2009.06.005"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Villemaire, R.: The theory of ($$\\mathbb{{N}}, +, {V}_k, {V}_l$$) is undecidable. Theor. Comput. Sci. 106(2), 337\u2013349 (1992). https:\/\/doi.org\/10.1016\/0304-3975(92)90256-F","DOI":"10.1016\/0304-3975(92)90256-F"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Wolper, P., Boigelot, B.: On the construction of automata from linear arithmetic constraints. In: Tools and Algorithms for the Construction and Analysis of Systems, TACAS. Lect. Notes Comp. Sci., vol. 1785, pp. 1\u201319. Springer (2000). https:\/\/doi.org\/10.1007\/3-540-46419-0_1","DOI":"10.1007\/3-540-46419-0_1"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Woods, K.: The unreasonable ubiquitousness of quasi-polynomials. Elect. J. Combin. 21(1), P1.44 (2014). https:\/\/doi.org\/10.37236\/3750","DOI":"10.37236\/3750"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-71995-1_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,22]],"date-time":"2021-03-22T17:07:25Z","timestamp":1616432845000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-71995-1_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030719944","9783030719951"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-71995-1_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"23 March 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FOSSACS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Foundations of Software Science and Computation Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Luxembourg City","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Luxembourg","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 March 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 April 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fossacs2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/etaps.org\/2021\/fossacs","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"88","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference changed to an online format due to the COVID-19 pandemic","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}