1 |
R. Belohlavek, Lattices of xed points of Galois connections, Math. Logic Quart. 47 (2001), 111-116.
DOI
ScienceOn
|
2 |
I. Duntsch, Ewa. Orlowska, Boolean algebras arising from information systems, Ann. Pure Appl. Logic 127 (2004), 77-98.
DOI
ScienceOn
|
3 |
J. Jarvinen, M. Kondo, J. Kortelainen, Logics from Galois connections, Internat. J. Approx. Reason. 49 (2008), 595-606.
DOI
ScienceOn
|
4 |
Ewa. Orlowska, I. Rewitzky, Algebras for Galois-style connections and their discrete duality, Fuzzy Sets and Systems 161 (2010), 1325-1342.
DOI
ScienceOn
|
5 |
Z. Pawlak, Rough sets, Int.J .Comput. Sci. Math. 11 (1982), 341-356.
|
6 |
G. Qi, W. Liu, Rough operations on Boolean algebras, Inform. Sci. 173 (2005), 49-63.
DOI
ScienceOn
|
7 |
R. Wille, Restructuring lattice theory; an approach based on hierarchies of concept, in: 1. Rival(Ed.), Ordered Sets, Reidel, Dordrecht, Boston (1982).
|
8 |
W. Yao, L.X. Lu, Fuzzy Galois connections on fuzzy posets, Math. Logic Quart. 55 (2009), 105-112.
DOI
ScienceOn
|
9 |
Y.Y. Yao, Two Views of the Theory of Rough Swts in Finite Universes, Internat. J. Approx. Reason. 15 (1996), 291-317.
DOI
ScienceOn
|