{"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":1747173868813,"version":"3.40.5"},"reference-count":58,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2023,3,13]],"date-time":"2023-03-13T00:00:00Z","timestamp":1678665600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["cambridge.org"],"crossmark-restriction":true},"short-container-title":["The Review of Symbolic Logic"],"published-print":{"date-parts":[[2024,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this paper, I develop an algorithmic impossible-worlds model of belief and knowledge that provides a middle ground between models that entail that everyone is logically omniscient and those that are compatible with even the most egregious kinds of logical incompetence. In outline, the model entails that an agent believes (knows)<jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S1755020323000059_inline1.png\"\/><jats:tex-math>$\\phi $<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>just in case she can easily (and correctly) compute that<jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S1755020323000059_inline2.png\"\/><jats:tex-math>$\\phi $<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>is true and thus has the capacity to make her actions depend on whether<jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S1755020323000059_inline3.png\"\/><jats:tex-math>$\\phi $<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>. The model thereby captures the standard view that belief and knowledge ground are constitutively connected to dispositions to act. As I explain, the model improves upon standard algorithmic models developed by Parikh, Halpern, Moses, Vardi, and Duc, among other ways, by integrating them into an impossible-worlds framework. The model also avoids some important disadvantages of recent candidate middle-ground models based on dynamic epistemic logic or step logic, and it can subsume their most important advantages.<\/jats:p>","DOI":"10.1017\/s1755020323000059","type":"journal-article","created":{"date-parts":[[2023,3,13]],"date-time":"2023-03-13T09:46:18Z","timestamp":1678700778000},"page":"586-610","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":0,"title":["AN ALGORITHMIC IMPOSSIBLE-WORLDS MODEL OF BELIEF AND KNOWLEDGE"],"prefix":"10.1017","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7573-3239","authenticated-orcid":false,"given":"ZEYNEP","family":"SOYSAL","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2023,3,13]]},"reference":[{"key":"S1755020323000059_r33","doi-asserted-by":"publisher","DOI":"10.4324\/9781315742144-6"},{"key":"S1755020323000059_r51","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780198810346.001.0001"},{"volume-title":"The Stanford Encyclopedia of Philosophy","year":"2019","author":"Schwitzgebel","key":"S1755020323000059_r37"},{"key":"S1755020323000059_r52","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780198850670.003.0008"},{"key":"S1755020323000059_r42","doi-asserted-by":"publisher","DOI":"10.1007\/s10849-022-09367-w"},{"key":"S1755020323000059_r45","doi-asserted-by":"publisher","DOI":"10.1111\/j.1468-0068.2006.00619.x"},{"key":"S1755020323000059_r55","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780190086152.001.0001"},{"key":"S1755020323000059_r49","doi-asserted-by":"publisher","DOI":"10.5840\/philtopics199624115"},{"volume-title":"On the Plurality of Worlds","year":"1986","author":"Lewis","key":"S1755020323000059_r30"},{"key":"S1755020323000059_r17","doi-asserted-by":"publisher","DOI":"10.1016\/B978-1-4832-1453-5.50022-2"},{"key":"S1755020323000059_r53","doi-asserted-by":"publisher","DOI":"10.1037\/0033-295X.90.4.293"},{"key":"S1755020323000059_r46","first-page":"79","volume-title":"Issues in the Philosophy of Language","author":"Stalnaker","year":"1976"},{"key":"S1755020323000059_r1","doi-asserted-by":"publisher","DOI":"10.2307\/2687821"},{"key":"S1755020323000059_r14","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/7.5.633"},{"key":"S1755020323000059_r21","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780199682706.001.0001"},{"key":"S1755020323000059_r31","doi-asserted-by":"publisher","DOI":"10.1305\/ndjfl\/1039540769"},{"key":"S1755020323000059_r13","first-page":"237","volume-title":"Progress in Artificial Intelligence. EPIA 1995. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence","author":"Duc","year":"1995"},{"key":"S1755020323000059_r23","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198709008.001.0001"},{"volume-title":"An Introduction to G\u00f6del\u2019s Theorems","year":"2020","author":"Smith","key":"S1755020323000059_r39"},{"volume-title":"The Stanford Encyclopedia of Philosophy","year":"2018","author":"Baltag","key":"S1755020323000059_r2"},{"key":"S1755020323000059_r8","doi-asserted-by":"publisher","DOI":"10.1007\/s10992-018-9473-2"},{"key":"S1755020323000059_r12","doi-asserted-by":"publisher","DOI":"10.1145\/12808.12837"},{"key":"S1755020323000059_r32","doi-asserted-by":"publisher","DOI":"10.1111\/phc3.12027"},{"key":"S1755020323000059_r44","first-page":"1","article-title":"A metalinguistic and computational approach to the problem of mathematical omniscience","author":"Soysal","year":"2022","journal-title":"Philosophy and Phenomenological Research"},{"volume-title":"Inquiry","year":"1984","author":"Stalnaker","key":"S1755020323000059_r47"},{"key":"S1755020323000059_r43","doi-asserted-by":"publisher","DOI":"10.1007\/s10670-019-00128-z"},{"key":"S1755020323000059_r5","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780198812791.001.0001"},{"key":"S1755020323000059_r15","unstructured":"[15] Duc, H. N. (2001). Resource-Bounded Reasoning about Knowledge. Ph.D. Thesis, Faculty of Mathematics and Informatics, University of Leipzig."},{"key":"S1755020323000059_r6","doi-asserted-by":"publisher","DOI":"10.1007\/s11229-011-0038-y"},{"key":"S1755020323000059_r34","first-page":"432","volume-title":"Methodologies for Intelligent Systems, Proceedings of the Second International Symposium, Charlotte, North Carolina, USA, October 14\u201317, 1987","author":"Parikh","year":"1987"},{"key":"S1755020323000059_r28","doi-asserted-by":"publisher","DOI":"10.1007\/s11229-021-03394-z"},{"key":"S1755020323000059_r57","doi-asserted-by":"publisher","DOI":"10.1007\/BF00354640"},{"key":"S1755020323000059_r38","first-page":"377","article-title":"Dynamic epistemic logic and logical omniscience","volume":"24","author":"Skipper Rasmussen","year":"2015","journal-title":"Logic and Logical Philosophy"},{"key":"S1755020323000059_r35","doi-asserted-by":"publisher","DOI":"10.1017\/S1755020308090059"},{"key":"S1755020323000059_r19","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2010.04.009"},{"volume-title":"The Stanford Encyclopedia of Philosophy","year":"2018","author":"Berto","key":"S1755020323000059_r4"},{"key":"S1755020323000059_r27","unstructured":"[27] Kipper, J. , Kocurek, A. W. , & Soysal, Z. (2022). The role of questions, circumstances, and algorithms in belief. In Degano, M. , Roberts, T. , Sbardolini, G. , and Schouwstra, M. , editors. Proceedings of the 23rd Amsterdam Colloquium, Amsterdam, Netherlands, 19\u201321 December, 2022. Amsterdam, Netherlands, pp. 181\u2013187."},{"key":"S1755020323000059_r3","doi-asserted-by":"publisher","DOI":"10.1007\/s11229-018-02008-5"},{"key":"S1755020323000059_r40","unstructured":"[40] Solaki, A. (2017). Steps Out of Logical Omniscience. MSc Thesis, University of Amsterdam."},{"key":"S1755020323000059_r9","doi-asserted-by":"publisher","DOI":"10.1111\/j.1933-1592.2010.00395.x"},{"key":"S1755020323000059_r25","doi-asserted-by":"publisher","DOI":"10.1111\/j.1468-0068.2011.00831.x"},{"key":"S1755020323000059_r54","doi-asserted-by":"publisher","DOI":"10.1007\/s11225-011-9347-x"},{"key":"S1755020323000059_r16","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5803.001.0001","volume-title":"Reasoning about Knowledge","author":"Fagin","year":"1995"},{"key":"S1755020323000059_r50","doi-asserted-by":"publisher","DOI":"10.1093\/0198237073.003.0015"},{"volume-title":"Knowledge and its Limits","year":"2000","author":"Williamson","key":"S1755020323000059_r56"},{"key":"S1755020323000059_r26","doi-asserted-by":"publisher","DOI":"10.1111\/phc3.12415"},{"volume-title":"Worlds and Individuals, Possible and Otherwise","year":"2010","author":"Yagisawa","key":"S1755020323000059_r58"},{"key":"S1755020323000059_r7","doi-asserted-by":"publisher","DOI":"10.1093\/pq\/pqw028"},{"key":"S1755020323000059_r18","first-page":"1","article-title":"Probabilistic algorithmic knowledge","volume":"1","author":"Halpern","year":"2005","journal-title":"Logical Methods in Computer Science"},{"key":"S1755020323000059_r41","first-page":"229","volume-title":"The Logica Yearbook, Hejnice, Czech Republic, June 18\u201322, 2018","author":"Solaki","year":"2019"},{"key":"S1755020323000059_r22","unstructured":"[22] Jago, M. (2006). Logics for Resource-Bound Agents. Ph.D. Thesis, The University of Nottingham."},{"key":"S1755020323000059_r10","doi-asserted-by":"publisher","DOI":"10.1111\/j.1746-8361.2012.01303.x"},{"key":"S1755020323000059_r48","doi-asserted-by":"publisher","DOI":"10.1007\/BF00413506"},{"key":"S1755020323000059_r36","first-page":"18","article-title":"Impossible worlds semantics and logical omniscience","volume":"35","author":"Rantala","year":"1982","journal-title":"Acta Philosophica Fennica"},{"key":"S1755020323000059_r20","first-page":"1","article-title":"Modeling adversaries in a logic for security protocol analysis","volume":"8","author":"Halpern","year":"2012","journal-title":"Logical Methods in Computer Science"},{"key":"S1755020323000059_r11","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199591596.003.0003"},{"key":"S1755020323000059_r24","doi-asserted-by":"publisher","DOI":"10.1007\/s10670-013-9545-1"},{"key":"S1755020323000059_r29","doi-asserted-by":"publisher","DOI":"10.2307\/2184843"}],"container-title":["The Review of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1755020323000059","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,16]],"date-time":"2024-10-16T07:11:26Z","timestamp":1729062686000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1755020323000059\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,13]]},"references-count":58,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["S1755020323000059"],"URL":"https:\/\/doi.org\/10.1017\/s1755020323000059","relation":{},"ISSN":["1755-0203","1755-0211"],"issn-type":[{"type":"print","value":"1755-0203"},{"type":"electronic","value":"1755-0211"}],"subject":[],"published":{"date-parts":[[2023,3,13]]},"assertion":[{"value":"\u00a9 The Author(s), 2023. 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"}},{"value":"This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https:\/\/creativecommons.org\/licenses\/by\/4.0\/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.","name":"license","label":"License","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}