Relevant epistemic logic with public announcements and common knowledge

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F23%3A00572522" target="_blank" >RIV/67985807:_____/23:00572522 - isvavai.cz</a>
Alternative codes found
RIV/67985955:_____/23:00572522
Result on the web
<a href="https://doi.org/10.1093/logcom/exac100" target="_blank" >https://doi.org/10.1093/logcom/exac100</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1093/logcom/exac100" target="_blank" >10.1093/logcom/exac100</a>

Result language
angličtina
Original language name
Relevant epistemic logic with public announcements and common knowledge
Original language description
We study a version of public announcement logic with common knowledge based on the relevant logic R. Public announcements, as represented in our framework, are not necessarily truthful and accepted by all agents, nor is it assumed that beliefs are preserved under announcements. We establish a completeness result with respect to a relational semantics, and we show that an alternative semantics based on information states is dual to the relational one. We add a question-forming inquisitive disjunction operator to the language and prove a completeness result with respect to the information semantics.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10101 - Pure mathematics

Project
<a href="/en/project/GM21-23610M" target="_blank" >GM21-23610M: Logical Structure of Information Channels</a><br>
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2023
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)