BCI—代数的KI并代数

本文引入ＢＣＩ－代数的ＫＩ并代数，它是ＢＣＫ－代数的无交并的推广。     

正定关联BCI—代数

本文是作者［１］和［２］的继续，引入了正定关联ＢＣＩ－代数的概念，并证明了：正定关联ＧＢＣＫ－代数类和Ｐ－半单ＢＣＩ－代数类是正定关联ＢＣＩ－代数类的真子类。     

广义a-结合BCI-代数

引入了广义ａ－结合ＢＣＩ－代数的概念，研究了ＢＣＩ－代数的ｐ－半单部分与广义ａ－结合部分的关系．并将ｐ－半单ＢＣＩ－代数的若干重要性质推广到广义ａ－结合ＢＣＩ－代数上．最后我们证明了每个广义ａ－结合ＢＣＩ－代数可确定一个交换偏序幺半群．本文结果表明文［１］的正则ＢＣＩ－代数与ｐ－半单ＢＣＩ－代数是一致的．     

广义α—结合BCI—代数

引入了广义α－结合ＢＣＩ－代数的概念，研究了ＢＣＩ－代数的ｐ－半单部分与广义α－结合部分的关系。并将ｐ－半单ＢＣＩ－代数的若干重要性质推广到广义α－结合ＢＣＩ－代数上。最后我们证明了每个广义α－结合ＢＣＩ－代数可确定一个交换偏序幺半群。本文结果表明文［１］的正则ＢＣＩ－代数与ｐ－半单ＢＣＩ－代数是一致的。     

关于单BCI－代数的一些结果

本文讨论了单ＢＣＩ－代数．证明了一个ＢＣＩ－代数是单的当且仅当它的子代数都是单的；给出了单ｐ－半单ＢＣＩ－代数的一种表示式；证明了一个ｐ－半单ＢＣＩ－代数是单的当且仅当它的阶是素数；这样得到了一批（无限多个）单ＢＣＩ－代数；证明了商ＢＣＫ－代数Ｘ／Ａ是单的当且仅当Ａ是Ｘ的极大理想．     

双模问题rad~t(-,-)与拟遗传代数

设 Ｂ是 Ｋｒｕｌｌ－ｓｃｈｍｉｄｔ范畴 Ｋ上的一个上三角双模，Ｂｒｕｓｔｌｅ和 Ｈｉｌｌｅ证明了Ｂ的矩阵范畴ｍａｔＢ的投射生成子Ｐ的自同态代数的反代数Ａ是拟遗传代数，而且代数Ａ的△－好模范畴与ｍａｔＢ等价．本文把这些结果推广到由Ｃｒａｗｌｅｙ-Ｂｏｅｖｅｙ给出的具有非零导子的双模上，并在此基础上着重讨论了遗传代数 的投射模范畴Ｐｒｏｊ上的双模ｒａｄｔ（－，－），刻画了它所对应的拟遗传代数的Ｇａｂｒｉｅｌ箭图与关系，以及它们的特征模和Ｒｉｎｇｅｌ对偶．     

关于正定关联BCC—代数

首先指出在ＢＣＣ－代数中，下述两个条件并不等价：（１）（ｘ＊ｚ）＊（ｙ＊ｚ）＝（ｚ＊ｙ＿＊ｚ；（２）（ｘ＊ｙ＊ｙ＝ｘ＊ｙ。随后给出由Ｗ．Ａ．Ｄｕｄｅｋ１９９２年定义的正关联ＢＣＣ－代数的一个简单的公理系统。     

BCK和BCI—代数的映射

在ＢＣＫ－代数中引进了一个右映射和ＢＣＩ－代数中引进了一个弱左映射，并探讨它们的性质。从而推广了文［１］中大部分结果。主要结果是：如果Ｘ是一个ＢＣＫ－代数，Ｙ是一个正定关联ＢＣＫ－代数，则所有Ｘ到Ｙ的左映射的集合也构成一个正定关联ＢＣＫ－代数。     

BCI—代数的Fuzzy强蕴涵理想

本文引入了ＢＣＩ－代数的强蕴函理想的概念，研究了它的性质，同时讨论了ＢＣＩ－代数中的Ｆｕｚｚｙ关系。     

A11的合成代数的三角分解

设Ａ是有限域上的Ａ１１型的遗传代数，ＹＥ（Ａ）Ｔ和Ｃ（Ａ）分别表示Ａ的Ｒｉｎｇｅｌ－Ｈａｌｌ代数和合成代数，该文证明了Ｃ（Ａ）＝Ｙ，Ｙ．Ｙ，其中Ｙ和，Ｋ分别表示由预投射模和预内射模生成的子代数，Ｙ是由Ｃ（Ａ）中的正则元素生成的代数。     

The Semigroup Characterizations of Positive Implicative BCK—algebras

§１．　ＩｎｔｒｏｄｕｃｔｉｏｎＢｙａＢＣＩ－ａｌｇｅｂｒａｗｅｍｅａｎａｎａｌｇｅｂｒａ（Ｘ，，０）ｏｆｔｙｐｅ（２，０）ｗｉｔｈｔｈｅｆｏｌｌｏｗｉｎｇｃｏｎｄｉ－ｔｉｏｎｓ：（１）（（ｘｙ）（ｘｚ））（ｚｙ）＝０；（２）（ｘ（ｘｙ））ｙ＝０；（３）ｘｘ＝０；（４）ｘｙ＝ｙｘ＝０ｉｍｐｌｉｅｓｘ＝ｙ．ＩｆａＢＣＩ－ａｌｇｅｂｒａ（Ｘ，，０）ｓａｔｉｓｆｉｅｓ（５）０ｘ＝０．ｔｈｅｎｉｔｉｓｃａｌｌｅｄａＢＣＫ－ａｌｇｅｂｒａ．ＩｎａＢＣＩ－ａｌｇｅｂｒａ，ｔｈｅｆ…     

赋范BCK-代数与模糊BCK-代数

在BCK－代数中引入范数的概念,给出赋范BCK－代数中的一些基本结果,讨论了有界赋范BCK－代数与模糊BCK－代数的一些联系。     

关于BCK代数的模型论性质

This paper is devoted to the study of the logical properties of BCK algebras. For formalized BCK algebra theory T, it is proved that T is preserved under submodels and unions of chains; T is neither complete nor model complete, and hence there exist no built-in Skolem function. Moreover, the ultraproduct BCK algebras and the fuzzy ultraproduct of fuzzy subsets of BCK algebras were proposed by using the concept of ultrafilters with corresponding properties of fuzzy ideals discussed.     

FI代数,BCK代数与关联半群

文献［１］讨论了Ｆｕｚｚｙ蕴涵代数（简称为ＦＩ代数）与ＭＶ代数、格蕴涵代数之间的关系,本文进一步讨论了ＦＩ代数与有界关联ＢＣＫ代数、关联半群的联系,并应用ＦＩ代数方法简化了ＢＣＫ代数中某些定理的证明。     

Equational spectrum of Hilbert varieties

We prove that an equational class of Hilbert algebras cannot be defined by a single equation. In particular Hilbert algebras and implication algebras are not one-based. Also, we use a seminal theorem of Alfred Tarski in equational logic to characterize the set of cardinalities of all finite irredundant bases of the varieties of Hilbert algebras, implication algebras and commutative BCK algebras: all these varieties can be defined by independent bases of n elements, for each n > 1.      

格蕴涵代数与BCK代数的关系

本文给出了有界可换的ＢＣＫ代数的分配性的一些等价条件，指出了格蕴涵代数与有界可换分配的ＢＣＫ代数以及格Ｈ蕴涵代数与有界关联的ＢＣＫ代数之间的对偶关系     

蕴涵代数与BCK代数

系统研究 Fuzzy蕴涵代数与 BCK代数之间的关系 ,给出 MV代数与 BCK代数之间的联系 ,建立正则 FI代数和对合 BCK代数的对偶代数     

Bounded BCK‐algebras and their generated variety

In this paper we prove that the equational class generated by bounded BCK‐algebras is the variety generated by the class of finite simple bounded BCK‐algebras. To obtain these results we prove that every simple algebra in the equational class generated by bounded BCK‐algebras is also a relatively simple bounded BCK‐algebra. Moreover, we show that every simple bounded BCK‐algebra can be embedded into a simple integral commutative bounded residuated lattice. We extend our main results to some richer subreducts of the class of integral commutative bounded residuated lattices and to the involutive case. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Negation and BCK‐algebras

In this paper we consider twelve classical laws of negation and study their relations in the context of BCK‐algebras. A classification of the laws of negation is established and some characterizations are obtained. For example, using the concept of translation we obtain some characterizations of Hilbert algebras and commutative BCK‐algebras with minimum. As a consequence we obtain a theorem relating those algebras to Boolean algebras.     

Glivenko like theorems in natural expansions of BCK‐logic

The classical Glivenko theorem asserts that a propositional formula admits a classical proof if and only if its double negation admits an intuitionistic proof. By a natural expansion of the BCK‐logic with negation we understand an algebraizable logic whose language is an expansion of the language of BCK‐logic with negation by a family of connectives implicitly defined by equations and compatible with BCK‐congruences. Many of the logics in the current literature are natural expansions of BCK‐logic with negation. The validity of the analogous of Glivenko theorem in these logics is equivalent to the validity of a simple one‐variable formula in the language of BCK‐logic with negation. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)