关于Z-蕴涵代数

基于N-半单代数和格蕴涵代数、FI-代数, Wajsberg-代数、BCK-代数、BCI-代数、BCC-代数及MV- 代数等的关系[9],本文中,我们引入了Z-蕴涵代数的概念, 并讨论了它们的某些性质.     

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代数都是存在的．     

MV代数定义的蕴涵简化形式

通过对MV代数和Lukasiewicz命题演算系统的研究,我们对MV代数的定义进行了简化,并讨论了MV代数和其它代数之间的关系。主要结果是:(1)从蕴涵角度出发,给出了MV代数的两种简化定义;(2)提出了弱格蕴涵代数的概念,并证明了它与BR0代数等价;(3)证明了弱格蕴涵代数是正则Fuzzy蕴涵代数。     

蕴涵代数与BCK代数

系统研究 Fuzzy蕴涵代数与 BCK代数之间的关系 ,给出 MV代数与 BCK代数之间的联系 ,建立正则 FI代数和对合 BCK代数的对偶代数     

16种基础R0-代数结构的相对独立公理系统

在对R0-代数和基础R0-代数结构研究的基础上,讨论了基础R0-代数结构与并(交)半格及有界并(交)半格上的等价性命题系统,进而证明了16种基础R0-代数公理系统的相对独立性,同时指出了相应R0-代数结构的公理系统的相对独立性.     

R0-代数的格蕴涵表示定理

通过对模糊命题演算系统∧*及相应的Lindenbaum代数的研究,给出了R0-代数的格蕴涵表示形式,极大地简化了R0-代数的定义形式,使得R0-代数从定义形式上更加符合逻辑代数的特征,突出了R0-代数和其它逻辑代数的区别与联系,为进一步研究R0-代数及其和其它逻辑代数的关系提供了一个强有力的工具。     

粗糙集代数中的剩余格结构

讨论粗糙集代数与剩余格的关系.借助近似代数上的原子及同余关系,证明了在适当选取蕴涵算子及相应的剩余算子之后,粗糙集代数就成为剩余格,并进而证明了粗糙集代数也是MV代数与R0代数.     

强Ockham代数与剩余格

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

基础R0-代数与基础L*系统

研究了王国俊教授建立的模糊命题演算的形式演绎系统L^*和与之在语义上相匹配的R0-代数，以及：Petr Hajek建立的模糊命题演算系统BL和BL-代数，提出了基础R0-代数和基础L^*系统的观点，讨论了基础L^*代数与BL代数，基础L^*系统与BL系统之间．的相互关系及相对独立性，讨论了基础L^*系统关于基础风一代数的完备性问题，证明了MV-代数是特殊的基础R0-代数，指出了Lukasiewicz模糊命题演算系统是基础L^*系统的扩张，最后作为基础R0-代数与基础L^*系统的一个应用，证明了L^*系统关于语义Ωw的完备性，并在将模糊命题演算系统中的推演证明转化为相应逻辑代数中的代数运算方面作了一些尝试．     

Toroidal李代数上的Poisson代数结构

非交换的Poisson代数同时具有结合代数和李代数两种代数结构,而结合代数和李代数之间满足所谓的Leibniz法则．文中确定了Toroidal李代数上所有的Poisson代数结构,推广了仿射Kac-Moody代数上相应的结论．     

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

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

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

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

剩余格与正则剩余格的特征定理

本文进一步研究了具有广泛应用的一类模糊逻辑代数系统——剩余格，并引入了正则剩余格的概念，对剩余格与正则剩余格的定义进行了讨论，给出了剩余格与正则剩余格的特征定理，其中包含剩余格与正则剩余格的等式特征，从而这两个格类都构成簇．本文还讨论了剩余格与正则剩余格公理系统的独立性，以及它们与相近代数结构的关系．     

模糊概念格与模糊推理

基于伽罗瓦连接,分别在交换伴随对与对合剩余格条件下,讨论了模糊概念格的四种定义形式。并证明了在对合剩余格上,对偶性成立,四种模糊算子将具有与经典意义下一致的相互关系。最后我们提出了一种基于模糊概念格的模糊推理规则,并证明了其还原性。     

非对合剩余格的正规双极值模糊理想

本文对非对合剩余格的双极值模糊理想问题作进一步深入研究.引入了非对合剩余格的正规双极值模糊理想概念, 考察了其性质并获得了其若干等价刻画.同时, 给出了两类特殊的双极值模糊理想的定义, 分别称为极大双极值模糊理想和完全正规双极值模糊理想并讨论了它们的性质和相互关系.这些工作为进一步揭示非对合剩余格的结构特征拓展了研究思路.     

Interior and closure operators on bounded residuated lattices

Bounded integral residuated lattices form a large class of algebras containing some classes of algebras behind many valued and fuzzy logics. In the paper we introduce and investigate multiplicative interior and additive closure operators (mi- and ac-operators) generalizing topological interior and closure operators on such algebras. We describe connections between mi- and ac-operators, and for residuated lattices with Glivenko property we give connections between operators on them and on the residuated lattices of their regular elements.     

Continuous fuzzy Horn logic

The paper deals with fuzzy Horn logic (FHL) which is a fragment of predicate fuzzy logic with evaluated syntax. Formulas of FHL are of the form of simple implications between identities. We show that one can have Pavelka‐style completeness of FHL w.r.t. semantics over the unit interval [0, 1] with (residuated lattices given by) left‐continuous t‐norm and a residuated implication, provided that only certain fuzzy sets of formulas are considered. The model classes of fuzzy structures of FHL are characterized by closure properties. We also give comments on related topics proposed by N. Weaver. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

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.     

Simulation for lattice-valued doubly labeled transition systems

During the last decades, a large amount of multi-valued transition systems, whose transitions or states are labeled with specific weights, have been proposed to analyze quantitative behaviors of reactive systems. To set up a unified framework to model and analyze systems with quantitative information, in this paper, we present an extension of doubly labeled transition systems in the framework of residuated lattices, which we will refer to as lattice-valued doubly labeled transition systems (LDLTSs). Our model can be specialized to fuzzy automata over complete residuated lattices, fuzzy transition systems, and multi-valued Kripke structures. In contrast to the traditional yes/no approach to similarity, we then introduce lattice-valued similarity between LDLTSs to measure the degree of closeness of two systems, which is a value from a residuated lattice. Further, we explore the properties of robustness and compositionality of the lattice-valued similarity. Finally, we extend the Hennessy–Milner logic to the residuate lattice-valued setting and show that the obtained logic is adequate and expressive with lattice-valued similarity.     

Generalized Bosbach states: part I

States have been introduced on commutative and non-commutative algebras of fuzzy logics as functions defined on these algebras with values in [0,1]. Starting from the observation that in the definition of Bosbach states there intervenes the standard MV-algebra structure of [0,1], in this paper we introduce Bosbach states defined on residuated lattices with values in residuated lattices. We are led to two types of generalized Bosbach states, with distinct behaviours. Properties of generalized states are useful for the development of an algebraic theory of probabilistic models for non-commutative fuzzy logics.