{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T10:32:35Z","timestamp":1743071555182,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031643088"},{"type":"electronic","value":"9783031643095"}],"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_31","type":"book-chapter","created":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T22:01:49Z","timestamp":1719871309000},"page":"390-404","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Weak First-Order Theory of\u00a0Sequences"],"prefix":"10.1007","author":[{"given":"Lars","family":"Kristiansen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juvenal","family":"Murwanashyaka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,7,2]]},"reference":[{"unstructured":"Kristiansen, L., Murwanashyaka, J.: Notes on interpretability between weak first-order theories: theories of sequences. arXiv:2402.14286","key":"31_CR1"},{"key":"31_CR2","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1017\/bsl.2017.30","volume":"23","author":"Z Damnjanovic","year":"2017","unstructured":"Damnjanovic, Z.: Mutual interpretability of robinson arithmetic and adjunctive set with extensionality. Bull. Symbolic Logic 23, 381\u2013404 (2017)","journal-title":"Bull. Symbolic Logic"},{"key":"31_CR3","doi-asserted-by":"publisher","first-page":"1374","DOI":"10.1017\/jsl.2022.15","volume":"87","author":"Z Damnjanovic","year":"2022","unstructured":"Damnjanovic, Z.: Mutual interpretability of weak essentially undecidable theories. J. Symb. Log. 87, 1374\u20131395 (2022)","journal-title":"J. Symb. Log."},{"unstructured":"Damnjanovic, Z.: Tree Theory: Interpretability Between Weak First-Order Theories of Trees. Bulletin of Symbolic Logic. Published online by Cambridge University Press, pp. 1\u201380, 10 February 2023","key":"31_CR4"},{"doi-asserted-by":"crossref","unstructured":"Mycielski, J., Pudlak, P., Stern, A.S.: A Lattice of Chapters of Mathematics (Interpretations Between Theorems). vol. 426 of Memoirs of the American Mathematical Society. AMS, Providence (1990)","key":"31_CR5","DOI":"10.1090\/memo\/0426"},{"doi-asserted-by":"crossref","unstructured":"Nelson, E.: Predicative Arithmetic. Princeton University Press, Princeton (1986)","key":"31_CR6","DOI":"10.1515\/9781400858927"},{"key":"31_CR7","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s11225-005-2976-1","volume":"79","author":"A Grzegorczyk","year":"2005","unstructured":"Grzegorczyk, A.: Undecidability without arithmetization. Stud. Logica. 79, 163\u2013230 (2005)","journal-title":"Stud. Logica."},{"key":"31_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/9781316717271","volume-title":"Metamathematics of First-Order Arithmetic","author":"P H\u00e1jek","year":"2017","unstructured":"H\u00e1jek, P., Pudl\u00e1k, P.: Metamathematics of First-Order Arithmetic. Cambridge University Press, Cambridge (2017)"},{"key":"31_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-030-51466-2_6","volume-title":"Beyond the Horizon of Computability","author":"L Kristiansen","year":"2020","unstructured":"Kristiansen, L., Murwanashyaka, J.: On interpretability between some weak essentially undecidable theories. In: Anselmo, M., Della Vedova, G., Manea, F., Pauly, A. (eds.) CiE 2020. LNCS, vol. 12098, pp. 63\u201374. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51466-2_6"},{"key":"31_CR10","doi-asserted-by":"publisher","first-page":"939","DOI":"10.1007\/s00153-022-00820-y","volume":"61","author":"J Murwanashyaka","year":"2022","unstructured":"Murwanashyaka, J.: Weak essentially undecidable theories of concatenation. Arch. Math. Logic 61, 939\u2013976 (2022)","journal-title":"Arch. Math. Logic"},{"doi-asserted-by":"publisher","unstructured":"Murwanashyaka, J.: Weak sequential theories of finite full binary trees. In: Berger, U., Franklin, J.N.Y., Manea, F., Pauly, A. (eds.) Revolutions and Revelations in Computability. CiE 2022. Lecture Notes in Computer Science, vol. 13359, pp. 208\u2013219. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-08740-0_18","key":"31_CR11","DOI":"10.1007\/978-3-031-08740-0_18"},{"key":"31_CR12","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/s00153-008-0087-1","volume":"47","author":"A Visser","year":"2008","unstructured":"Visser, A.: Pairs, sets and sequences in first-order theories. Arch. Math. Logic 47, 299\u2013326 (2008)","journal-title":"Arch. Math. Logic"},{"doi-asserted-by":"crossref","unstructured":"Visser, A.: Growing commas. A study of sequentiality and concatenation. Notre Dame J. Formal Logic 50, 61\u201385 (2009)","key":"31_CR13","DOI":"10.1215\/00294527-2008-028"}],"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_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T22:04:33Z","timestamp":1719871473000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-64309-5_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031643088","9783031643095"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-64309-5_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"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":"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"}}]}}