A note on rough concepts logic
Fundamenta Informaticae
On Rough Sets in Topological Boolean Algebras
RSKD '93 Proceedings of the International Workshop on Rough Sets and Knowledge Discovery: Rough Sets, Fuzzy Sets and Knowledge Discovery
Proceedings of the SOFTEKS Workshop on Incompleteness and Uncertainty in Information Systems
Uncertainty measures for rough formulae in rough logic: An axiomatic approach
Computers & Mathematics with Applications
Rough Sets and 3-valued Lukasiewicz Logic
Fundamenta Informaticae
On the rough consistency measures of logic theories and approximate reasoning in rough logic
International Journal of Approximate Reasoning
A temporal semantics for Nilpotent Minimum logic
International Journal of Approximate Reasoning
Membership function based rough set
International Journal of Approximate Reasoning
Rough Sets: Some Foundational Issues
Fundamenta Informaticae - To Andrzej Skowron on His 70th Birthday
Concept Formation: Rough Sets and Scott Systems
Fundamenta Informaticae - To Andrzej Skowron on His 70th Birthday
| Hi-index | 0.00 |
While studying rough equality within the framework of the modal system S 5, an algebraic structure called rough algebra [1], came up. Its features were abstracted to yield a topological quasi-Boolean algebra (tqBa). In this paper, it is observed that rough algebra is more structured than a tqBa. Thus, enriching the tqBa with additional axioms, two more structures, viz. pre-rough algebra and rough algebra, are denned. Representation theorems of these algebras are also obtained. Further, the corresponding logical systems ℒ 1 ℒ 2 are proposed and eventually, ℒ 2 is proved to be sound and complete with respect to a rough set semantics.