Generalized Rough Logics with Rough Algebraic Semantics

Abstract

The collection of the rough set pairs <lower approximation, upper approximation> of an approximation (U, R) can be made into a Stone algebra by defining two binary operators and one unary operator on the pairs. By introducing a more unary operator, one can get a regular double Stone algebra to describe the rough set pairs of an approximation space. Sequent calculi corresponding to the rough algebras, including rough Stone algebras, Stone algebras, rough double Stone algebras, and regular double Stone algebras are proposed in this paper. The sequent calculi are called rough Stone logic (RSL), Stone logic (SL), rough double Stone logic (RDSL), and double Stone Logic (DSL). The languages, axioms and rules are presented. The soundness and completeness of the logics are proved.