The notion of ∈-soft set and q-soft set based on a fuzzy set is introduced, and characterizations for an ∈-soft set and a q-soft set to be (idealistic) soft BCK/BCIalgebras are provided. Using the notion of (∈,∈∨ q)-fuzzy BCK/BCI subalgebras/ideals, characterizations for an ∈-soft set and a q-soft set to be (idealistic) soft BCK/BCI-algebras are established. AMS subject classifications: 06D72, ...

The foldness of PI( , ⊆, ⊆)BCK -ideals and PI( , , )BCK -ideals is considered. The fuzzy version of such notions is also discussed.

Characterizations of fuzzy ideals of a pseudo-BCK algebra are established. Conditions for a fuzzy set to be a fuzzy ideal are given. Given a fuzzy set μ, the least fuzzy ideal containing μ is constructed. The homomorphic properties of fuzzy ideals of a pseudoBCK algebra are provided. Finally, characterizations of Noetherian pseudo-BCK algebras and Artinian pseudo-BCK algebras via fuzzy ideals a...

In this paper the notion of fuzzy dot BCK-subalgebra is introduced. We state and prove some theorem in fuzzy dot BCK-subalgebra and level subalgebras. Mathematics Subject Classification: 06F35, 03G25, 94D05

This paper deals with some properties of n-fold commutative ideals and n-fold weak commutative ideals in BCK-algebras. Afterwards, we construct some algorithms for studying foldness theory of commutative ideals in BCK-algebras.

We associate to any game G, in the sense of Set Theory, a variant of it we call bck(G). We show through examples that many relevant non-constructive proofs in Algebra and Combinatorics can be interpreted by recursive winning strategy over some game of the form bck(G). We further support this claim by proving that games of the form bck(G) are a sound and complete semantic for a sub-classical log...

We investigate quantitative properties of BCI and BCK logics. The first part of the paper compares the number of formulas provable in BCI versus BCK logics. We consider formulas built on implication and a fixed set of k variables. We investigate the proportion between the number of such formulas of a given length n provable in BCI logic against the number of formulas of length n provable in ric...

The study of BCK-algebras was initiated by Iséki [7] as a generalization of the concept of set-theoretic difference and propositional calculus. Iséki posed an interesting problem; whether the class of BCK-algebras is a variety. In connection with this problem Komori introduced in [9] a notion of BCC-algebra which is a generalization of a BCK-algebra and proved that the class of all BCC-algebras...

Y. Imai and K. Iseki introduced BCK-algebras in 1966, through the paper [Im, Is; 66], as a generalization of the concept of set-theoretic difference and propositional calculi. This class of BCK-algebras is a proper subclass of the class of BCI-algebras and has many applications to various domains of mathematics. One of the recent applications of BCK-algebras was given in the Coding Theory. In t...

A normal pseudo-BCK-algebra X is an algebra in which every subalgebra of X is an ideal of X . Characterizations of normal pseudo-BCK-algebras are given. 2010 Mathematics Subject Classification: 03G25, 06F35.