Fuzzy概率空间的Fuzzy格刻划

本文研究了Fuzzy概率空间中Fuzzy事件及概率的代数性质.利用Fuzzy概率空间中的概率为集函数这一特征和Fuzzy格的相关理论，得到了Fuzzy概率空间中的概率是从一个Fuzzy格到某个区间的Fuzzy格模同态，并将概率分解成Fuzzy格同态与Fuzzy格模同态的乘积。     

完备Brouwerian格上Fuzzy关系方程有极小解的条件

本文在有限论域上对完备Brouwerian格上Fuzzy关系方程极小的存在问题作了探讨，首先构造了Fuzzy关系方程有解但无极小解的一个例子，然后在解集非空时给出了对Fuzzy关系方程的每一个解都存在一个小于等于它的极小解的一个充分条件及一个充要条件，特别地，在充分条件下给出了一类Fuzzy关系方程所有极小解的个数的公式。     

Fuzzy群的半格

引入 Fuzzy群的半格的概念 ,并讨论它们的一些代数性质。同时利用 Fuzzy理想对 Fuzzy群的半格作了一些等价刻画。     

关于W-Fuzzy格与W-理想

本文讨论了Ｆｕｚｙ格的Ｗ理想的一些基本性质。主要结果有：（１）对于一般的Ｆｕｚｙ格，给出了一个同余理想为Ｗ理想的若干充分条件和充要条件，所得结果是文［３］中相应结果在一般Ｆｕｚｙ格中的推广，从而完整地回答了文［３］中提出的一个问题；（２）对于Ｆｕｚｙ格下的同余素理想Ｐ，我们得到：Ｐ为Ｆ的Ｗ理想Ｆ／θ（Ｐ）为ＷＦｕｚｙ格；此时，Ｆ的的任一包含Ｐ的同余理想均为Ｗ理想。     

正则Fuzzy蕴涵代数

Fuzzy蕴涵代数是 [0 ,1]值逻辑的蕴涵联结词的一种代数抽象。本文给出正则 Fuzzy蕴涵代数的几个刻画 ,并且得到正则 Fuzzy蕴涵代数构成格的几个条件。     

格[0,1]上求解Fuzzy关系方程的一种方法

在有限论域上给出了一种求解格「０,１」,上Ｆｕｚｚｙ关系方程的方法,该方法对满足解集非空的Ｆｕｚｚｙ关系方程均能准确无误地求出其所有的极小元,运算中队援引Ｅ．Ｓａｎｃｈｅｚ定义的“α”算子最大解外,仅涉及比较「０,１」中两元的大小关系。     

集对Fuzzy格及其在格表示论中的应用

用幂集格构造了集对 Ｆｕｚｚｙ 格（这与用整数对构造有理数集有相似之处）,并用它证明了完整的软代数表示定理,即定义了到自身的映射且有最大元和最小元的格为软代数的充要条件是它与某个集对 Ｆｕｚｚｙ 格的子格同构．这样,与分配格在幂集 Ｂｏｏｌｅ 格中表示相对应,软代数在集对 Ｆｕｚｚｙ 格中有表示,在理论上是很完美的     

格的Fuzzy子集间F-同态性质探讨(2)

提出格的Fuzzy子集同F-同态等概念,对F-同态的性质进行了研究,得到一些重要而有趣的结果。     

R0-代数上的Fuzzy同余关系

在R0-代数中引入Fuzzy同余关系的概念,讨论了Fuzzy同余关系的一些基本性质,并通过对R0-代数中的Fuzzy MP滤子,特别是生成Fuzzy MP滤子的讨论建立了Fuzzy MP滤子与Fuzzy同余关系之间的联系。     

软代数（Fuzzy格）的中理想及同余关系

本文主要研究软代数（Ｆｕｚｚｙ格）的内部构造．本文首次引入了反映软代数（Ｆｕｚｚｙ格）基本特性的所谓理想（Ｍ－理想）的概念．证明了任一软代数的全体中理想组成一分配格．其次讨论了软代数（Ｆｕｚｚｙ格）的同余关系，证明了全体同余关系组成一具有０，１元素的完备分配格和Ｂｒｏｕｗｅｒ格．给出了极大同余关系的存在性，讨论了软代数中“理想”跟“同余”的关系．证明了每个理想及每个元素、每个中理想都以一种确定的方式定义一同余关系．文中有趣地发现跟一般格论显著不同，在软代数（Ｆｕｚｚｙ格）里，一个理想产生的同余关系在自然映射之下，其核一般不再等于原来的理想．文中给出了使之等于原理想的充分必要条件．从而为探索同余理想（即与核相等的理想），开避了道路．本文在我们软代数讨论班上散发之后，已有四、五名学者在此基础上写出了新的论文．     

Fuzzy Galois Connections

The concept of Galois connection between power sets is generalized from the point of view of fuzzy logic. Studied is the case where the structure of truth values forms a complete residuated lattice. It is proved that fuzzy Galois connections are in one-to-one correspondence with binary fuzzy relations. A representation of fuzzy Galois connections by (classical) Galois connections is provided.     

模糊格蕴涵代数范畴

本文提出了模糊格蕴涵代数范畴FLC的概念，讨论了它的一些基本性质并指出了它与范畴LC的关系．     

EQ-algebras

We introduce a new class of algebras called EQ-algebras. An EQ-algebra has three basic binary operations (meet, multiplication and a fuzzy equality) and a top element. These algebras are intended to become algebras of truth values for a higher-order fuzzy logic (a fuzzy type theory, FTT). The motivation stems from the fact that until now, the truth values in FTT were assumed to form either an IMTL-, BL-, or MV-algebra, all of them being special kinds of residuated lattices in which the basic operations are the monoidal operation (multiplication) and its residuum. The latter is a natural interpretation of implication in fuzzy logic; the equivalence is then interpreted by the biresiduum, a derived operation. The basic connective in FTT, however, is a fuzzy equality and, therefore, it is not natural to interpret it by a derived operation. This defect is expected to be removed by the class of EQ-algebras introduced and studied in this paper. From the algebraic point of view, the class of EQ-algebras generalizes, in a certain sense, the class of residuated lattices and so, they may become an interesting class of algebraic structures as such.     

Fuzzy蕴涵代数与MV代数

本文讨论Ｆｕｚｚｙ蕴涵代数与ＭＶ代数之间的关系，并证明了在一定的条件下Ｆｕｚｚｙ蕴函代数是剩余格。     

Ordinally equivalent data: A measurement-theoretic look at formal concept analysis of fuzzy attributes

We show that if two fuzzy relations, representing data tables with graded attributes, are ordinally equivalent then their concept lattices with respect to the Gödel operations on chains are (almost) isomorphic and that the assumption of Gödel operations is essential. We argue that measurement-theoretic results like this one are important for pragmatic reasons in relational data modeling and outline issues for future research.     

完备强对偶原子分配格上的不可约极小并分解及其应用

在完备强对偶原子分配格上引入了不可约极小并分解的概念,给出了元素存在不可约极小并分解的一些充要条件.证明了当元素恰有一个下邻时,该元索就足完全并既约元;有两个下邻时,元素的不可约极小并分解与不可约完全并既分解是等价的;下邻多于两个时,元素的不可约极小并分解不一定足不可约完全并既分解.最后证明了模糊关系方程有极小解的充要条件是方程左边有大于等于右手项的系数或右手项系数有不可约极小并分解.     

软代数的自然表示

指出了软代数现行表示的非自然性;通过引入新的集对F格与伪幂集格,获得了两个自然的软代数表示定理,并证明了它们在某种意义上不可能再改进.     

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.     

The optimization problem over a distributive lattice

In this paper we give a necessary and sufficient condition for existence of minimal solution(s) of the linear system A * X ≥ b where A, b are fixed matrices and X is an unknown matrix over a lattice. Next, an algorithm which finds these minimal solutions over a distributive lattice is given. Finally, we find an optimal solution for the optimization problem min {Z = C * X | A * X ≥ b} where C is the given matrix of coefficients of objective function Z. This research was completed while the author was a visitor of the Center for Informatics and Applied Optimization, University of Ballarat, Ballarat, Australia.