完备格Brouwer上伪t-模与蕴涵算子的注记(Ⅱ)

进一步研究完备Brouwer格上伪t-模与蕴涵算子,给出同二元算子生成的伪t-模与蕴涵算子的计算公式。     

完备格Brouwer上伪t-模与蕴涵算子的注记(II)(英文)

进一步研究完备Brouwer格上伪t-模与蕴涵算子,给出同二元算子生成的伪t-模与蕴涵算子的计算公式。     

完备Brouwer格上伪t-模与蕴涵算子的注记(I)

进一步研究完备Brouwer格上伪t-模和蕴涵算子,讨论完备Brouwer格上伪t-模和蕴涵算子的直积分解。     

积格上蕴涵算子的直积分解

进一步讨论蕴涵算子的直积分解,描述积格上可以分解为两个蕴涵算子直积的蕴涵算子的特性,并研究积格上S-蕴涵、R-蕴涵、n-反演R-蕴涵和n-反演QL-蕴涵的可分解性。     

伪统一模与剩余格之间的关系

讨论伪统一模与剩余格之间的关系,证明完备格上无穷∨-分配伪统一模和它的剩余蕴涵算子构成一个完备剩余格,并说明任给一个完备剩余格L=(L,∧,∨,*,e→,,*是无穷∨-分配的伪统一模,→和(?)是*的剩余蕴涵算子.     

关于格蕴涵代数的余元及结构

根据格蕴涵代数的性质,利用蕴涵滤子的概念,给出一种确定任意元素的余元的思路,指出在几种特殊的分配格上不能定义格蕴涵代数,给出几种格蕴涵代数的结构。     

完备格中四种蕴涵运算与伴随关系

在完备格中引入了四种二元运算,即蕴涵运算,反蕴涵运算,伪蕴涵运算和伪反蕴涵运算,它们分别对应四类伴随关系,其中两类伴随关系分剐对应于Heyting代数与反Heyting代数,并且我们还讨论了关于四种二元运算的部分性质及其关系.     

Fuzzy蕴涵代数的t-范及其性质

Fuzzy蕴涵代数是[0,1]值逻辑蕴涵联结词的一种代数抽象.本文在Fuzzy蕴涵代数中讨论了其上t-范的性质,并给出了Fuzzy蕴涵代数成为偏序半群的一个条件.     

广义单侧剩余广群

对吴氏左（右）剩余广群，给出一种新而且简化的定义，并详细地讨论其基本性质。用其主要结论得到完备格上的所有无穷∨-分配强伪t-模与所有无穷∧-分配强蕴涵算子之间的关系。     

关于左连续蕴涵算子的连续逼近问题

从阿基米德型t-范定义的剩余型蕴涵算子是连续的蕴涵算子出发，研究关于左连续的蕴涵算子Ro和Godel蕴涵算子心'的连续逼近问题，从而进一步为模糊推理寻求理论基础。     

All retraction operators on a complete lattice form a complete lattice

H. Crapo raised in 1982 the following problem: IfP is a complete lattice, is Retr (P) a complete lattice? here Retr (P) denotes the set of all retraction operators onP with the pointwise order, that is,f≤g in Retr (P) ifff(x)≤g(x) for everyx inP. An affirmative answer will be given in the present paper.     

Method of solution to fuzzy relation equations in a complete Brouwerian lattice

Up to now, how to solve a fuzzy relation equation in a complete Brouwerian lattice is still an open problem as Di Nola et al. point out. To this problem, the key problem is whether there exists a minimal element in the solution set when a fuzzy relation equation is solvable. In this paper, we first show that there is a minimal element in the solution set of a fuzzy relation equation AX=b (where A=(a₁,a₂,…,a_n) and b are known, and X=(x₁,x₂,…,x_n)^T is unknown) when its solution set is nonempty, and b has an irredundant finite join-decomposition. Further, we give the method to solve AX=b in a complete Brouwerian lattice under the same conditions. Finally, a method to solve a more general fuzzy relation equation in a complete Brouwerian lattice when its solution set is nonempty is also given under similar conditions.     

Fuzzy power sets and fuzzy implication operators

The theory of fuzzy power sets, which has hitherto been insufficiently developed, is shown very naturally to require the use of a fuzzy implication operator (Section 1). Six such operators are gathered from the literature on multiple-valued logic (Section 2), and their effects on fuzzy power-set theory are compared throughout the rest of the paper. After certain fundamental definitions of set characteristics (Section 3), the six operators are carried in parallel while working out basic aspects of power-set theory. Among these are the properties of the set-inclusion relation and the set-equivalence relation (Section 4), two distinct concepts of disjointness (Section 5), questions of consistency in the relations between a set and its complement (Section 6), and a very concrete theorem on a difference among the operators with regard to the derivation of crisp conclusions from fuzzy premises (Section 7). Finally (Section 8), emphasis is placed on the dependence of the choice of operators upon the purposes the user has in hand.     

格蕴涵代数的LI-理想格及其素元刻画

运用格理论的原理和方法对格蕴涵代数L的LI-理想概念作进一步研究.首先,在L的全体LI-理想之集ф_(LI)(L)上定义了格运算■和■,蕴涵运算■以及伪补运算■,证明了(ф_(LI)(L),,■,■,■,{O},L)构成一个完备Heyting代数的结论.其次,利用运算固的性质给出了(ф_(LI)(L),,■,■,■,■,{O},L)成为Boolean代数的若干充要条件.最后,借助于L的素LI-理想之特性获得了格(ф_(LI)(L),,■,■,{O},L)中素元的若干等价刻画.     

Two fuzzier implication operators in the theory of fuzzy power sets

The theory of fuzzy power sets requires the use of an implication operator acting within the set of values taken by the membership functions of the fuzzy sets. Two such operators and resulting relationships between fuzzy sets are studied here, and the results compared with previous ones obtained with other implication operators.