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

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

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

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

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

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

相似剩余格及其对应逻辑系统的完备性

引入了相似剩余格的概念,讨论了剩余格上相似算子和等价算子的关系,并得到了真值剩余格和相似剩余格相互转化的方法.其次,研究了相似剩余格上的相似滤子,利用相似滤子刻画了可表示的相似剩余格.最后,引入了相似剩余格对应的逻辑系统,证明了其完备性定理,并得到了其成为半线性逻辑的条件.     

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

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

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)     

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     

Lattice-valued fuzzy Turing machines: Computing power, universality and efficiency

In this paper we study fuzzy Turing machines with membership degrees in distributive lattices, which we called them lattice-valued fuzzy Turing machines. First we give several formulations of lattice-valued fuzzy Turing machines, including in particular deterministic and non-deterministic lattice-valued fuzzy Turing machines (l-DTMcs and l-NTMs). We then show that l-DTMcs and l-NTMs are not equivalent as the acceptors of fuzzy languages. This contrasts sharply with classical Turing machines. Second, we show that lattice-valued fuzzy Turing machines can recognize n-r.e. sets in the sense of Bedregal and Figueira, the super-computing power of fuzzy Turing machines is established in the lattice-setting. Third, we show that the truth-valued lattice being finite is a necessary and sufficient condition for the existence of a universal lattice-valued fuzzy Turing machine. For an infinite distributive lattice with a compact metric, we also show that a universal fuzzy Turing machine exists in an approximate sense. This means, for any prescribed accuracy, there is a universal machine that can simulate any lattice-valued fuzzy Turing machine on it with the given accuracy. Finally, we introduce the notions of lattice-valued fuzzy polynomial time-bounded computation (lP) and lattice-valued non-deterministic fuzzy polynomial time-bounded computation (lNP), and investigate their connections with P and NP. We claim that lattice-valued fuzzy Turing machines are more efficient than classical Turing machines.     

Monadic Bounded Residuated Lattices

Bounded integral residuated lattices form a large class of algebras which contains algebraic counterparts of several propositional logics behind many-valued reasoning and intuitionistic logic. In the paper we introduce and investigate monadic bounded integral residuated lattices which can be taken as a generalization of algebraic models of the predicate calculi of those logics in which only a single variable occurs.     

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.     

THE FUNDAMENTAL THEOREM OF ULTRAPRODUCT IN PAVELKA'S LOGIC

In [This Zeitschrift 25 (1979), 45-52, 119-134, 447-464], Pavelka systematically discussed propositional calculi with values in enriched residuated lattices and developed a general framework for approximate reasoning. In the first part of this paper we introduce the concept of generalized quantifiers into Pavelka's logic and establish the fundamental theorem of ultraproduct in first order Pavelka's logic with generalized quantifiers. In the second part of this paper we show that the fundamental theorem of ultraproduct in first order Pavelka's logic is preserved under some direct product of lattices of truth values.     

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.     

模糊概念格与模糊推理

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

Multi-adjoint algebras versus non-commutative residuated structures

Adjoint triples and pairs are basic operators used in several domains, since they increase the flexibility in the framework in which they are considered. This paper introduces multi-adjoint algebras and several properties; also, we will show that an adjoint triple and its “dual” cannot be considered in the same framework.Moreover, a comparison among general algebraic structures used in different frameworks, which reduce the considered mathematical requirements, such as the implicative extended-order algebras, implicative structures, the residuated algebras given by sup-preserving aggregations and the conjunctive algebras given by semi-uninorms and u-norms, is presented. This comparison shows that multi-adjoint algebras generalize these structures in domains which require residuated implications, such as in formal concept analysis, fuzzy rough sets, fuzzy relation equations and fuzzy logic.     

关于PFI-代数与剩余格

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

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.     

Semigroups Based on L-Valued Logic and Its Ideals

In this paper, we introduce the concepts of semigroups based on complete residuated lattice-valued logic (L-valued logic, for short), and discuss the structures and the properties of subsemigronps and ideals in the theory of L-semigroups.AMS Subject Classification (2000) 20M     

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

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

A fuzzy logic for an ordinal sum t-norm

Among the class of residuated fuzzy logics, a few of them have been shown to have standard completeness both for propositional and predicate calculus, like Gödel, NM and monoidal t-norm-based logic systems. In this paper, a new residuated logic NMG, which aims at capturing the tautologies of a class of ordinal sum t-norms and their residua, is introduced and its standard completeness both for propositional calculus and for predicate calculus are proved.     

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.