关于正则余剩余格与对合BCK-格

进一步研究了余剩余格的一些性质,在此基础上证明了正则余剩余格与对合BCK-格是两个等价的代数系统。所得结果将有助于深入了解正则余剩余格的代数结构,也为相关多值逻辑系统的研究提供又一途径。     

DR0代数:由De Morgan代数导出的正则剩余格

首先讨论了De Morgan代数与剩余格的关系,并引入强De Morgan代数的概念,讨论了它的基本性质．随后,将著名的R0蕴涵拓广到De Morgan代数上,称为广义R0蕴涵;证明了添加广义凰蕴涵和相应 算子后的De Morgan代数L成为剩余格的充要条件是L为强De Morgan代数,并由此引入D‰代数的概念．接着,研究了DR0代数与‰代数的关系,证明了以下结论：Boole代数是DR0代数;全序DR0代数和全序R0代数等价;DR0代数是R0代数当且仅当它满足预线性条件;无中点的DR0代数是BL代数当且仅当它是Boole代数．最后,举例说明了非D兄D代数的RD代数、以及非R0代数的DR0代数都是存在的．     

正则剩余格上的模糊理想基

首先,在正则剩余格中引入模糊理想基的概念,介绍了模糊理想基的一些重要性质,并且利用这些性质,给出了模糊理想基的三种等价形式;其次,结合具体实例讨论了模糊理想基与模糊理想的关系;最后,给出由模糊集生成模糊理想基及由模糊理想基生成模糊理想的方法.     

正则剩余格上的模糊理想及模糊蕴涵理想

对正则剩余格的结构作进一步研究。利用正则剩余格上、算子并结合模糊数学的思想和方法,在正则剩余格上引入了模糊理想和模糊蕴涵理想的概念,讨论了它们的基本性质。主要结果是:(1)给出了模糊理想和模糊蕴涵理想的等价刻画;(2)证明了模糊蕴涵理想一定是模糊理想,模糊理想不必是模糊蕴涵理想;(3)证明了全体模糊理想之集在给定的运算下是一个完备的分配格。     

强Ockham代数与剩余格

首先讨论了Ockham代数与剩余格的关系,引入了强Ockham代数的概念,并讨论了它的基本性质．然后,将著名的风蕴涵和风算子推广到Ockham代数上,证明了添加广义R0蕴涵和广义风算子后的Ockham代数L成为剩余格的充要条件是L为强Ockham代数．最后给出若干重要例子,以此来说明强Ockham代数的条件是独立的．     

模糊蕴涵格理论

模糊蕴涵代数,在文献中简称为FI代数,最初由吴望名先生于1990年提出,至今已经有许多研究成果.文中综述有关FI代数的概念,性质等主要研究工作,同时给出这类代数的一些新的性质.重点强调构成格结构的FI代数,称之为模糊蕴涵格,简称为FI格.这类代数结构与模糊逻辑中几个重要的代数系统具有紧密的联系,文中将揭示这些联系,一些重要的模糊逻辑代数系统都是FI格类的子类.另外,所有正则FI格构成代数簇,即等式代数类.这个代数簇将在模糊逻辑与近似推理中发挥重要的作用.     

关于PFI-代数与剩余格

本文提出了一种强FI代数-PFI代数,并且深入研究了它的性质,借此进一步揭示了FI-代数和剩余格之间更加密切的联系,进而以FI-代数为基本框架建立了R0-代数、正则剩余格等逻辑系统的结构特征(包括对隅结构)及其相互关系．这种以FI-代数为基础来统一处理剩余格和R0-代数的方法,同样适合于格蕴涵代数和MV代数等代数结构,而且从中更能清楚地看出它们之间的密切联系,也将有助于对相应形式逻辑系统与模糊推理的研究．     

N-半单代数中的剩余格结构

在N-半单代数的中心幂等元构成的集合G(R)中引入了"→、*、、Θ"运算和一个二元关系"≤",证明"≤"构成G(R)上的偏序关系,和Θ分别是偏序集(G(R),≤)上的上确界运算和下确界运算;进而证明了(G(R),,Θ,→,1,0)是剩余格。在此基础上得到了N-半单代数可以构成与M TL代数,BL代数,G-代数,G oguen代数,BR0-代数和R0-代数等价的代数系统,从而将模糊逻辑与结合代数有机地结合起来。     

强正则剩余格值逻辑系统L~N及其完备性

正则剩余格是一类重要的模糊逻辑代数系统,而常见的模糊逻辑形式系统大多数带有非联接词,并且相应的Lindenbaum代数都是正则剩余格.本文以强正则剩余格为语义,建立了一个一般的命题演算形式系统LN,并且证明了这个系统的完备性.几种常见的带有非联接词的模糊逻辑形式系统都是系统LN的扩张.     

否定非对合剩余格的BF-理想集上诱导的剩余格结构

对否定非对合剩余格的BF-理想问题作进一步深入研究.在一个否定非对合剩余格L的全体BF-理想之集BFI(L)上构造了伴随运算■和■使之成为一个完备剩余格.     

Fuzzy Topology Based on Residuated Lattice-Valued Logic

We use a semantical method of complete residuated lattice-valued logic to give a generalization of fuzzy topology as a partial answer to a problem by Roser and Turquette. This work is supported by the National Foundation for Distinguished Young Scholars (Grant No: 69725004), Research and Development Project of High-Technology (Grant No: 863-306-ZT06-04-3) and Foundation of Natural Sciences (Grant No: 69823001) of China and Fok Ying-Tung Education Foundation     

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蕴涵代数

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

强正则剩余格值逻辑系统（L）N及其完备性

正则剩余格是一类重要的模糊逻辑代数系统,而常见的模糊逻辑形式系统大多数带有非联接词,并且相应的Lindenbaum代数都是正则剩余格.本文以强正则剩余格为语义,建立了一个一般的命题演算形式系统LN,并且证明了这个系统的完备性.几种常见的带有非联接词的模糊逻辑形式系统都是系统LN的扩张.     

Optimal triangular decompositions of matrices with entries from residuated lattices

We describe optimal decompositions of an n×m matrix I into a triangular product of an n×k matrix A and a k×m matrix B. We assume that the matrix entries are elements of a residuated lattice, which leaves binary matrices or matrices which contain numbers from the unit interval [0, 1] as special cases. The entries of I, A, and B represent grades to which objects have attributes, factors apply to objects, and attributes are particular manifestations of factors, respectively. This way, the decomposition provides a model for factor analysis of graded data. We prove that fixpoints of particular operators associated with I, which are studied in formal concept analysis, are optimal factors for decomposition of I in that they provide us with decompositions with the smallest number k of factors possible. Moreover, we describe transformations between the m-dimensional space of original attributes and the k-dimensional space of factors. We provide illustrative examples and remarks on the problem of computing the optimal decompositions. Even though we present the results for matrices, i.e. for relations between finite sets in terms of relations, the arguments behind are valid for relations between infinite sets as well.     

Algebras of fuzzy sets

In this paper we investigate two kinds of algebras of fuzzy sets, which are obtained by using Zadeh's extension principle. We give conditions under which a homomorphism between two algebras induces a homomorphism between corresponding algebras of fuzzy sets. We prove that if the structure of truth values is a complete residuated lattice, the induced algebra of a subalgebra of an algebra can be embedded into the induced algebra of fuzzy sets of . For direct products we give conditions under which the direct product of algebras of fuzzy sets could be embedded into the algebra of fuzzy sets of the direct product. In the case of homomorphisms and direct products, the two kinds of algebras of fuzzy sets behave in different ways.     

BL代数的等价刻画及更多性质

研究了与H(a)jek的模糊命题演算系统BL相对应的BL代数,提出了仅涉及运算*和→的NBL代数概念并探讨了其有关性质,证明了BL代数与N-BL代数是等价的,进而得到了BL代数更多的性质.