Logics for Knowability

In this paper, we propose three knowability logics LK, LK-, and LK=. In the single-agent case, LK is equally expressive as arbitrary public announcement logic APAL and public announcement logic PAL, whereas in the multi-agent case, LK is more expressive than PAL. In contrast, both LK- and LK= are equally expressive as classical propositional logic PL. We present the axioinatizations of the three knowability logics and show their soundness and completeness. We show that all throe knowability logics possess the properties of Church-Rosser and McKinsey. Although LK is undecidable when at least three agents are involved, LK- and LK= are both decidable.