Kortelainen, Jari On relationship between modified sets, topological spaces and rough sets. (English) Zbl 0828.04002 Fuzzy Sets Syst. 61, No. 1, 91-95 (1994). The author starts from a binary relation \(R_{\mathcal H}\) on a set \(X\) and then defines a so-called modifier \({\mathcal H}\) by: \[ {\mathcal H} (A) = \biggl \{y \mid (\exists x \in A) \bigl( (x,y) \in R_{\mathcal H} \bigr) \biggr\}. \] When the relation \(R\) is reflexive, i.e. \(R\) is called an accessibility relation, then \({\mathcal H}\) is called a weakening modifier. To every weakening modifier \({\mathcal H}\) a so-called substantiating modifier \({\mathcal H}^*\) is defined by \({\mathcal H}^* (A) = \overline {{\mathcal H} (\overline A)}\). The main results concern the interaction between set-theoretic union, intersection, inclusion on the one hand and weakening and substantiating modifiers on the other hand. The proofs are very simple. Finally it is shown that certain modifiers are topological closure operators and that rough sets can be obtained as modifiers.This paper can be described as old wine in new bottles. Indeed \({\mathcal H}(A)\) is nothing but the direct image of \(A\) under the binary relation \(R_{\mathcal H}\) and \({\mathcal H}^* (A)\) is easily identified as the superdirect image of \(A\) under a reflexive relation \(R_{\mathcal H}\). Hence all the main results were well known. Reviewer: E.Kerre (Gent) Cited in 2 ReviewsCited in 52 Documents MSC: 03E72 Theory of fuzzy sets, etc. Keywords:accessibility relation; weakening modifier; substantiating modifier; union; intersection; inclusion; topological closure operators; rough sets; direct image; superdirect image PDF BibTeX XML Cite \textit{J. Kortelainen}, Fuzzy Sets Syst. 61, No. 1, 91--95 (1994; Zbl 0828.04002) Full Text: DOI References: [1] Bourbaki, N., Elements of Mathematics: General Topology (1989), Springer-Verlag: Springer-Verlag Berlin, 2nd printing · Zbl 0145.19302 [2] Dubois, D.; Prade, H.; Mo, X., Semantic and algorithmic aspects of approximate reasoning in possibility theory, Rapport IRIT/90-53/R (1990) [3] Hellendoorn, H., The generalized modus ponens considered as a fuzzy relation, Fuzzy Sets and Systems, 46, 29-48 (1992) · Zbl 0773.03016 [4] James, I. M., General Topology and Homotopy Theory (1984), Springer-Verlag: Springer-Verlag Berlin · Zbl 0562.54001 [5] Kortelainen, J., On modified set-operations, (Eklund, P.; Mattila, J. K., FiF ’93, Fuzziness in Finland ’93. FiF ’93, Fuzziness in Finland ’93, Åbo Akademi Reports on Computer Science and Mathematics (1993)), 48-58, Ser. B. No. 15 [6] Kripke, S. A., Semantical considerations on modal logic, Acta Philosophica Fennica Fasc., XVI (1963) · Zbl 0131.00602 [7] Lakoff, G., Hedges: A study in meaning criteria and the logic of fuzzy concepts, The Journal of Philosophical Logic, 2, 458-508 (1973) · Zbl 0272.02047 [8] Mattila, J. K., Calculus of modifier operators in fuzzy logic, (Publications of the Institute of Applied Mathematics No 14 (1989), University of Turku: University of Turku Turku, Finland) · Zbl 1059.03014 [9] Mattila, J. K., Modelling fuzziness by Kripke structures, (Terano; Sugeno; Mukaidono; Shigemasu, Proceedings of IFES ’91. Proceedings of IFES ’91, Yokohama, Japan. Proceedings of IFES ’91. Proceedings of IFES ’91, Yokohama, Japan, Fuzzy Engineering Towards Human Friendly Systems, Vol. 2 (1991)) [10] Patronis, T.; Stavrinos, P., Fuzzy equivalence and resulting topology, Fuzzy Sets and Systems, 46, 237-243 (1992) · Zbl 0776.04002 [11] Rasiowa, H., An Algebraic Approach to Non-Classical Logics (1974), North-Holland: North-Holland Amsterdam · Zbl 0299.02069 [12] Pawlak, Z., Rough sets: A new approach to vagueness, (Zadeh; Kacprzyk, Fuzzy Logic for Management of Uncertainty (1992), John Wiley: John Wiley New York) · Zbl 0602.68078 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.