Skip to main content
Log in

Rough Sets Determined by Quasiorders

  • Published:
Order Aims and scope Submit manuscript

Abstract

In this paper, the ordered set of rough sets determined by a quasiorder relation R is investigated. We prove that this ordered set is a complete, completely distributive lattice. We show that on this lattice can be defined three different kinds of complementation operations, and we describe its completely join-irreducible and its completely meet-irreducible elements. We also characterize the case in which this lattice is a Stone lattice. Our results generalize some results of J. Pomykała and J. A. Pomykała (Bull Pol Acad Sci, Math, 36:495–512, 1988) and M. Gehrke and E. Walker (Bull Pol Acad Sci, Math, 40:235–245, 1992) in case R is an equivalence.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Alexandroff, P.: Diskrete räume. Mat. Sb (Mosk.) 2, 501–518 (1937)

    MATH  Google Scholar 

  2. van Benthem, J.: Correspondence theory. In: Gabbay, D., Guenthner, F. (eds.) Handbook of Philosophical Logic, vol. II: Extensions of Classical Logic, pp. 167–247. Reidel, Dordrecht (1984)

    Google Scholar 

  3. Birkhoff, G.: Rings of sets. Duke Math. J. 3, 443–454 (1937)

    Article  MathSciNet  Google Scholar 

  4. Blyth, T.S., Varlet, J.C.: Ockham Algebras. Oxford Science Publications, Oxford University Press, New York (1994)

    MATH  Google Scholar 

  5. Brink, C., Gabbay, D., Ohlbach, H.J.: Towards automating duality. J. Comput. Math. Appl. 29, 73–90 (1994)

    Article  MathSciNet  Google Scholar 

  6. Burris, S.N., Sankappanavar, H.P.: A course in universal algebra. In: Graduate Texts in Mathematics, vol. 78. Springer, New York (1981)

    Google Scholar 

  7. Comer, S.D.: An algebraic approach to the approximation of information. Fundam. Inform. 14, 492–502 (1991)

    MATH  MathSciNet  Google Scholar 

  8. Erné, M.: The ABC of order and topology. In: Herlich, H., Porst, H.-E. (eds.) Category Theory at Work, pp. 57–83. Heldermann, Berlin (1991)

    Google Scholar 

  9. Erné, M., Reinhold, J.: Intervals in lattices of quasiorders. Order 12, 375–403 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  10. Gehrke, M., Walker, E.: On the structure of rough sets. Bull. Pol. Acad. Sci., Math. 40, 235–245 (1992)

    MATH  MathSciNet  Google Scholar 

  11. Iwiński, T.B.: Algebraic approach to rough sets. Bull. Pol. Acad. Sci., Math. 35, 673–683 (1987)

    MATH  Google Scholar 

  12. Järvinen, J.: Approximations and rough sets based on tolerances. Lect. Notes Comput. Sci. 2005, 182–189 (2001)

    Article  Google Scholar 

  13. Järvinen, J.: The ordered set of rough sets. Lect. Notes Comput. Sci. 3066, 49–58 (2004)

    Google Scholar 

  14. Järvinen, J.: Lattice theory for rough sets. Transactions on Rough Sets VI, 400–498 (2007)

    Article  Google Scholar 

  15. Komorowski, J., Pawlak, Z., Polkowski, L., Skowron, A.: Rough sets: a tutorial. In: Pal, S.K., Skowron, A. (eds.) Rough Fuzzy Hybridization. A New Trend in Decision Making, pp. 3–98. Springer, Singapore (1999)

    Google Scholar 

  16. Orłowska, E., Pawlak, Z.: Representation of nondeterministic information. Theor. Comp. Sci. 29, 27–39 (1984)

    Article  Google Scholar 

  17. Pagliani, P., Chakraborty, M.: A geometry of approximation. Rough set theory: logic, algebra and topology of conceptual patterns. Springer, New York (2008)

    Google Scholar 

  18. Pawlak, Z.: Rough sets. Int. J. Comput. Inf. Sci. 11, 341–356 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  19. Pomykała, J., Pomykała, J.A.: The Stone algebra of rough sets. Bull. Pol. Acad. Sci., Math. 36, 495–512 (1988)

    MATH  Google Scholar 

  20. Radeleczki, S.: Classification systems and the decompositions of a lattice into direct products. Miskolc Mathematical Notes 1, 145–156 (2000)

    MATH  MathSciNet  Google Scholar 

  21. Radeleczki, S.: The direct decomposition of l-algebras into products of subdirectly irreducible factors. J. Aust. Math. Soc. 75, 41–56 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  22. Raney, G.N.: Completely distributive complete lattices. Proceedings of American Mathematical Society 3, 677–680 (1952)

    Article  MATH  MathSciNet  Google Scholar 

  23. Schmitt, P.H.: Normal double Stone algebras. Algebra Univers. 7, 205–209 (1977)

    Article  MATH  Google Scholar 

  24. Stone, A.H.: On partitioning ordered sets into cofinal subsets. Mathematika 15, 217–222 (1968)

    Article  MATH  MathSciNet  Google Scholar 

  25. Trotter, W.T.: Combinatorics and partially ordered sets: dimension theory. Johns Hopkins Series in the Mathematical Sciences, Johns Hopkins University Press, Baltimore (1992)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jouni Järvinen.

Additional information

The partial support by Hungarian National Research Found (Grant No. T049433/05 and T046913/04) is acknowledged by the second author.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Järvinen, J., Radeleczki, S. & Veres, L. Rough Sets Determined by Quasiorders. Order 26, 337–355 (2009). https://doi.org/10.1007/s11083-009-9130-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11083-009-9130-z

Keywords

Mathematics Subject Classifications (2000)

Navigation