论文信息 - Basic Properties of Rough Sets and Rough Membership Function 1

Basic Properties of Rough Sets and Rough Membership Function 1

(3) For every set X and for every total reflexive binary relation RonX holds idX ⊆ R. Let us observe that every relational structure which is discrete is also diagonal and every relational structure which is non diagonal is also non discrete. Let us note that there exists a relational structure which is non diagonal and non empty. We now state three propositions: 1This work has been partially supported by CALCULEMUS grant HPRN-CT-2000-00102.

Adam Grabowski

[1] Kenneth Halpern August. The Cardinal Numbers , 1888, Nature.

[2] Czeslaw Bylinski,et al. Basic Functions and Operations on Functions , 1989 .

[3] Grzegorz Bancerek,et al. Segments of Natural Numbers and Finite Sequences , 1990 .

[4] Andrzej Trybulec,et al. Binary Operations Applied to Functions , 1990 .

[5] Andrzej Ne ' dzusiak. Fields and Probability , 1990 .

[6] Jozef Bia,et al. Group and Field Definitions , 1990 .

[7] A. Zalewska,et al. Properties of Binary Relations , 1990 .

[8] Czesław Bylí. Finite Sequences and Tuples of Elements of a Non-empty Sets , 1990 .

[9] Agata Darmochwa,et al. Topological Spaces and Continuous Functions , 1990 .

[10] Konrad Raczkowski,et al. Topological Properties of Subsets in Real Numbers , 1990 .

[11] Czeslaw Bylinski. The Sum and Product of Finite Sequences of Real Numbers , 1990 .

[12] Edmund Woronowicz. Relations Defined on Sets , 1990 .

[13] Wojciech A. Trybulec. Partially Ordered Sets , 1990 .

[14] A. Trybulec. Tarski Grothendieck Set Theory , 1990 .

[15] Konrad Raczkowski,et al. Equivalence Relations and Classes of Abstraction 1 , 1990 .

[16] Adam Grabowski,et al. On the Category of Posets , 1996 .

[17] J. Harrison. Formalized Mathematics , 1996 .

[18] G. Bancerek. Journal of Formalized Mathematics , 1997 .