Dynamic Epistemic Logic for Budget-Constrained Agents

In Carlos Areces & Diana Costa (eds.), Dynamic Logic. New Trends and Applications: 4th International Workshop, DaLí 2022, Haifa, Israel, July 31–August 1, 2022, Revised Selected Papers. Springer Verlag. pp. 56-72 (2023)
  Copy   BIBTEX

Abstract

We present a static (\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\textsf{EL}_{\textsf{bc}}$$\end{document}) and dynamic (\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\textsf{DEL}_{\textsf{bc}}$$\end{document}) epistemic logic for budget-constrained agents, in which an agent can obtain some information in exchange for budget resources. \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\textsf{EL}_{\textsf{bc}}$$\end{document} extends a standard multi-agent epistemic logic with expressions concerning agent’s budgets and formulas’ costs. \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\textsf{DEL}_{\textsf{bc}}$$\end{document} extends \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\textsf{EL}_{\textsf{bc}}$$\end{document} with dynamic modality “\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$[?_i A]\varphi $$\end{document}” which reads as “\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varphi $$\end{document} holds after i’s question whether a propositional formula A is true”. In this paper we provide a sound and complete axiomatization for \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\textsf{EL}_{\textsf{bc}}$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\textsf{DEL}_{\textsf{bc}}$$\end{document} and show that both logics are decidable.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,423

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

A remark on hereditarily nonparadoxical sets.Péter Komjáth - 2016 - Archive for Mathematical Logic 55 (1-2):165-175.
Cofinality of the laver ideal.Miroslav Repický - 2016 - Archive for Mathematical Logic 55 (7-8):1025-1036.
Hard Provability Logics.Mojtaba Mojtahedi - 2021 - In Mojtaba Mojtahedi, Shahid Rahman & MohammadSaleh Zarepour (eds.), Mathematics, Logic, and their Philosophies: Essays in Honour of Mohammad Ardeshir. Springer. pp. 253-312.
$$I_0$$ I 0 and combinatorics at $$\lambda ^+$$ λ +.Nam Trang & Xianghui Shi - 2017 - Archive for Mathematical Logic 56 (1-2):131-154.
Models of weak theories of truth.Mateusz Łełyk & Bartosz Wcisło - 2017 - Archive for Mathematical Logic 56 (5-6):453-474.
Isomorphic and strongly connected components.Miloš S. Kurilić - 2015 - Archive for Mathematical Logic 54 (1-2):35-48.
Minimal elementary end extensions.James H. Schmerl - 2017 - Archive for Mathematical Logic 56 (5-6):541-553.
Iterated multiplication in $$ VTC ^0$$ V T C 0. [REVIEW]Emil Jeřábek - 2022 - Archive for Mathematical Logic 61 (5-6):705-767.

Analytics

Added to PP
2023-04-13

Downloads
8 (#1,291,989)

6 months
6 (#512,819)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Vitaliy Dolgorukov
National Research University Higher School of Economics

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references