Logics of time and computation
Logics of time and computation
Hi-index | 0.01 |
We give an axiomatic system of a logic characterized by the class of Boolean algebras with conjugate, which has a close connection with the theory of rough sets, and prove that the logic is decidable.