{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T18:39:53Z","timestamp":1757615993368,"version":"3.44.0"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031087394"},{"type":"electronic","value":"9783031087400"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-08740-0_18","type":"book-chapter","created":{"date-parts":[[2022,6,25]],"date-time":"2022-06-25T14:33:51Z","timestamp":1656167631000},"page":"208-219","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Weak Sequential Theories of Finite Full Binary Trees"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7621-6540","authenticated-orcid":false,"given":"Juvenal","family":"Murwanashyaka","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,6,26]]},"reference":[{"issue":"4","key":"18_CR1","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 theory with extensionality. Bull. Symb. Logic 23(4), 381\u2013404 (2017)","journal-title":"Bull. Symb. Logic"},{"key":"18_CR2","doi-asserted-by":"publisher","unstructured":"Damnjanovic, Z.: Mutual interpretability of weak essentially undecidable theories. J. Symb. Logic 1\u201350 (2022). https:\/\/doi.org\/10.1017\/jsl.2022.15","DOI":"10.1017\/jsl.2022.15"},{"key":"18_CR3","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)"},{"issue":"3","key":"18_CR4","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1002\/malq.201200013","volume":"58","author":"E Je\u0159\u00e1bek","year":"2012","unstructured":"Je\u0159\u00e1bek, E.: Sequence encoding without induction. Math. Logic Q. 58(3), 244\u2013248 (2012)","journal-title":"Math. Logic Q."},{"key":"18_CR5","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":"18_CR6","doi-asserted-by":"crossref","unstructured":"Mycielski, J., Pudl\u00e1k, P., Stern, A.S.: A Lattice of Chapters of Mathematics (Interpretations Between Theorems), vol. 84, no. 426. Memoirs of the American Mathematical Society (1990)","DOI":"10.1090\/memo\/0426"},{"issue":"1","key":"18_CR7","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1090\/S0002-9947-1983-0712260-2","volume":"280","author":"P Pudl\u00e1k","year":"1983","unstructured":"Pudl\u00e1k, P.: Some prime elements in the lattice of interpretability types. Trans. Am. Math. Soc. 280(1), 255\u2013275 (1983)","journal-title":"Trans. Am. Math. Soc."},{"issue":"4","key":"18_CR8","doi-asserted-by":"publisher","first-page":"105","DOI":"10.2307\/2268308","volume":"11","author":"WV Quine","year":"1946","unstructured":"Quine, W.V.: Concatenation as a basis for arithmetic. J. Symb. Logic 11(4), 105\u2013114 (1946)","journal-title":"J. Symb. Logic"},{"key":"18_CR9","volume-title":"Undecidable Theories","author":"A Tarski","year":"1953","unstructured":"Tarski, A., Mostowski, A., Robinson, R.M.: Undecidable Theories. North-Holland, Amsterdam (1953)"},{"issue":"4","key":"18_CR10","doi-asserted-by":"publisher","first-page":"473","DOI":"10.2307\/2270175","volume":"32","author":"RL Vaught","year":"1967","unstructured":"Vaught, R.L.: Axiomatizability by a schema. J. Symb. Logic 32(4), 473\u2013479 (1967)","journal-title":"J. Symb. Logic"},{"issue":"4","key":"18_CR11","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(4), 299\u2013326 (2008). https:\/\/doi.org\/10.1007\/s00153-008-0087-1","journal-title":"Arch. Math. Logic"},{"issue":"1","key":"18_CR12","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1215\/00294527-2008-028","volume":"50","author":"A Visser","year":"2009","unstructured":"Visser, A.: Growing commas. A study of sequentiality and concatenation. Notre Dame J. Formal Logic 50(1), 61\u201385 (2009)","journal-title":"Notre Dame J. Formal Logic"}],"container-title":["Lecture Notes in Computer Science","Revolutions and Revelations in Computability"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-08740-0_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T17:12:59Z","timestamp":1757092379000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-08740-0_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031087394","9783031087400"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-08740-0_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"26 June 2022","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":"Swansea","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cie2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cs.swansea.ac.uk\/cie2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}