In this note we remark upon some relationships between the ideas of an approximation space and rough sets due to Pawlak ([9] and [10]) and algebras related to the study of algebraic logic - namely, cylindric algebras, relation algebras, and Stone algebras. The paper consists of three separate observations. The first deals with the family of approximation spaces induced by the indiscernability relation for different sets of attributes of an information system. In [3] the family of closure operators defining these approximation spaces is abstractly characterized as a certain type of Boolean algebra with operators. An alternate formulation in terms of a general class of diagonal-free cylindric algebras is given in 1.6. The second observation concerns the lattice theoretic approach to the study of rough sets suggested by Iwiński [6] and the result by J. Pomykała and J. A. Pomykała [11] that the collection of rough sets of an approximation space forms a Stone algebra. Namely, in 2.4 it is shown that every regular double Stone algebra is embeddable into the algebra of all rough subsets of an approximation space. Finally, a notion of rough relation algebra is formulated in Section 3 and a few connections with the study of ordinary relation algebras are established.
@article{bwmeta1.element.bwnjournal-article-bcpv28z1p117bwm,
author = {Comer, Stephen},
title = {On connections between information systems, rough sets and algebraic logic},
journal = {Banach Center Publications},
volume = {28},
year = {1993},
pages = {117-124},
zbl = {0793.03074},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-bcpv28z1p117bwm}
}
Comer, Stephen. On connections between information systems, rough sets and algebraic logic. Banach Center Publications, Tome 28 (1993) pp. 117-124. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-bcpv28z1p117bwm/
[000] [1] R. Beazer, The determination congruence on double p-algebras, Algebra Universalis 6 (1976), 121-129. | Zbl 0353.06002
[001] [2] S. D. Comer, Representations by algebras of sections over Boolean spaces, Pacific J. Math. 38 (1971), 29-38. | Zbl 0219.08002
[002] [3] S. D. Comer, An algebraic approach to the approximation of information, Fund. Inform. 14 (1991), 492-502. | Zbl 0727.68114
[003] [4] G. Grätzer, Lattice Theory. First Concepts and Distributive Lattices, W. H. Freeman, San Francisco 1971.
[004] [5] L. Henkin, J. D. Monk and A. Tarski, Cylindric Algebras, Part I, II, North-Holland, Amsterdam 1985.
[005] [6] T. B. Iwiński, Algebraic approach to rough sets, Bull. Polish Acad. Sci. Math. 35 (1987), 673-683. | Zbl 0639.68125
[006] [7] T. Katriňák, Injective double Stone algebras, Algebra Universalis 4 (1974), 259-267. | Zbl 0302.06022
[007] [8] I. Németi, Algebraizations of quantifier logics, an introductory overview, preprint, Math. Inst. Hungar. Acad. Sci., 1991. | Zbl 0772.03033
[008] [9] Z. Pawlak, Information system - theoretical foundations, Inform. Systems 6 (1981), 205-218. | Zbl 0462.68078
[009] [10] Z. Pawlak, Rough sets, Internat. J. Comput. Inform. Sci. 11 (5) (1982), 341-356. | Zbl 0501.68053
[010] [11] J. Pomykała and J. A. Pomykała, The Stone algebra of rough sets, Bull. Polish Acad. Sci. Math. 36 (1988), 495-508. | Zbl 0786.04008
[011] [12] H. Werner, Discriminator Algebras, Akademie-Verlag, Berlin 1978.