期刊文献+
共找到4篇文章
< 1 >
每页显示 20 50 100
THE LARGEST SOLUTION OF LINEAR EQUATION OVER THE COMPLETE HEYTING ALGEBRA
1
作者 周惊雷 李庆国 《Acta Mathematica Scientia》 SCIE CSCD 2010年第3期810-818,共9页
Let (L, 〈, V, A) be a complete Heyting algebra. In this article, the linear system Ax = b over a complete Heyting algebra, where classical addition and multiplication operations are replaced by V and A respectively... Let (L, 〈, V, A) be a complete Heyting algebra. In this article, the linear system Ax = b over a complete Heyting algebra, where classical addition and multiplication operations are replaced by V and A respectively, is studied. We obtain: (i) the necessary and sufficient conditions for S(A,b)≠Ф; (ii) the necessary conditions for IS(A,b)| = 1. We also obtain the vector x ∈ Ln and prove that it is the largest element of S(A, b) if S(A, b)≠Ф. 展开更多
关键词 complete lattice Heyting algebra linear system minimal covering
下载PDF
The Connectedness of Quantales
2
作者 WANG Shun-qin ZHAO Bin 《Chinese Quarterly Journal of Mathematics》 CSCD 2009年第2期303-309,共7页
The concepts of connectedness and locally connectedness is introduced for rightside idempotent quantales. Some properties of connected quantale are studied, and then the equivalent characterization of connected quanta... The concepts of connectedness and locally connectedness is introduced for rightside idempotent quantales. Some properties of connected quantale are studied, and then the equivalent characterization of connected quantale is also given. 展开更多
关键词 complete lattice QUANTALE connectedness regular Quantale
下载PDF
Rough Class on a Completely Distributive Lattice
3
作者 陈德刚 张文修 宋士吉 《Tsinghua Science and Technology》 SCIE EI CAS 2003年第2期181-184,共4页
This paper generalizes the Pawlak rough set method to a completely distributive lattice. The concept of a rough set has many applications in data mining. The approximation operators on a completely distributive lattic... This paper generalizes the Pawlak rough set method to a completely distributive lattice. The concept of a rough set has many applications in data mining. The approximation operators on a completely distributive lattice are studied, the rough class on a completely distributive lattice is defined and the expressional theorems of the rough class are proven. These expressional theorems are used to prove that the collection of all rough classes is an atomic completely distributive lattice. 展开更多
关键词 rough sets completely distributive lattice rough class
原文传递
A Class Of Counterexamples Concerning an Open Problem
4
作者 PeiXinCHEN ShiJieLU 《Acta Mathematica Sinica,English Series》 SCIE CSCD 2005年第1期9-12,共4页
If K ∩ AlgL is weak. dense in AlgL, where K is the set of all compactoperators in B(H), is completely distributive? In this note, we prove that there is a reflexivesubspace lattice L on some Hilbert space, which sati... If K ∩ AlgL is weak. dense in AlgL, where K is the set of all compactoperators in B(H), is completely distributive? In this note, we prove that there is a reflexivesubspace lattice L on some Hilbert space, which satisfies the following conditions: (a) F(AlgL) isdense in AlgL in the ultrastrong operator topology, where F(AlgL) is the set of all finite rankoperators in AlgL; (b) L isnt a completely distributive lattice. The subspace lattices that satisfythe above conditions form a large class of lattices. As a special case of the result, it easy to seethat the answer to Problem 7 is negative. 展开更多
关键词 completely distributive subspace lattice Ultrastrong topology COUNTEREXAMPLE
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部