Abstract
A survey of results is presented on relationships between the algebraic systems derived from the approximation spaces induced by information systems and various classes of algebras of relations. Rough relation algebras are presented and it is shown that they form a discriminator variety. A characterisation of the class of representable rough relation algebras is given. The family of closure operators derived from an approximation space is abstractly characterised as certain type of Boolean algebra with operators. A representation theorem is given which says that every such an algebra is isomorphic with a similar algebra that is derived from an information system.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Balbes, R. & Grätzer, G.: Injective and projective Stone algebras. Duke Math. J., 38, (1971), 339–347
Chin, L. & Tarski, A.: Distributive and modular laws in the arithmetic of relation algebras. University of California Publications, 1, (1951), 341–384
Corner, S.: An algebraic approach to the approximation of information. Fund. Inform., 14, (1991), 492–502
Corner, S.: On connections between information systems, rough sets, and algebraic logic. In: Algebraic Methods in Logic and Computer Science, Banach Center Publications, 28, (1993), 117–124
Corner, S.: Perfect extensions of regular double Stone algebras. Algebra Universalis, 34, (1995), 96–109
Düntsch, I.: Rough relation algebras. Fund. Inform., 21, (1994), 321–331
Henkin, L., Monk, J.D. & Tarski, A.: Cylindric Algebras. Part I, North Holland, Amsterdam, (1971)
Henkin, L., Monk, J.D. & Tarski, A.: Cylindric Algebras. Part II, North Holland, Amsterdam, (1985)
Iwinski, T.B.: Algebraic approach to rough sets. Bull. Polish Acad. Sci. Math., 35, (1987), 673–683
Jónsson, B.: Varieties of relation algebras. Algebra Universalis, 15, (1982), 273–298
Jónsson, B.: The theory of binary relations. In: Algebraic Logic, edited by Andréka, H., Monk, J.D. & Németi, I.: volume 54 of Colloquia Mathematica Societatis Jänos Bolyai, North Holland, Amsterdam, (1991), 245–292
Jónsson, B., Andréka, H. & Németi, I.: Free algebras in discriminator varieties. Algebra Univ, 28, (1991), 401–447
Katrinâ,k, T.: Construction of regular double p—algebras. Bull. Soc. Roy. Sci. Liège, 43, (1974), 294–301
Monk, J.D.: Mathematical Logic. Springer, (1976)
Pawlak, Z.: Information systems, theoretical foundations. Information Systems, 6, (1981), 205–218
Pawlak, Z.: Rough sets. Internat. J. Comput. Inform. Sci., 11, (1982), 341–356
Pomykala, J. & Pomykala, J.A.: The Stone algebra of rough sets. Bull. Polish Acad. Sci. Math., 36, (1988), 495–508
Tarski, A. Si Givant, S.: A Formalization of Set Theory without Variables. Volume 41 of Colloquium Publications, Amer. Math. Soc., Providence, (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Düntsch, I. (1998). Rough Sets and Algebras of Relations. In: Orłowska, E. (eds) Incomplete Information: Rough Set Analysis. Studies in Fuzziness and Soft Computing, vol 13. Physica, Heidelberg. https://doi.org/10.1007/978-3-7908-1888-8_5
Download citation
DOI: https://doi.org/10.1007/978-3-7908-1888-8_5
Publisher Name: Physica, Heidelberg
Print ISBN: 978-3-7908-2457-5
Online ISBN: 978-3-7908-1888-8
eBook Packages: Springer Book Archive