Abstract
We consider relationship between binary relations in approximation spaces and topologies defined by them. In any approximation space (X, R), a reflexive closure \(R_{\omega }\) determines an Alexandrov topology \(\mathcal {T}_{(R_{\omega })}\) and, for any Alexandrov topology \(\mathcal {T}\) on X, there exists a reflexive relation \(R_{\mathcal {T}}\) such that \(\mathcal {T}= \mathcal {T}_R\). From the result, we also obtain that any Alexandrov topology satisfying (clop), A is open if and only if A is closed, can be characterized by reflexive and symmetric relation.
Moreover, we provide a negative answer to the problem left open in [1].
This work was supported by Tokyo Denki University Science Promotion Fund (Q18K-01).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Ghorbani, S., Hasankhani, A.: Implicative topology on residuated lattices. J. Mult.-valued Log. Soft Comput. 17, 521–535 (2011)
Haveshki, M., Eslami, E., Saeido, A.B.: A topology induced by uniformity on BL-algebras. Math. Log. Q. 53, 162–169 (2007)
James, I.M.: Introduction to Uniform Topology. Cambridge University Press, New York (1990)
Kondo, M.: On the structure of generalized rough sets. Inf. Sci. 176, 589–600 (2006)
Li, Z.: Topological properties of generalized rough sets. In: FKSD 2010 Seventh International Conference on Fuzzy and Knowledge Discovery, pp. 2067–2070 (2010)
Pawlak, Z.: Rough sets. Int. J. Comput. Inf. Sci. 11, 341–356 (1982)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Kondo, M. (2019). On Topologies Defined by Binary Relations in Rough Sets. In: Mihálydeák, T., et al. Rough Sets. IJCRS 2019. Lecture Notes in Computer Science(), vol 11499. Springer, Cham. https://doi.org/10.1007/978-3-030-22815-6_6
Download citation
DOI: https://doi.org/10.1007/978-3-030-22815-6_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-22814-9
Online ISBN: 978-3-030-22815-6
eBook Packages: Computer ScienceComputer Science (R0)