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

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

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

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

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.     

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.     

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

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

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

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

Some Properties of Residuated Lattices

We investigate some (universal algebraic) properties of residuated lattices--algebras which play the role of structures of truth values of various systems of fuzzy logic.     

Abelian Logic and the Logics of Pointed Lattice-Ordered Varieties

We consider the class of pointed varieties of algebras having a lattice term reduct and we show that each such variety gives rise in a natural way, and according to a regular pattern, to at least three interesting logics. Although the mentioned class includes several logically and algebraically significant examples (e.g. Boolean algebras, MV algebras, Boolean algebras with operators, residuated lattices and their subvarieties, algebras from quantum logic or from depth relevant logic), we consider here in greater detail Abelian ℓ-groups, where such logics respectively correspond to: i) Meyer and Slaney’s Abelian logic [31]; ii) Galli et al.’s logic of equilibrium [21]; iii) a new logic of “preservation of truth degrees”. This paper was written while the second author was a Visiting Professor in the Department of Education at the University of Cagliari. The facilities and assistance provided by the University and by the Department are gratefully acknowledged.     

模糊概念格与模糊推理

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

Tableau method for residuated logic

Residuated logic is a generalization of intuitionistic logic, which does not assume the idempotence of the conjunction operator. Such generalized conjunction operators have proved important in expert systems (in the area of Approximate Reasoning) and in some areas of Theoretical Computer Science. Here we generalize the intuitionistic tableau procedure and prove that this generalized tableau method is sound for the semantics (the class of residuated algebras) of residuated propositional calculus (RPC). Since the axioms of RPC are complete for the semantics we may conclude that whenever a formula 0 is tableau provable, it is deducible in RPC. We present two different approaches for constructing residuated algebras which give us countermodels for some formulas φ which are not tableau provable. The first uses the fact that the theory of residuated algebras is equational, to construct quotients of free algebras. The second uses finite algebras. We end by discussing a number of open questions.     

Birkhoff variety theorem and fuzzy logic

An algebra with fuzzy equality is a set with operations on it that is equipped with similarity , i.e. a fuzzy equivalence relation, such that each operation f is compatible with . Described verbally, compatibility says that each f yields similar results if applied to pairwise similar arguments. On the one hand, algebras with fuzzy equalities are structures for the equational fragment of fuzzy logic. On the other hand, they are the formal counterpart to the intuitive idea of having functions that are not allowed to map similar objects to dissimilar ones. In this paper, we present a generalization of the well-known Birkhoffs variety theorem: a class of algebras with fuzzy equality is the class of all models of a fuzzy set of identities iff it is closed under suitably defined morphisms, substructures, and direct products. and Institute for Fuzzy Modeling, University of Ostrava, 30. dubna 22, 701 03 Ostrava, Czech Republic Mathematics Subject Classification (2000):03B52, 08B05     

Monadic Bounded Commutative Residuated ℓ-monoids

Bounded commutative residuated ℓ-monoids are a generalization of algebras of propositional logics such as BL-algebras, i.e. algebraic counterparts of the basic fuzzy logic (and hence consequently MV-algebras, i.e. algebras of the Łukasiewicz infinite valued logic) and Heyting algebras, i.e. algebras of the intuitionistic logic. Monadic MV-algebras are an algebraic model of the predicate calculus of the Łukasiewicz infinite valued logic in which only a single individual variable occurs. We introduce and study monadic residuated ℓ-monoids as a generalization of monadic MV-algebras. Jiří Rachůnek was supported by the Council of Czech Goverment MSM 6198959214.     

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.     

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.     

Canonical extensions of double quasioperator algebras: An algebraic perspective on duality for certain algebras with binary operations

The context for this paper is a class of distributive lattice expansions, called double quasioperator algebras (DQAs). The distinctive feature of these algebras is that their operations preserve or reverse both join and meet in each coordinate. Algebras of this type provide algebraic semantics for certain non-classical propositional logics. In particular, MV-algebras, which model the ?ukasiewicz infinite-valued logic, are DQAs.Varieties of DQAs are here studied through their canonical extensions. A variety of this type having additional operations of arity at least 2 may fail to be canonical; it is already known, for example, that the variety of MV-algebras is not. Non-canonicity occurs when basic operations have two distinct canonical extensions and both are necessary to capture the structure of the original algebra. This obstruction to canonicity is different in nature from that customarily found in other settings. A generalized notion of canonicity is introduced which is shown to circumvent the problem. In addition, generalized canonicity allows one to capture on the canonical extensions of DQAs the algebraic operations in such a way that the laws that these obey may be translated into first-order conditions on suitable frames. This correspondence may be seen as the algebraic component of duality, in a way which is made precise.In many cases of interest, binary residuated operations are present. An operation h which, coordinatewise, preserves ∨ and 0 lifts to an operation which is residuated, even when h is not. If h also preserves binary meet then the upper adjoints behave in a functional way on the frames.     

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.     

Densification of FL chains via residuated frames

We introduce a systematic method for densification, i.e., embedding a given chain into a dense one preserving certain identities, in the framework of FL algebras (pointed residuated lattices). Our method, based on residuated frames, offers a uniform proof for many of the known densification and standard completeness results in the literature. We propose a syntactic criterion for densification, called semianchoredness. We then prove that the semilinear varieties of integral FL algebras defined by semi-anchored equations admit densification, so that the corresponding fuzzy logics are standard complete. Our method also applies to (possibly non-integral) commutative FL chains. We prove that the semilinear varieties of commutative FL algebras defined by knotted axioms \({x^{m} \leq x^{n}}\) (with \({m, n > 1}\)) admit densification. This provides a purely algebraic proof to the standard completeness of uninorm logic as well as its extensions by knotted axioms.     

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

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

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.     

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.