Structure of upper and lower approximation spaces of infinite sets

We determine structural properties of upper and lower approximation spaces. In particular, we show that an upper approximation space is a union of its primary subspaces if and only if it is benign. We also show that in a principle upper approximation space which is not primary, the prime and maximal subspaces coincide.

[1]  Yiyu Yao,et al.  Two views of the theory of rough sets in finite universes , 1996, Int. J. Approx. Reason..

[2]  Z. Pawlak.  Rough Sets: Theoretical Aspects of Reasoning about Data , 1991 .

[3]  P. S. Nair,et al.  Connectedness in systems theory , 1996, Proceedings of IEEE 5th International Fuzzy Systems.

[4]  Zamir Bavel.  Introduction to the theory of automata , 1983 .

[5]  Salvatore Greco,et al.  Fuzzy Similarity Relation as a Basis for Rough Approximations , 1998, Rough Sets and Current Trends in Computing.

[6]  Bobby Schmidt,et al.  Fuzzy math , 2001 .

[7]  A. Wasilewska,et al.  Conditional knowledge representation systems -model for an implementation , 1989 .

[8]  Ewa Orlowska,et al.  Semantic Analysis of Inductive Reasoning , 1986, Theor. Comput. Sci..

[9]  Jerzy W. Grzymala-Busse,et al.  Rough Sets , 1995, Commun. ACM.

[10]  Yiyu Yao,et al.  Relational Interpretations of Neigborhood Operators and Rough Set Approximation Operators , 1998, Inf. Sci..

[11]  U. Wybraniec-Skardowska.  On a generalization of approximation space , 1989 .

[12]  P. S. Nair,et al.  Retrievability and connectedness in fuzzy finite state machines , 1996, Proceedings of IEEE 5th International Fuzzy Systems.

[13]  Yiyu Yao,et al.  Generalization of Rough Sets using Modal Logics , 1996, Intell. Autom. Soft Comput..