{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T08:36:34Z","timestamp":1774946194270,"version":"3.50.1"},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"4","license":[{"start":{"date-parts":[[2025,12,15]],"date-time":"2025-12-15T00:00:00Z","timestamp":1765756800000},"content-version":"unspecified","delay-in-days":14,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":["cambridge.org"],"crossmark-restriction":true},"short-container-title":["Bull. symb. log"],"published-print":{"date-parts":[[2025,12]]},"abstract":"Abstract<\/jats:title>\n \n The dissertation consists of an introductory chapter and eight published articles centered around the following topics: (1) calibration of the interpretability strength of weak first-order theories; (2) determination of the (un)decidability of fine-grained fragments of the intended models of the aforementioned theories; and (3) investigation of algebraic properties of the lattice of interpretability degrees of computably enumerable essentially undecidable theories.\n \n \n 1.<\/jats:label>\n \n J. Murwanashyaka, A weak theory of building blocks.\n Mathematical Logic Quarterly<\/jats:italic>\n , vol. 70 (2024), pp. 233\u2013254. doi:\n 10.1002\/malq.202300015<\/jats:uri>\n <\/jats:p>\n <\/jats:list-item>\n \n 2.<\/jats:label>\n \n J. Murwanashyaka, Hilbert\u2019s tenth problem for term algebras with a substitution operator.\n Computability<\/jats:italic>\n , vol. 13 (2024), nos. 3\u20134, pp. 433\u2013457. doi:\n 10.3233\/COM-230444<\/jats:uri>\n <\/jats:p>\n <\/jats:list-item>\n \n 3.<\/jats:label>\n \n J. Murwanashyaka, Weak essentially undecidable theories of concatenation, part II.\n Archive for Mathematical Logic<\/jats:italic>\n , vol. 63 (2024), pp. 353\u2013390. doi:\n 10.1007\/s00153-023-00898-y<\/jats:uri>\n <\/jats:p>\n <\/jats:list-item>\n \n 4.<\/jats:label>\n \n J. Murwanashyaka, F. Pakhomov, and A. Visser, There are no minimal essentially undecidable theories.\n Journal of Logic and Computation<\/jats:italic>\n , vol. 34 (2024), no. 6, pp. 1159\u20131171. doi:\n 10.1093\/logcom\/exad005<\/jats:uri>\n <\/jats:p>\n <\/jats:list-item>\n \n 5.<\/jats:label>\n \n J. Murwanashyaka, Weak essentially undecidable theories of concatenation.\n Archive for Mathematical Logic<\/jats:italic>\n , vol. 61 (2022), nos. 7\u20138, pp. 939\u2013976. doi:\n 10.1007\/s00153-022-00820-y<\/jats:uri>\n .\n <\/jats:p>\n <\/jats:list-item>\n \n 6.<\/jats:label>\n \n J. Murwanashyaka, Weak sequential theories of finite full binary trees,\n Revolutions and Revelations in Computability<\/jats:italic>\n (U. Berger, J. N. Y. Franklin, F. Manea, and A. Pauly, editors), CiE 2022, Lecture Notes in Computer Science, Vol. 13359, Springer International Publishing, 2022, pp. 208\u2013219. doi:\n 10.1007\/978-3-031-08740-0_18<\/jats:uri>\n .\n <\/jats:p>\n <\/jats:list-item>\n \n 7.<\/jats:label>\n \n L. Kristiansen and J. Murwanashyaka, First-order concatenation theory with bounded quantifiers.\n Archive for Mathematical Logic<\/jats:italic>\n , vol. 60 (2021), nos. 1\u20132, pp. 77\u2013104. doi:\n 10.1007\/s00153-020-00735-6<\/jats:uri>\n .\n <\/jats:p>\n <\/jats:list-item>\n \n 8.<\/jats:label>\n \n L. Kristiansen and J. Murwanashyaka, On interpretability between some weak essentially undecidable theories,\n Beyond the Horizon of Computability<\/jats:italic>\n (M. Anselmo, G. Della Vedova, F. Manea, and A. Pauly, editors), CiE 2020, Lecture Notes in Computer Science, Vol. 12098, Springer International Publishing, 2020, pp. 63\u201374. doi:\n 10.1007\/978-3-030-51466-2_6<\/jats:uri>\n .\n <\/jats:p>\n <\/jats:list-item>\n <\/jats:list>\n <\/jats:p>\n Abstract prepared by Juvenal Murwanashyaka<\/jats:p>\n \n E-mail<\/jats:italic>\n :\n murwanashyaka@math.cas.cz<\/jats:email>\n <\/jats:p>\n \n URL<\/jats:italic>\n :\n http:\/\/hdl.handle.net\/10852\/104677<\/jats:uri>\n <\/jats:p>","DOI":"10.1017\/bsl.2025.10110","type":"journal-article","created":{"date-parts":[[2025,12,15]],"date-time":"2025-12-15T00:59:23Z","timestamp":1765760363000},"page":"696-696","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":0,"title":["JUVENAL MURWANASHYAKA.\n \n Papers on weak first-order theories and decidability problems<\/b>\n <\/i>\n , University of Oslo. 2023. Supervised by Lars Kristiansen, Dag Normann, and Tom Lindstr\u00f8m. MSC: 03B10, 03B25, 03D35, 03D40, 03F25, 03F30, 68R15. Keywords: decidability, interpretability, sequential theories, weak arithmetic."],"prefix":"10.1017","volume":"31","member":"56","published-online":{"date-parts":[[2025,12,15]]},"container-title":["The Bulletin of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1079898625101108","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T07:26:46Z","timestamp":1774942006000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1079898625101108\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12]]},"references-count":0,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["S1079898625101108"],"URL":"https:\/\/doi.org\/10.1017\/bsl.2025.10110","relation":{},"ISSN":["1079-8986","1943-5894"],"issn-type":[{"value":"1079-8986","type":"print"},{"value":"1943-5894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12]]},"assertion":[{"value":"\u00a9 The Author(s), 2025. Published by Cambridge University Press on behalf of The Association for Symbolic Logic","name":"copyright","label":"Copyright","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}}]}}