Logics for Epistemic Actions: Completeness, Decidability, Expressivity

Author:

Baltag Alexandru1,Moss Lawrence S.2ORCID,Solecki Sławomir3

Affiliation:

1. Institute for Logic, Language and Computation (ILLC), University of Amsterdam, 1090 GE Amsterdam, The Netherlands

2. Mathematics Department, Indiana University, Bloomington, IN 47405-7106, USA

3. Mathematics Department, Cornell University, Ithaca, NY 14853, USA

Abstract

We build and study dynamic versions of epistemic logic. We study languages parameterized by an action signature that allows one to express epistemic actions such as (truthful) public announcements, completely private announcements to groups of agents, and more. The language L(Σ) is modeled on dynamic logic. Its sentence-building operations include modalities for the execution of programs, and for knowledge and common knowledge. Its program-building operations include action execution, composition, repetition, and choice. We consider two fragments of L(Σ). In L1(Σ), we drop action repetition; in L0(Σ), we also drop common knowledge. We present the syntax and semantics of these languages and sound proof systems for the validities in them. We prove the strong completeness of a logical system for L0(Σ) and the weak completeness of one for L1(Σ). We show the finite model property and, hence, decidability of L1(Σ). We translate L1(Σ) into PDL, obtaining a second proof of decidability. We prove results on expressive power, comparing L1(Σ) with modal logic together with transitive closure operators. We prove that a logical language with operators for private announcements is more expressive than one for public announcements.

Funder

Simons Foundation

Publisher

MDPI AG

Reference21 articles.

1. Plaza, J. (1989, January 12–14). Logics of public communications. Proceedings of the 4th International Symposium on Methodologies for Intelligent Systems, Charlotte, NC, USA.

2. Moss, L.S. (1999). Logic, Language, and Information, CSLI Publications, Stanford University.

3. Gerbrandy, J. (1999). Bisimulations on Planet Kripke. [Ph.D. Thesis, University of Amsterdam].

4. Reasoning about information change;Gerbrandy;J. Logic Lang. Inf.,1997

5. Baltag, A., Moss, L.S., and Solecki, S. (1998, January 22–24). The logic of common knowledge, public announcements, and private suspicions. Proceedings of the TARK-VII (Theoretical Aspects of the Rationality and Knowledge) Conference, Evanston, IL, USA.

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3