[KSCI] Korea Science Citation Index Service

http://dx.doi.org/10.5391/IJFIS.2011.11.4.299

Rough Approximations on Preordered Sets

Kim, Yong-Chan (Department of Mathematics, Gangneung-Wonju National University)
Kim, Young-Sun (Department of Applied Mathematics, Pai Chai University)

Publication Information

International Journal of Fuzzy Logic and Intelligent Systems / v.11, no.4, 2011 , pp. 299-304 More about this Journal

Abstract

In this paper, we investigate the properties of rough approximations defined by preordered sets. We study the relations among the lower and upper rough approximations, closure and interior systems, and closure and interior operators.

Keywords

Preordered sets; Lower and upper rough approximations; Closure and interior systems; Closure and interior operators;

Citations & Related Records

Reference

1	R. Belohlavek, "Lattices of fixed points of Galois connections," Math. Logic Quart., vol.47, pp.111-116, 2001. DOI ScienceOn
2	G. Georgescu, A. Popescue, "Non-dual fuzzy connections," Arch. Math. Log., vol. 43, pp.1009-1039, 2004. DOI ScienceOn
3	J. Jarvinen, M. Kondo, J. Kortelainen, "Logics from Galois connections," Int. J. Approx. Reasoning, vol.49, pp.595-606, 2008. DOI ScienceOn
4	Y.C. Kim, Y.S. Kim, "Relations and upper sets on partially ordered sets," Int. Math. Forum, vol. 6, no.19, pp.899-908, 2011.
5	Y.C. Kim, Y.S. Kim, "Various connections on interior sets," Int. Math. Forum, vol.6, no.19, pp. 909-920, 2011.
6	Z. Pawlak," Rough sets," Int. J. Comput. Inf. Sci., vol.11, pp.341-356, 1982. DOI ScienceOn
7	G. Qi andW. Liu," Rough operations on Boolean algebras," Information Sciences, vol. 173, pp.49-63, 2005. DOI ScienceOn
8	R. Wille, Restructuring lattice theory; an approach based on hierarchies of concept, in: 1. Rival(Ed.), Ordered Sets, Reidel, Dordrecht, Boston, 1982.