Completeness by Modal Definitions. Application to the Epistemic Logic With Hypotheses
Open Access
- 1 April 2020
- journal article
- research article
- Published by IBERAMIA: Sociedad Iberoamericana de Inteligencia Artificial in INTELIGENCIA ARTIFICIAL
- Vol. 23 (65), 1-18
- https://doi.org/10.4114/intartif.vol23iss65pp1-18
Abstract
We investigate the variant of epistemic logic S5 for reasoning about knowledge under hypotheses. The logic is equipped with a modal operator of necessity that can be parameterized with a hypothesis representing background assumptions. The modal operator can be described as relative necessity and the resulting logic turns out to be a variant of Chellas’ Conditional Logic. We present an axiomatization of the logic and its extension with the common knowledge operator and distributed knowledge operator. We show that the logics are decidable, complete w.r.t. Kripke as well as topological structures. The topological completeness results are obtained by utilizing the Alexandroff connection between preorders and Alexandroff spaces.Keywords
This publication has 3 references indexed in Scilit:
- Completeness by Modal DefinitionsPublished by Springer Science and Business Media LLC ,2018
- Around provability logicAnnals of Pure and Applied Logic, 2009
- RATIONAL DYNAMICS AND EPISTEMIC LOGIC IN GAMESInternational Game Theory Review, 2007