Topology via logic
A Pure Logic-Algebraic Analysis of Rough Top and Rough Bottom Equalities
RSKD '93 Proceedings of the International Workshop on Rough Sets and Knowledge Discovery: Rough Sets, Fuzzy Sets and Knowledge Discovery
Data mining tasks and methods: Classification: multicriteria classification
Handbook of data mining and knowledge discovery
A Geometry of Approximation: Rough Set Theory Logic, Algebra and Topology of Conceptual Patterns (Trends in Logic)
Transactions on rough sets VI
Rough Sets And Nelson Algebras
Fundamenta Informaticae
| Hi-index | 0.00 |
In this paper, we give an algebraic completeness theorem for constructive logic with strong negation in terms of finite rough set-based Nelson algebras determined by quasiorders. We show how for a quasiorder R, its rough set-based Nelson algebra can be obtained by applying Sendlewski's well-known construction. We prove that if the set of all R-closed elements, which may be viewed as the set of completely defined objects, is cofinal, then the rough set-based Nelson algebra determined by the quasiorder R forms an effective lattice, that is, an algebraic model of the logic E0, which is characterised by a modal operator grasping the notion of "to be classically valid". We present a necessary and sufficient condition under which a Nelson algebra is isomorphic to a rough set-based effective lattice determined by a quasiorder.