MV-代数的素滤子MV-拓扑空间

在MV-方体[0,1]X的子集Ω上引进MV-拓扑结构,并套论MV-拓扑空间的紧性、Hausdorff分离性等拓扑性质.细致地讨论MV-代数的素滤子集上的MV-拓扑空间(M,ΩM),证明素滤子MV-拓扑空间是紧Hausdorff MV-空间,并且它还是良紧空间.作为应用,证明一个σ-完备格M是MV-代数当且仅当M同构于某个Stone MV-空间的MV-开闭集格.     

MV-代数上的度量结构及其在多值逻辑中的应用

设M是一个MV-代数,Ω是从MV-代数M到MV-单位区间的全体赋值之集,μ是Ω上的概率测度.本文基于μ在M中引入了元素的尺寸和元素对之间的相似度概念,并由此在M上建立了度量结构.给出了MV-代数上的度量结构在多值逻辑中的一些应用.     

Lukasiewicz语义集上的紧Hausdorff拓扑

以Ω记从全体命题之集F（S）到单位区间的全体Lukasiewicz赋值之集.本文通过一种自然的方法在Ω上引入了Fuzzy拓扑δ,证明了其为第二可数的零维良紧空间,并证明了δ在Ω上生成的截拓扑空间是第二可数的紧Hausdorff空间,从而是可度量化的空间.     

MV-代数的f-微分

利用MV-代数的自同态在MV-代数上引入并研究了广义微分—f-微分.随之给出MV-代数上保序的f-微分及f-微分的不动点集F_d(M)等概念,得到保序的f-微分的几个等价条件以及每一个f-微分的不动点集F_d(M)和集d~(-1)(0)为M的格理想等重要结论.最后,利用保序f-微分及其不动点集F_d(M)给出了MV-代数成为Boolean-代数的一个等价刻画.     

R0代数的正则性及其Fuzzy拓扑表现定理

以ΩM记R0代数M到单位区间的全体赋值之集。本文先讨论R0代数的正则性问题,得到了关于R0代数正则性的一些结论。从而可通过一种自然的方法在ΩM上引入Fuzzy拓扑,建立了R0代数的Fuzzy拓扑表现定理。     

MV-代数上的广义微分

在MV-代数上引入了广义微分的概念,研究了MV-代数广义微分的相关性质。进一步引入了保序广义微分的概念。给出了MV-代数上的保序广义微分的若干等价条件。进一步,在MV-代数M上引入了广义微分D的不动点集FixD(M),得到若D是保序广义微分,则FixD(M)是M的理想与格理想。进而通过广义微分的不动点集刻画了布尔代数和线性布尔代数。     

MV-代数的广义导子

借助于MV-代数的自同态引入并研究了MV-代数上的广义(→,⊕)-导子,得到了其等价刻画.此外,给出了MV-代数的广义中心主导子的概念,在此基础之上讨论了广义(→,⊕)-导子与MV-代数其它导子之间的关系,并利用强主中心广义导子的不动点集给出MV-代数成为Boole代数的等价刻画.所得结论推广了MV-代数上的导子,并借...     

R＋（L）值半连续映射与连续d锥

定义L－fuzzy非负扩充实直线R＋（L）与R＋（L）值半连续映射,证明在一个L－core紧的L－fuzzy拓扑空间（L^x,δ）上的R＋（L）值下半连续映射的全体关于点式序,加法运算与数乘运算的构成一个连续d锥,推广了文献[6]中的结果。     

模糊逻辑代数的Loomis—Sikorski表现定理

通过研究MV-代数、Π-代数、G-代数、R0-代数等模糊逻辑代数的赋值(从模糊逻辑代数L到单位区间[0,1]的同态)与滤子之间的关系,建立了MV-代数、Π-代数、G-代数、R0-代数等模糊逻辑代数的Loomis-Sikorski表现定理.     

T-极限空间范畴的笛卡儿闭性

本文在完备MV-代数的格值环境下,基于T-滤子定义了一种格值收敛空间,即,T-极限空间,并且证明了T-极限空间范畴是拓扑的且具有笛卡儿闭性。同时本文还研究了T-极限空间范畴与其子范畴之间的关系。     

Fuzzy Relation Equations for Compression/Decompression Processes of Colour Images in the RGB and YUV Colour Spaces

We use particular fuzzy relation equations for compression/decompression of colour images in the RGB and YUV spaces, by comparing the results of the reconstructed images obtained in both cases. Our tests are made over well known images of 256×256 pixels (8 bits per pixel in each band) extracted from Corel Gallery. After the decomposition of each image in the three bands of the RGB and YUV colour spaces, the compression is performed using fuzzy relation equations of “min - →_t” type, where “t” is the Lukasiewicz t-norm and “→_t” is its residuum. Any image is subdivided in blocks and each block is compressed by optimizing a parameter inserted in the Gaussian membership functions of the fuzzy sets, used as coders in the fuzzy equations. The decompression process is realized via a fuzzy relation equation of max-t type. In both RGB and YUV spaces we evaluate and compare the root means square error (RMSE) and the consequentpeak signal to noise ratio (PSNR) on the decompressed images with respect to the original image under several compression rates.     

Lukasiewicz-based merging possibilistic networks

Possibility theory provides a good framework for dealing with merging problems when information is pervaded with uncertainty and inconsistency. Many merging operators in possibility theory have been proposed. This paper develops a new approach to merging uncertain information modeled by possibilistic networks. In this approach we restrict our attention to show how a “triangular norm” establishes a lower bound on the degree to which an assessment is true when it is obtained by a set of initial hypothesis represented by a joint possibility distribution. This operator is characterized by its high effect of reinforcement. A strongly conjunctive operator is suitable to merge networks that are not involved in conflict, especially those supported by both sources. In this paper, the Lukasiewicz t-norm is first applied to a set of possibility measures to combine networks having the same and different graphical structures. We then present a method to merge possibilistic networks dealing with cycles.     

BCK—代数理想（Ⅳ）

本文是作者［１］－［６］的继续，我们得到下述结果：定理４．设Ｉ是ＢＣＫ－代数Ｘ的一个理想，ａ是Ｘ的一个元素，则包含Ｉ和ａ的最小理想是对某个非负整数｝．定理１４．设Ｘ是一个Ｌｕｋａｓｉｅｗｉｃｚ代数，Ｉ是Ｘ的一个质理想．如果Ａ是Ｘ的一个真理想且，则Ａ也是质的．定理１５．Ｌｕｋａｓｉｅｗｉｃｚ代数Ｘ的零理想｛０｝是质的当且仅当＜Ｘ；≤＞是一个全序集．     

Implication in fuzzy logic

Intermediate truth values and the order relation “as true as” are interpreted. The material implication A → B quantifies the degree by which “B is at least as true as A.” Axioms for the → operator lead to a representation of → by the pseudo-Lukasiewicz model. A canonical scale for the truth value of a fuzzy proposition is selected such that the → operator is the Lukasiewicz operator and the negation is the classical 1−. operator. The mathematical structure of some conjunction and disjunction operators related to → are derived.     

Optimal strategic reasoning with McNaughton functions

The aim of the paper is to explore strategic reasoning in strategic games of two players with an uncountably infinite space of strategies the payoff of which is given by McNaughton functions—functions on the unit interval which are piecewise linear with integer coefficients. McNaughton functions are of a special interest for approximate reasoning as they correspond to formulas of infinitely valued Lukasiewicz logic. The paper is focused on existence and structure of Nash equilibria and algorithms for their computation. Although the existence of mixed strategy equilibria follows from a general theorem (Glicksberg, 1952) [5], nothing is known about their structure neither the theorem provides any method for computing them. The central problem of the article is to characterize the class of strategic games with McNaughton payoffs which have a finitely supported Nash equilibrium. We give a sufficient condition for finite equilibria and we propose an algorithm for recovering the corresponding equilibrium strategies. Our result easily generalizes to n-player strategic games which don't need to be strictly competitive with a payoff functions represented by piecewise linear functions with real coefficients. Our conjecture is that every game with McNaughton payoff allows for finitely supported equilibrium strategies, however we leave proving/disproving of this conjecture for future investigations.     

基础L*系统的一种扩张——Lukasiewicz系统

研究模糊命题演算的形式演绎系统 L *和 Lukasiewicz命题演算系统 Lu,提出基础系统L *—— BL *系统 ,证明 BL *系统的一种扩张与 Lukasiewicz系统之间的等价性 ,从而为 L *系统和BL *系统提供了一个应用实例。     

一类(L)ukasiewicz n+1值逻辑系统中VDF问题的求解理论

为在经典逻辑学中建立Fuzzy分离规则的推理模式，由赋值决定公式问题（简称VDF问题）已经提出，并已在二值命题逻辑L和p＋1（p为素数）值Lukasiewicz命题逻辑中得到了解决，但是对一般的n＋1（n〉3且n不是素数）值Lukasiewicz命题逻辑系统L（n＋1），VDF问题相当复杂且尚未解决．本文尝试在一类特殊的n＋1值Lukasiewicz命题逻辑系统L（n＋1），即L（n＋1）的赋值域W（n＋1）的所有子代数在包含序下构成一个链中建立VDF问题的求解理论，并完满地解决了这类n＋1值Lukasiewicz命题逻辑系统L（n＋1）中的VDF问题．     

max-zero t-模复合意义下的模糊矩阵幂序列的收敛性

主要讨论模糊矩阵在max-zro t-模(以下简称为max-t0)复合意义下的收敛性。证明了模糊矩阵在,max-t0复合意义下只有有限收敛,无限收敛,有限振荡及无限振荡这四种情况。并主要以一种特殊且重要的zero t-模：lukasiewice t-模为例,研究了max-lukasiewiez t模(以下简称为max-lu)复合意叉下的模糊矩阵的收敛性。证明了在max-lu复合意义下．模糊矩阵要么有限收敛要么有限振荡。且比较了在max-lu复合意义下以及在,max-product复合意义下,模糊矩阵收敛性的相同之处与不同之处,并揭示其原因。