检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:许颖[1]
机构地区:[1]陕西师范大学数学与信息科学学院,陕西西安710062
出 处:《内江师范学院学报》2008年第6期24-27,共4页Journal of Neijiang Normal University
摘 要:在有逆序对合对应"′"的完备格(或称为DeMorgan代数)L上定义了开预拓扑、边界、伪内部算子和伪边界算子,并证明了L上的所有开预拓扑,所有伪内部算子和所有伪闭包算子构成了彼此同构的完备格.L上的所有伪边界算子和所有闭预拓扑是完全备格同构.Some notions, such as open pretopologies, boundaries, pseudo-interlor operators, pseudo-boundary operators, are defined on a complete lattice L which has orderreversing involution, called DeMorgan algebra. It is proved that the set of all open pretopologies, pseudo-interior operators and pseudo-closure operators on L are all complete lattices which are isomorphic to each other, the set of all pseudo-boundary operators and closed pretopologies on L are complete lattices which are isomorphic to each other.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7