可换逻辑的代数语义综述

主要介绍九种可换逻辑的语义系统,它们是布尔代数,MV-代数,BL-代数,MTL-代数,剩余格,Hoops,半Hoops,EQ-代数和相等代数,并给出相应的例子.进而结合作者的工作介绍了这些代数系统在概率、格序群和拓扑中的研究进展,同时给出如下看法:布尔代数是经典逻辑;从代数角度讨论了经典逻辑与模糊逻辑的区别.最后给出值...     

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

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

基于剩余格理论的P-有界分配格的理想集代数

讨论P-有界分配格的理想集代数与剩余格的关系.证明了在适当选取蕴涵算子及相应的剩余算子之后,P-有界分配格的理想集代数就成为剩余格.定义了生成理想,并借助格论上的原子定义了P-有界分配格,然后讨论了它的一些性质,得到了一些好的结论.最后证明了P-有界分配格的理想集代数也是MV代数与R0代数.     

GB_n链的主同余性质

Ockham代数是一个代数(L;∧,∨,f,0,1),其中(L;∧,∨,0,1)是有界分配格,f是L上的偶格自同态.GBn代数是指一个Ockham代数(L;f),它满足条件:(fn(L);f)是布尔代数.它包含常见的布尔代数、de Mogan代数和Stone代数.本文研究了GBn链的代数结构,并给出一个GBn链具有主同余性质的充分与必要条件.     

剩余格与FI代数的可嵌入性

给出剩余格可嵌入于全序剩余格的乘积的充要条件。还给出定义在格上的FI代数可嵌入于全序FI代数的乘积的充要条件。     

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

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

特殊类型伪相等代数之间的关系

研究了有界伪相等代数,格伪相等代数,对合伪相等代数,预线性伪相等代数和交换伪相等代数的性质,并且详细地讨论了它们之间的关系。此外,利用伪相等代数和伪剩余格的性质证明了对合伪相等代数和对合伪剩余格是等价的。     

广义模糊幂零矩阵

路代数是加法幂等的半环,它包括了布尔代数,模糊代数,分配格及斜坡.因此布尔矩阵,模糊矩阵,格矩阵及斜矩阵都是路代数上的典型矩阵.广义模糊幂零矩阵指的就是路代数上的幂零矩阵.在2010年,Tan研究了路代数上矩阵的幂零性.在Tan的基础上继续讨论了路代数上幂零矩阵的幂零指数.     

Fuzzy蕴涵代数与MV代数

本文讨论Ｆｕｚｚｙ蕴涵代数与ＭＶ代数之间的关系，并证明了在一定的条件下Ｆｕｚｚｙ蕴函代数是剩余格。     

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

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

布尔代数的Fuzzy子代数和Fuzzy理想

引入了布尔代数的Fuzzy子代数、Fuzzy理想和Fuzzy商布尔代数的概念,给出了布尔代数的Fuzzy集是Fuzzy子代数(Fuzzy理想)的充要条件,讨论了布尔代数的Fuzzy子代数(Fuzzy理想)在布尔代数同态下的像和逆像,得到了布尔代数的Fuzzy子代数的同态基本定理。     

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.     

Generalized Bosbach and Riečan states on nucleus-based-Glivenko residuated lattices

Bosbach and Rie?an states on residuated lattices both are generalizations of probability measures on Boolean algebras. Just from the observation that both of them can be defined by using the canonical structure of the standard MV-algebra on the unit interval [0, 1], generalized Rie?an states and two types of generalized Bosbach states on residuated lattices were recently introduced by Georgescu and Mure?an through replacing the standard MV-algebra with arbitrary residuated lattices as codomains. In the present paper, the Glivenko theorem is first extended to residuated lattices with a nucleus, which gives several necessary and sufficient conditions for the underlying nucleus to be a residuated lattice homomorphism. Then it is proved that every generalized Bosbach state (of type I, or of type II) compatible with the nucleus on a nucleus-based-Glivenko residuated lattice is uniquely determined by its restriction on the nucleus image of the underlying residuated lattice, and every relatively generalized Rie?an state compatible with the double relative negation on an arbitrary residuated lattice is uniquely determined by its restriction on the double relative negation image of the residuated lattice. Our results indicate that many-valued probability theory compatible with nuclei on residuated lattices reduces in essence to probability theory on algebras of fixpoints of the underlying nuclei.     

Generalizations of Boolean products for lattice-ordered algebras

It is shown that the Boolean center of complemented elements in a bounded integral residuated lattice characterizes direct decompositions. Generalizing both Boolean products and poset sums of residuated lattices, the concepts of poset product, Priestley product and Esakia product of algebras are defined and used to prove decomposition theorems for various ordered algebras. In particular, we show that FL_w-algebras decompose as a poset product over any finite set of join irreducible strongly central elements, and that bounded n-potent GBL-algebras are represented as Esakia products of simple n-potent MV-algebras.     

LFI代数的性质及其与剩余格的关系

讨论LFI代数的性质．也讨论具有可嵌入性的LFI代数的性质；还给出了定义在完备格上的LFI代数成为剩余格的充要条件。     

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.     

Join-semilattices whose sections are residuated PO-monoids

We generalize the concept of an integral residuated lattice to join-semilattices with an upper bound where every principal order-filter (section) is a residuated semilattice; such a structure is called a sectionally residuated semilattice. Natural examples come from propositional logic. For instance, implication algebras (also known as Tarski algebras), which are the algebraic models of the implication fragment of the classical logic, are sectionally residuated semilattices such that every section is even a Boolean algebra. A similar situation rises in case of the Lukasiewicz multiple-valued logic where sections are bounded commutative BCK-algebras, hence MV-algebras. Likewise, every integral residuated (semi)lattice is sectionally residuated in a natural way. We show that sectionally residuated semilattices can be axiomatized as algebras (A, r, →, ⇝, 1) of type 〈3, 2, 2, 0〉 where (A, →, ⇝, 1) is a {→, ⇝, 1}-subreduct of an integral residuated lattice. We prove that every sectionally residuated lattice can be isomorphically embedded into a residuated lattice in which the ternary operation r is given by r(x, y, z) = (x · y) ∨ z. Finally, we describe mutual connections between involutive sectionally residuated semilattices and certain biresiduation algebras. This work was supported by the Czech Government via the project MSM6198959214.