We explore properties of the set of d-units of a d-algebra. A property of interest in the study of d-units in d-algebras is the weak associative property. It is noted that many other d-algebras, especially BCK-algebras, are in fact weakly associative. The existence of d/BCK-algebras which are not weakly associative is demonstrated. Moreover, the notions of a d-integral domain and a left-injecti...

In this note, we study the lattice structure on the class of all weak hyper K-ideals of a hyper K-algebra. We first introduce the notion of (left,right) scalar in a hyper K-algebra which help us to characterize the weak hyper K-ideals generated by a subset. In the sequel, using the notion of a closure operator, we study the lattice of all weak hyper K-ideals of ahyper K-algebra, and we prove a ...

In this paper rst we dene the notions of positive implicativehyper MV -ideals of types 1,2,3 and 4 in hyper MV -algebras and we investigatethe relationship between of them . Then by some examples we show that thesenotions are not equivalent. Finally we give some relations between these notionsand the notions of (weak) hyper MV -ideals and (weak) hyper MV -deductivesystems of hyper MV -algebras.

We consider the fuzzification of the notion of a positive implicative ordered filter in implicative semigroups. We show that every fuzzy positive implicative ordered filter is both a fuzzy ordered filter and a fuzzy implicative ordered filter. We give examples that a fuzzy (implicative) ordered filter may not be a fuzzy positive implicative ordered filter. We also state equivalent conditions of...

BCK-modules were introduced as an action of a BCK-algebra over Abelian group. Homomorphisms form exact sequence which is called BCK-sequence. In this paper, we study homomorphisms BCK-modules. We show that have module structure. Moreover, sequences Hom functors are BCK-sequences.

In this work, we show that single input single output (SISO) fuzzy inference systems based on Fuzzy Relational Inference (FRI) with implicative interpretation of the rule base are universal approximators under suitable choice of operations for the other components of the fuzzy system. The presented proofs make no assumption on the form or representations of the considered fuzzy implications and...

Cantor's naive set theory is characterized by the unrestricted comprehension principle, saying that for every formula A(x), there exists a set {x|A(x)} such that A(t) ↔ t ∈ {x|A(x)} for any term t. The theory is intuitive, elegant, powerful, but unfortunately inconsistent (as witnessed by Russell's paradox). While it is common to somehow restrict the comprehension scheme (as in ZFC), there is a...