Completeness by Modal Deï¬nitions. Application to the Epistemic Logic With Hypotheses
Keywords:Knowledge representation and reasosning, epistemic logic, Kripke Completeness, Topological Semantics
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 Alexandroï¬€ connection between preorders and Alexandroï¬€ spaces.
How to Cite
Copyright (c) 2020 Iberamia & The Authors
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Open Access publishing.
Lic. under Creative Commons CC-BY-NC
Inteligencia Artificial (Ed. IBERAMIA)
ISSN: 1988-3064 (on line).
(C) IBERAMIA & The Authors