{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T22:04:28Z","timestamp":1747173868663,"version":"3.40.5"},"reference-count":22,"publisher":"Cambridge University Press (CUP)","issue":"1","license":[{"start":{"date-parts":[[2022,12,23]],"date-time":"2022-12-23T00:00:00Z","timestamp":1671753600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":["cambridge.org"],"crossmark-restriction":true},"short-container-title":["The Review of Symbolic Logic"],"published-print":{"date-parts":[[2024,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We systematically study several versions of the disjunction and the existence properties in modal arithmetic. First, we newly introduce three classes <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S1755020322000363_inline1.png\"\/><jats:tex-math>\n$\\mathrm {B}$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>, <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S1755020322000363_inline2.png\"\/><jats:tex-math>\n$\\Delta (\\mathrm {B})$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>, and <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S1755020322000363_inline3.png\"\/><jats:tex-math>\n$\\Sigma (\\mathrm {B})$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula> of formulas of modal arithmetic and study basic properties of them. Then, we prove several implications between the properties. In particular, among other things, we prove that for any consistent recursively enumerable extension <jats:italic>T<\/jats:italic> of <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S1755020322000363_inline4.png\"\/><jats:tex-math>\n$\\mathbf {PA}(\\mathbf {K})$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula> with <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S1755020322000363_inline5.png\"\/><jats:tex-math>\n$T \\nvdash \\Box \\bot $\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>, the <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S1755020322000363_inline6.png\"\/><jats:tex-math>\n$\\Sigma (\\mathrm {B})$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>-disjunction property, the <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S1755020322000363_inline7.png\"\/><jats:tex-math>\n$\\Sigma (\\mathrm {B})$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>-existence property, and the <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S1755020322000363_inline8.png\"\/><jats:tex-math>\n$\\mathrm {B}$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>-existence property are pairwise equivalent. Moreover, we introduce the notion of the <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S1755020322000363_inline9.png\"\/><jats:tex-math>\n$\\Sigma (\\mathrm {B})$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>-soundness of theories and prove that for any consistent recursively enumerable extension of <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S1755020322000363_inline10.png\"\/><jats:tex-math>\n$\\mathbf {PA}(\\mathbf {K4})$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>, the modal disjunction property is equivalent to the <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S1755020322000363_inline11.png\"\/><jats:tex-math>\n$\\Sigma (\\mathrm {B})$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>-soundness.<\/jats:p>","DOI":"10.1017\/s1755020322000363","type":"journal-article","created":{"date-parts":[[2022,12,23]],"date-time":"2022-12-23T08:03:47Z","timestamp":1671782627000},"page":"178-205","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":0,"title":["DISJUNCTION AND EXISTENCE PROPERTIES IN MODAL ARITHMETIC"],"prefix":"10.1017","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2016-5980","authenticated-orcid":false,"given":"TAISHI","family":"KURAHASHI","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"MOTOKI","family":"OKUDA","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2022,12,23]]},"reference":[{"key":"S1755020322000363_r10","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1979-0539907-7"},{"key":"S1755020322000363_r15","doi-asserted-by":"publisher","DOI":"10.1007\/s00153-018-0618-3"},{"key":"S1755020322000363_r21","doi-asserted-by":"publisher","DOI":"10.1016\/S0049-237X(08)70138-1"},{"key":"S1755020322000363_r11","doi-asserted-by":"publisher","DOI":"10.1002\/1521-3870(200010)46:4<461::AID-MALQ461>3.0.CO;2-I"},{"key":"S1755020322000363_r8","first-page":"301","volume-title":"Collected Works","volume":"1","author":"G\u00f6del","year":"1933"},{"key":"S1755020322000363_r18","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-1221-3"},{"key":"S1755020322000363_r20","doi-asserted-by":"publisher","DOI":"10.1007\/BF00243392"},{"key":"S1755020322000363_r17","doi-asserted-by":"publisher","DOI":"10.1305\/ndjfl\/1093894226"},{"key":"S1755020322000363_r22","doi-asserted-by":"publisher","DOI":"10.1007\/BF02757006"},{"key":"S1755020322000363_r7","doi-asserted-by":"publisher","DOI":"10.1007\/BF01201353"},{"volume-title":"The Logic of Provability","year":"1993","author":"Boolos","key":"S1755020322000363_r1"},{"key":"S1755020322000363_r19","first-page":"317","article-title":"Absolute versions of incompleteness theorems","volume":"19","author":"Reinhardt","year":"1985","journal-title":"N\u00f4us"},{"key":"S1755020322000363_r14","doi-asserted-by":"publisher","DOI":"10.2307\/2269016"},{"key":"S1755020322000363_r5","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.72.8.2877"},{"key":"S1755020322000363_r9","doi-asserted-by":"publisher","DOI":"10.2307\/2274102"},{"key":"S1755020322000363_r4","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(86)90043-6"},{"key":"S1755020322000363_r6","doi-asserted-by":"publisher","DOI":"10.1017\/S0022481200041190"},{"key":"S1755020322000363_r2","unstructured":"[2] Buchholz, W. (1993). Mathematische Logik II. Available from: http:\/\/www.mathematik.uni-muenchen.de\/buchholz\/articles\/LogikII.ps."},{"key":"S1755020322000363_r3","first-page":"13","article-title":"Modal translations of Heyting and Peano arithmetic","volume":"47","author":"Do\u0161en","year":"1990","journal-title":"Publications de l\u2019Institut Math\u00e9matique. Nouvelle S\u00e9rie"},{"key":"S1755020322000363_r12","doi-asserted-by":"publisher","DOI":"10.4324\/9780203290644"},{"key":"S1755020322000363_r16","doi-asserted-by":"publisher","DOI":"10.1017\/jsl.2020.33"},{"key":"S1755020322000363_r13","doi-asserted-by":"publisher","DOI":"10.4064\/fm-92-3-223-245"}],"container-title":["The Review of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1755020322000363","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,26]],"date-time":"2024-03-26T09:48:31Z","timestamp":1711446511000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1755020322000363\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,23]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["S1755020322000363"],"URL":"https:\/\/doi.org\/10.1017\/s1755020322000363","relation":{},"ISSN":["1755-0203","1755-0211"],"issn-type":[{"type":"print","value":"1755-0203"},{"type":"electronic","value":"1755-0211"}],"subject":[],"published":{"date-parts":[[2022,12,23]]},"assertion":[{"value":"\u00a9 The Author(s), 2022. 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"}}]}}