否定非对合剩余格上的BF-同余关系

为了进一步深入研究否定非对合剩余格的结构特征,引入否定非对合剩余格上的BF-同余关系概念并考察其性质.讨论了否定非对合剩余格L上的BF-同余关系与BF-理想间的关系,基于L的BF-理想A诱导出了一个BF-同余关系Φ_A,证明了L在Φ_A下的商代数构成一个剩余格.     

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

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

伪对合剩余格(非可换)与伪效应代数(英文)

提出伪对合剩余格(非可换)的概念。通过在伪效应代数中引入两个部分运算,研究了伪对合剩余格与格伪效应代数之间的自然关系,证明了以下结论:在一定条件下,一个格伪效应代数可被扩张成为一个伪对合剩余格,同时一个伪对合剩余格可被限制为一个格伪效应代数。特别地,得到伪对合剩余格成为具有Riesz分解性质的格伪效应代数的一个充要条件。最后,还讨论了伪效应代数与剩余格的理想与滤子理论。     

模糊Prime元

基于完备剩余格,本文在模糊完备格中,引入模糊Prime元概念。给出了模糊Prime元的等价刻画,证明了所有的模糊Prime元构成的模糊集是模糊完全分配格。     

预线性与对合非结合剩余格

非结合剩余格是非结合格值逻辑系统的代数抽象,本文研究几类特殊非结合剩余格的代数性质。证明了满足预线性条件的非结合剩余格必是分配格,并给出预线性非结合剩余格的充分必要条件。同时,引入对合和强对合非结合剩余格的概念,研究了它们的基本性质,并分别给出对合和强对合非结合剩余格的等价条件。最后,通过反例说明强对合预线性非结合剩余格不一定是蕴涵格。     

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

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

否定非对合剩余格上基于正规模糊理想的一致拓扑空间

拓扑结构是逻辑代数研究领域的重要研究内容之一,为了揭示否定非对合剩余格上的拓扑结构,基于正规模糊理想诱导的同余关系在否定非对合剩余格上构造一致拓扑空间并讨论其拓扑性质.证明了:(1)一致拓扑空间是第一可数,零维,非连通,局部紧的完全正则空间;(2)一致拓扑空间是T_1空间当且仅当是T_2空间;(3)否定非对合剩余格中格运算和伴随运算关于一致拓扑都是连续的,从而构成拓扑否定非对合剩余格.同时,获得了一致拓扑空间是紧空间和离散空间的充分必要条件.最后,讨论了拓扑否定非对合剩余格中代数同构与拓扑同胚间的关系.对从拓扑层面进一步揭示否定非对合剩余格的内部特征具有一定的促进作用.     

关于否定非对合剩余格的模糊LI-理想

运用模糊集及分析学的方法和技巧对否定非对合剩余格的模糊LI-理想问题作深入研究。证明了一个给定的否定非对合剩余格L的全体模糊LI-理想之集FLI(L)关于模糊集合包含序?构成完备Heyting代数。并给出了完备Heyting代数(FLI(L),?)中蕴涵算子的表示定理。     

剩余格上的L滤子

剩余格为模糊逻辑和模糊推理提供了一种良好的代数结构,滤子是剩余格中一个十分重要的概念,它在基于剩余格的模糊逻辑代数语义的研究中,扮演着一个关键的角色。本文基于Pavelka所提出的广义MP规则和真值提升规则,研究基于这两种推理规则的演绎系统的代数化问题。引入L滤子的概念,讨论这些滤子之间的关系,并给出它们的一些代数刻画。     

否定非对合剩余格的BF-理想

为了深入研究否定非对合剩余格的结构特征,引入否定非对合剩余格的BF-理想概念并考察其性质.证明了BF-理想的BF-交集、同态像和同态原像也是BF-理想.同时,给出了BF-理想的BF-并集成为BF-理想的条件.     

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.     

The word problem for involutive residuated lattices and related structures

It will be shown that the word problem is undecidable for involutive residuated lattices, for finite involutive residuated lattices and certain related structures like residuated lattices. The proof relies on the fact that the monoid reduct of a group can be embedded as a monoid into a distributive involutive residuated lattice. Thus, results about groups by P. S. Novikov and W. W. Boone and about finite groups by A. M. Slobodskoi can be used. Furthermore, for any non-trivial lattice variety , the word problem is undecidable for those involutive residuated lattices and finite involutive residuated lattices whose lattice reducts belong to . In particular, the word problem is undecidable for modular and distributive involutive residuated lattices. The author would like to thank the Deutsche Telekom Stiftung for financial support. Received: 10 November 2005     

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.     

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

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

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

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

Generalized Bosbach and Rie?an states based on relative negations in residuated lattices

Bosbach and Rie?an states on residuated lattices both are generalizations of probability measures on Boolean algebras. Recently, two types of generalized Bosbach states on residuated lattices were introduced by Georgescu and Mure?an through replacing the standard MV-algebra in the original definition with arbitrary residuated lattices as codomains. However, several interesting problems there remain still open. The first part of the present paper gives positive answers to these open problems. It is proved that every generalized Bosbach state of type II is of type I and the similarity Cauchy completion of a residuated lattice endowed with an order-preserving generalized Bosbach state of type I is unique up to homomorphisms preserving similarities, where the codomain of the type I state is assumed to be Cauchy-complete. Consequently, many existing results about generalized Bosbach states can be further strengthened. The second part of the paper introduces the notion of relative negation (with respect to a given element, called relative element) in residuated lattices, and then many issues with the canonical negation such as Glivenko property, semi-divisibility, generalized Rie?an state of residuated lattices can be extended to the context of such relative negations. In particular, several necessary and sufficient conditions for the set of all relatively regular elements of a residuated lattice to be special residuated lattices are given, of which one extends the well-known Glivenko theorem, and it is also proved that relatively generalized Rie?an states vanishing at the relative element are uniquely determined by their restrictions on the MV-algebra consisting of all relatively regular elements when the domain of the states is relatively semi-divisible and the codomain is involutive.     

Fuzzy Horn logic I

The paper presents generalizations of results on so-called Horn logic, well-known in universal algebra, to the setting of fuzzy logic. The theories we consider consist of formulas which are implications between identities (equations) with premises weighted by truth degrees. We adopt Pavelka style: theories are fuzzy sets of formulas and we consider degrees of provability of formulas from theories. Our basic structure of truth degrees is a complete residuated lattice. We derive a Pavelka-style completeness theorem (degree of provability equals degree of truth) from which we get some particular cases by imposing restrictions on the formulas under consideration. As a particular case, we obtain completeness of fuzzy equational logic.     

A Gentzen system for involutive residuated lattices

We establish a cut-free Gentzen system for involutive residuated lattices and provide an algebraic proof of completeness. As a result we conclude that the equational theory of involutive residuated lattices is decidable. The connection to noncommutative linear logic is outlined. Received July 22, 2004; accepted in final form July 19, 2005.     

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

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