A. Mani
Published 2009-05-08, updated 2009-05-14Version 2
Both algebraic and computational approaches for dealing with similarity spaces are well known in generalized rough set theory. However, these studies may be said to have been confined to particular perspectives of distinguishability in the context. In this research, the essence of an algebraic semantics that can deal with all possible concepts of distinguishability over similarity spaces is progressed. Key to this is the addition of choice-related operations to the semantics that have connections with modal logics as well. Among these we focus on a semantics that is based on local clear distinguishability over similarity spaces.
Comments: This paper was presented at the ICLA'2009 conference in Inst. Math. Sci, Chennai
Journal: International Conference on Logic and Applications, Chennai'2009
Algebraic semantics for hybrid logics
Algebraic Semantics for Nelson's Logic S
Decidability of modal logics of non-$k$-colorable graphs
![QR code for arXiv:0905.1352 [math.LO]](http://oss.arxitics.com/images/favicon.svg)