A Note on Rough Set Algebra and Core Regular Double Stone Algebras

01/07/2021
by   Daniel J. Clouse, et al.
0

Given an approximation space ⟨ U,θ⟩, assume that E is the indexing set for the equivalence classes of θ and let R_θ denote the collection of rough sets of the form ⟨X,X⟩ as a regular double Stone algebra and what I. Dunstch referred to as a Katrinak algebra.[7],[8] We give an alternate proof from the one given in [1] of the fact that if |θ_u| > 1∀ u ∈ U then R_θ is a core regular double Stone algebra. Further let C_3 denote the 3 element chain as a core regular double Stone algebra and TP_U denote the collection of ternary partitions over the set U. In our Main Theorem we show R_θ with |θ_u| > 1 ∀ u ∈ U to be isomorphic to TP_E and C_3^E and that the three CRDSA's are complete and atomic. In our Main Corollary we show explicitly how we can embed such R_θ in TP_U, C_3^U, respectively, ϕ∘α_r:R_θ↪ TP_U↪ C_3^U, and hence identify it with its specific images. Following in the footsteps of Theorem 3. and Corollary 2.4 of [7], we show C_3^J ≅ R_θ for ⟨ U,θ⟩ the approximation space given by U = J ×{0,1}, θ = {(j0),(j1)} : j ∈ J} and every CRDSA is isomorphic to a subalgebra of a principal rough set algebra, R_θ, for some approximation space ⟨ U,θ⟩. Finally, we demonstrate this and our Main Theorem by expanding an example from [1]. We feel this could be very useful when dealing with a specific R_θ in an application. Further, we know a little more about the subalgebras of TP_U and C_3^U in general as they must exist for every E that is an indexing set for the equivalence classes of any equivalence relation θ on U satisfying |θ_u| > 1 ∀ u ∈ U.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/25/2012

Some characteristics of matroids through rough sets

At present, practical application and theoretical discussion of rough se...
research
09/25/2012

Closed-set lattice of regular sets based on a serial and transitive relation through matroids

Rough sets are efficient for data pre-processing in data mining. Matroid...
research
11/03/2012

Matrix approach to rough sets through vector matroids over a field

Rough sets were proposed to deal with the vagueness and incompleteness o...
research
11/21/2018

Defining rough sets using tolerances compatible with an equivalence

We consider tolerances T compatible with an equivalence E on U, meaning ...
research
09/25/2012

Lattice structures of fixed points of the lower approximations of two types of covering-based rough sets

Covering is a common type of data structure and covering-based rough set...
research
01/04/2020

Restricted Rules of Inference and Paraconsistency

We present here two logical systems - intuitionistic paraconsistent weak...
research
04/10/2018

A Mathematical Framework for Superintelligent Machines

We describe a class calculus that is expressive enough to describe and i...

Please sign up or login with your details

Forgot password? Click here to reset