Separating sets by modal formulas
Topological modal logic provides an interesting point of view for reasoning about knowledge: An increasing of the knowledge of an agent corresponds to a shrinking of the set of states she considers to be an alternative. This is a motivation for the development of a logical tool describing changes of the sets of knowledge. A goal of the paper is to extend the framework of topological modal logic in order to make it more appropriate for the specifiation of properties of knowledge. The idea of a topological separation is presented. The separation consists in a decomposition of a set of knowledge states (at a future time point) by means of formulas. Intuitively, a growth of knowledge leads to an increased ability to distinguish. A logical language of separation, LS, is introduced. The language is defined over a logic of knowledge and time. Three modal operators, knowledge, nextstep, and separation operator are used. The syntax and semantics of the language, and an axiomatic system \(\mathcal S\) are presented. It is shown that \(\mathcal S\) is sound and complete, the finite model property is satisfied (therefore, the logic is decidable). Finally, concluding remarks are devoted to a discussion of the problem how complementation may be incorporated into the logic and how it may be related to separation. For the entire collection see [Zbl 0906.00024].
This page was built for publication: Separating sets by modal formulas
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4250363)