You are here

Relations and modal operators

Journal Name:

Publication Year:

Author Name
Abstract (2. Language): 
We show that reflexive, transitive, symmetric relations can be in- duced by modal, necessity, sufficiency and co-sufficiency operators. We give their examples.



[1] R. Bˇelohl´avek, Similarity relations in concept lattices, J. Logic and Computation
10 (6) (2000) 823-845.
[2] R. Bˇelohl´avek, Fuzzy equational logic, Arch. Math. Log. 41 (2002) 83-90.
[3] Ivo. D¨untsch, Ewa Orlowska, Boolean algebras arising from information
systems, Annals of Pure and Applied Logic 127 (2004) 77-98.
[4] J. J¨arvinen, M. Kondo, J. Kortelainen, Logics from Galois connections,
Int. J. Approx. Reasoning 49 ( 2008) 595-606.
[5] P. H´ajek, Metamathematices of Fuzzy Logic, Kluwer Academic Publishers,
Dordrecht (1998).
[6] Y.C. Kim, Modal, necesserty, sufficiency and co-sufficiency operators, J.
Korean (to appear).
[7] Ewa Orlowska, I. Rewitzky Algebras for Galois-style connections and
their discrete duality, Fuzzy Sets and Systems 161 (2010) 1325-1342.
[8] Z. Pawlak, Rough sets, Int. J. Comput. Inf. Sci. 11(1982) 341-356.
[9] Y.Y. Yao, Two Views of the Theory of Rough Swts in Finite Universes,
Int. J. Approx. Reasoning 15 ( 1996) 291-317.

Thank you for copying data from