{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T18:28:48Z","timestamp":1770748128607,"version":"3.49.0"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030514655","type":"print"},{"value":"9783030514662","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-51466-2_6","type":"book-chapter","created":{"date-parts":[[2020,6,23]],"date-time":"2020-06-23T13:03:46Z","timestamp":1592917426000},"page":"63-74","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["On Interpretability Between Some Weak Essentially Undecidable Theories"],"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":[[2020,6,24]]},"reference":[{"key":"6_CR1","unstructured":"Cheng, Y.: Finding the limit of incompleteness I. arXiv:1902.06658v2"},{"key":"6_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 theory. Bull. Symb. Logic 23, 381\u2013404 (2017)","journal-title":"Bull. Symb. Logic"},{"key":"6_CR3","first-page":"72","volume-title":"Andrzej Mostowski and Foundational Studies","author":"A Grzegorczyk","year":"2008","unstructured":"Grzegorczyk, A., Zdanowski, K.: Undecidability and concatenation. In: Ehrenfeucht, A., et al. (eds.) Andrzej Mostowski and Foundational Studies, pp. 72\u201391. IOS, Amsterdam (2008)"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1007\/s00153-014-0391-x","volume":"53","author":"K Higuchi","year":"2014","unstructured":"Higuchi, K., Horihata, Y.: Weak theories of concatenation and minimal essentially undecidable theories. Arch. Math. Logic 53, 835\u2013853 (2014). https:\/\/doi.org\/10.1007\/s00153-014-0391-x","journal-title":"Arch. Math. Logic"},{"key":"6_CR5","doi-asserted-by":"publisher","unstructured":"Jerabek, E.: Recursive functions and existentially closed structures. J. Math. Logic (2019). https:\/\/doi.org\/10.1142\/S0219061320500026","DOI":"10.1142\/S0219061320500026"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/BF02023013","volume":"23","author":"J Jones","year":"1983","unstructured":"Jones, J., Shepherdson, J.: Variants of Robinson\u2019s essentially undecidable theory $$R$$. Archiv f\u00fcr mathematische Logik und Grundlagenforschung 23, 61\u201364 (1983)","journal-title":"Archiv f\u00fcr mathematische Logik und Grundlagenforschung"},{"key":"6_CR7","unstructured":"Kristiansen, L., Murwanashyaka, J.: First-order concatenation theory with bounded quantifiers. Arch. Math. Logic (accepted)"},{"key":"6_CR8","first-page":"347","volume":"81","author":"V Svejdar","year":"2007","unstructured":"Svejdar, V.: An interpretation of Robinson arithmetic in its Grzegorczyk\u2019s weaker variant. Fundamenta Informaticae 81, 347\u2013354 (2007)","journal-title":"Fundamenta Informaticae"},{"key":"6_CR9","volume-title":"Undecidable Theories","author":"A Tarski","year":"1953","unstructured":"Tarski, A., Mostowski, A., Robinson, R.M.: Undecidable Theories. North-Holland, Amsterdam (1953)"},{"key":"6_CR10","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, 61\u201385 (2009)","journal-title":"Notre Dame J. Formal Logic"},{"key":"6_CR11","unstructured":"Visser, A.: Why the theory $$R$$ is special. In: Tennant, N. (ed.) Foundational Adventures. Essays in Honour of Harvey Friedman, pp. 7\u201323. College Publications, UK (2014)"}],"container-title":["Lecture Notes in Computer Science","Beyond the Horizon of Computability"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-51466-2_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,9]],"date-time":"2021-03-09T18:08:01Z","timestamp":1615313281000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-51466-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030514655","9783030514662"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-51466-2_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"24 June 2020","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":"Fisciano","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cie2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cie2020.wordpress.com\/","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":"72","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":"5","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":"39% - 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","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":"7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","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 was held virtually due to the coronavirus 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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}