Rough sets determined by quasiorders

Order

Volumn 26, Issue 4, 2009, Pages 337-355

  Järvinen, Jouni ^a   Radeleczki, Sándor ^b   Veres, Laura ^b  

^a UNIVERSITY OF TURKU   (Finland)

^b UNIVERSITY OF MISKOLC   (Hungary)

Author keywords

Alexandrov topology; Completely distributive lattice; Completely join irreducible element; De Morgan operation; Pseudocomplement; Quasiorder; Rough approximations; Rough set; Stone lattice

Indexed keywords

EID: 76049101222     PISSN: 01678094     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11083-009-9130-z     Document Type: Article

References (25)

1. Alexandroff, P.: Diskrete räume. Mat. Sb (Mosk.) 2, 501-518 (1937).
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).
3. Birkhoff, G.: Rings of sets. Duke Math. J. 3, 443-454 (1937).
4. Blyth, T. S., Varlet, J. C.: Ockham Algebras. Oxford Science Publications, Oxford University Press, New York (1994).
5. Brink, C., Gabbay, D., Ohlbach, H. J.: Towards automating duality. J. Comput. Math. Appl. 29, 73-90 (1994).
6. Burris, S. N., Sankappanavar, H. P.: A course in universal algebra. In: Graduate Texts in Mathematics, vol. 78. Springer, New York (1981).
7. Comer, S. D.: An algebraic approach to the approximation of information. Fundam. Inform. 14, 492-502 (1991).
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).
9. Erné, M., Reinhold, J.: Intervals in lattices of quasiorders. Order 12, 375-403 (1995).
10. Gehrke, M., Walker, E.: On the structure of rough sets. Bull. Pol. Acad. Sci., Math. 40, 235-245 (1992).
11. Iwiński, T. B.: Algebraic approach to rough sets. Bull. Pol. Acad. Sci., Math. 35, 673-683 (1987).
12. Järvinen, J.: Approximations and rough sets based on tolerances. Lect. Notes Comput. Sci. 2005, 182-189 (2001).
13. Järvinen, J.: The ordered set of rough sets. Lect. Notes Comput. Sci. 3066, 49-58 (2004).
14. Järvinen, J.: Lattice theory for rough sets. Transactions on Rough Sets VI, 400-498 (2007).
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).
16. Orłowska, E., Pawlak, Z.: Representation of nondeterministic information. Theor. Comp. Sci. 29, 27-39 (1984).
17. Pagliani, P., Chakraborty, M.: A geometry of approximation. Rough set theory: logic, algebra and topology of conceptual patterns. Springer, New York (2008).
18. Pawlak, Z.: Rough sets. Int. J. Comput. Inf. Sci. 11, 341-356 (1982).
19. Pomykała, J., Pomykała, J. A.: The Stone algebra of rough sets. Bull. Pol. Acad. Sci., Math. 36, 495-512 (1988).
20. Radeleczki, S.: Classification systems and the decompositions of a lattice into direct products. Miskolc Mathematical Notes 1, 145-156 (2000).
21. Radeleczki, S.: The direct decomposition of l-algebras into products of subdirectly irreducible factors. J. Aust. Math. Soc. 75, 41-56 (2003).
22. Raney, G. N.: Completely distributive complete lattices. Proceedings of American Mathematical Society 3, 677-680 (1952).
23. Schmitt, P. H.: Normal double Stone algebras. Algebra Univers. 7, 205-209 (1977).
24. Stone, A. H.: On partitioning ordered sets into cofinal subsets. Mathematika 15, 217-222 (1968).
25. Trotter, W. T.: Combinatorics and partially ordered sets: dimension theory. Johns Hopkins Series in the Mathematical Sciences, Johns Hopkins University Press, Baltimore (1992).