BL-代数上的几种直觉模糊滤子

结合直觉模糊集和滤子理论,对BL-代数上的直觉模糊滤子进行了研究。首先回顾了BL-代数和直觉模糊集的有关基础知识。然后引入BL-代数上的直觉模糊滤子、直觉模糊格滤子、直觉模糊布尔滤子和直觉模糊蕴涵滤子的概念,讨论了它们的一系列重要性质,证明了直觉模糊滤子与直觉模糊格滤子、直觉模糊布尔滤子和直觉模糊蕴涵滤子是等价的,并用实例进行了验证。最后探讨了直觉模糊滤子和模糊滤子的关系。     

剩余格上的模糊滤子和模糊同余关系

介绍了剩余格上的模糊同余关系和模糊滤子的定义,给出了剩余格上模糊滤子和模糊同余关系间的一一对应,证明了在剩余格上模糊滤子和模糊同余关系上定义适当的序关系可使它们是完备格同构。     

Boolean filters and positive implicative filters of residuated lattices

The aim of this paper is to introduce the notions of Boolean filters and positive implicative filters in residuated lattices and to investigate their properties. Several characterizations of Boolean filters and positive implicative filters are derived. The extension theorems of implicative filters and positive implicative filters are obtained. The relations among Boolean filters, implicative filters and positive implicative filters are investigated and it is proved that Boolean filters are equivalent to implicative filters, and that every Boolean filter is a positive implicative filter, but the converse may not be true. Furthermore, the conditions under which a positive implicative filter is a Boolean filter are established.     

伪BL-代数的犹豫模糊滤子

提出了伪BL-代数的犹豫模糊滤子的概念，给出它的几个等价刻画，并研究了它的一些性质。进一步，引入了伪BL-代数的几种犹豫模糊滤子，如犹豫模糊Boolean滤子、犹豫模糊正规滤子、犹豫模糊超滤子和犹豫模糊固执滤子，讨论了它们的一些刻画，给出了其间的一些关系。通过研究伪BL-代数中犹豫模糊Boolean滤子与犹豫模糊正规滤子的关系，解决了伪BL-代数中是否每个Boolean滤子都是正规滤子这样一个开问题。     

剩余格的T-模糊滤子与T-模糊同余关系

将t-模应用于模糊滤子和模糊同余上,引入剩余格的T-模糊滤子与T-模糊同余,并分别研究T-模糊滤子与T-模糊同余的性质与一些等价刻画;得到全体T-模糊滤子的集合与T-模糊同余的集合是同构;研究了由T-模糊滤子所诱导的商剩余格以及同态定理。这些理论在其他的逻辑代数系统仍然成立。     

可换双剩余格上的广义模糊粗糙集及其公理化

双剩余格是t-模、t-余模、模糊剩余蕴涵及其对偶算子的代数抽象,基于格的L-模糊关系是普通模糊关系的推广。作为Pawlak经典粗糙集及多种模糊粗糙集模型的共同推广,提出了一种基于可换双剩余格及L-模糊关系的广义模糊粗糙集模型,引入了正则可换双剩余格的概念,并给出了基于正则可换双剩余格的广义模糊粗糙上、下近似算子的公理系统,推广了多个文献中已有的结果。     

Fuzzy interior operators

We study interior operators from the point of view of fuzzy set theory. The present approach generalizes the particular cases studied previously in the literature in two aspects. First, we use complete residuated lattices as structures of truth values thus generalizing several important cases like the classical Boolean case, (left-)continuous t-norms, MV-algebras, BL-algebras, etc. Second, and more importantly, we pay attention to graded subsethood of fuzzy sets, which turns out to play an important role. In the first part, we define, illustrate by examples and study general fuzzy interior operators. The second part is devoted to fuzzy interior operators induced by fuzzy equivalence relations (similarities).     

The pseudo-linear semantics of interval-valued fuzzy logics

Triangle algebras are equationally defined structures that are equivalent with certain residuated lattices on a set of intervals, which are called interval-valued residuated lattices (IVRLs). Triangle algebras have been used to construct triangle logic (TL), a formal fuzzy logic that is sound and complete w.r.t. the class of IVRLs.In this paper, we prove that the so-called pseudo-prelinear triangle algebras are subdirect products of pseudo-linear triangle algebras. This can be compared with MTL-algebras (prelinear residuated lattices) being subdirect products of linear residuated lattices.As a consequence, we are able to prove the pseudo-chain completeness of pseudo-linear triangle logic (PTL), an axiomatic extension of TL introduced in this paper. This kind of completeness is the analogue of the chain completeness of monoidal T-norm based logic (MTL).This result also provides a better insight in the structure of triangle algebras; it enables us, amongst others, to prove properties of pseudo-prelinear triangle algebras more easily. It is known that there is a one-to-one correspondence between triangle algebras and couples (L,α), in which L is a residuated lattice and α an element in that residuated lattice. We give a schematic overview of some properties of pseudo-prelinear triangle algebras (and a number of others that can be imposed on a triangle algebra), and the according necessary and sufficient conditions on L and α.     

Filters of residuated lattices and triangle algebras

An important concept in the theory of residuated lattices and other algebraic structures used for formal fuzzy logic, is that of a filter. Filters can be used, amongst others, to define congruence relations. Specific kinds of filters include Boolean filters and prime filters.In this paper, we define several different filters of residuated lattices and triangle algebras and examine their mutual dependencies and connections. Triangle algebras characterize interval-valued residuated lattices.     

剩余格上的模糊软滤子

Molodtsov引入的软集理论,可作为通用的数学工具去处理不确定性问题。给出了剩余格上的模糊软滤子,对它们的性质进行了研究,此外,定义了剩余格上的模糊软滤子间的模糊软同态和模糊软同构,给出了剩余格上的模糊软滤子的同构像定理和同态逆像定理。     

On v-filters and normal v-filters of a residuated lattice with a weak vt-operator

In this paper, we study further the filter theory of residuated lattices. First, we discuss the concepts of filters and normal filters of residuated lattices and propose some equivalent conditions for them. Then we introduce and investigate the notions of v-filter and normal v-filter of a residuated lattice with a weak vt-operator and lay bare the formulas for calculating the v-filters and the normal v-filters generated by subsets. Finally we show that the lattices of v-filters and normal v-filters of a residuated lattice with a vt-operator are both complete Brouwerian lattices.     

剩余格上的几类n-重滤子及其特征

在剩余格上引入了n-重蕴含滤子、n-重MV滤子和n-重布尔滤子,给出它们的一系列刻画定理。通过新的刻画定理得到了这些滤子之间的关系;并且证明了滤子是n-重布尔滤子当且仅当它是n-重蕴含MV滤子。     

Relationships between generalized Bosbach states and <Emphasis Type="Italic">L</Emphasis>-filters on residuated lattices

Generalized Bosbach states and filters on residuated lattices have been extensively studied in the literature. In this paper, relationships between generalized Bosbach states and residuated-lattice-valued filters, also called L-filters, on residuated lattices are investigated. Particularly, type I and type II L-filters and their subclasses are defined, and some their properties are obtained. Then relationships between special types of L-filters and the generalized Bosbach states are considered where generalized Bosbach states are characterized by some type I or type II L-filters with additional conditions. Associated with these relationships, new subclasses of generalized Bosbach states such as implicative type IV, V, VI states, fantastic type IV states and Boolean type IV states are introduced, and the relationships between various types of generalized Bosbach states are investigated in detail. In particular, the existence of several generalized Bosbach states is provided and, as application, some typical subclasses of residuated lattices such as Rl-monoids, Heyting algebras and Boolean algebras are characterized by these generalized Bosbach states.     

Determinization of fuzzy automata with membership values in complete residuated lattices

In this paper we introduce a new method for determinization of fuzzy finite automata with membership values in complete residuated lattices. In comparison with the previous methods, developed by Bělohlávek [R. Bělohlávek, Determinism and fuzzy automata, Information Sciences 143 (2002), 205-209] and Li and Pedrycz [Y.M. Li, W. Pedrycz, Fuzzy finite automata and fuzzy regular expressions with membership values in lattice ordered monoids, Fuzzy Sets and Systems 156 (2005), 68-92], our method always gives a smaller automaton, and in some cases, when the previous methods result in infinite automata, our method can result in a finite one. We also show that determinization of fuzzy automata is closely related to fuzzy right congruences on a free monoid and fuzzy automata associated with them, and in particular, to the concept of the Nerode’s fuzzy right congruence of a fuzzy automaton, which we introduce and study here.     

Factorization of fuzzy concept lattices with hedges by modification of input data

We study the problem of reducing the size of fuzzy concept lattices with hedges by means of factorization. As it has been shown previously for the case of fuzzy concept lattices without hedges, the lattice computed by factorization of a fuzzy concept lattice is isomorphic to a fuzzy concept lattice of some other data table. This means that the factor concept lattice can be computed directly as a concept lattice, whose underlying data table is obtained by a modification of the original data table. There are two known types of such a modification: first, based on factorization of residuated lattices, and second, based on computation of shifted attributes. In this paper, we extend these results to a more general case of concept lattices with hedges.     

Filter theory of BL algebras

In this paper we consider fundamental properties of some types of filters (Boolean, positive implicative, implicative and fantastic filters) of BL algebras defined in Haveshki et al. (Soft Comput 10:657–664, 2006) and Turunen (Arch Math Logic 40:467–473, 2001). It is proved in Haveshki et al. (2006) that if F is a maximal and (positive) implicative filter then it is a Boolean filter. In that paper there is an open problem Under what condition are Boolean filters positive implicative filters? One of our results gives an answer to the problem, that is, we need no more conditions. Moreover, we give simple characterizations of those filters by an identity form ? x, y(t(x, y) ∈ F), where t(x, y) is a term containing x, y.      

BL-代数的弱（相对）零化子

基于格的相对零化子概念提出了[BL-]代数的弱相对零化子概念。讨论了弱相对零化子的基本性质,证明了弱相对零化子是[BL-]代数的滤子,给出了弱相对零化子的表示定理。进一步提出了弱零化子概念,给出了零化子等价于弱零化子的充要条件,刻画了[BL-]代数全体滤子集的结构。结论为今后研究[BL-]代数的弱广义相对零化子提供了基础。     

Basic fuzzy logic and BL-algebras

 The many-valued propositional logic BL (basic fuzzy logic) is investigated. It is known to be complete for tautologies over BL-algebras (particular residuated lattices). Each continuous t-norm on [0,1] determines a BL-algebra; such algebras are called t-algebras. Two additional axioms B1, B2 are found such that BL+(B1,B2) is complete for tautologies over t-algebras. It remains open whether B1, B2 are provable in BL.