粗糙集理论是由Pawlak提出的一种表示与处理数据表中信息的形式化工具。作为粗糙集概念的推广,一种基于完备剩余格的L-模糊粗糙集已由Radzikowska与Kerre提出,在本文中,我们第一次借助于L-模糊Galois联络对L-模糊粗糙集进行了公理化刻画。由于L-模糊粗糙集及L-模糊Galois联络均为相应经典情形的推广,故本文的结论对于经典粗糙集来说也是成立的,这就意味着通过Galois联络可将经典粗糙集乃至L-模糊粗糙集的公理化统一起来。
Rough sets were proposed by Pawlak as a formal tool for representing and processing information in data tables.As a generalization of the notion of rough sets,L-fuzzy rough sets which take a complete residuated lattice as their basic structure,were introduced by Radzikowska and Kerre.In this paper,we present the axiomatic characterizations of L-fuzzy rough sets by usingL-fuzzy Galois connections for the first time.Since L-fuzzy rough sets and L-fuzzy Galois connections are the both generalizations of their classical counterparts,the results obtained in the present paper also hold for crisp rough sets.This means that the axiomatic approach of crisp rough sets and L-fuzzy rough sets can be unified by using Galois connections.