In this paper, we interrelate the intuitionistic fuzzification of the concept of BCI-(positive implicative, implicative, commutative) ideals in BCI-algebras and investigate some of their properties.

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, ...

Implicative verbs (e.g. manage) entail their complement clauses, while non-implicative verbs (e.g. want) do not. For example, while managing to solve the problem entails solving the problem, no such inference follows from wanting to solve the problem. Differentiating between implicative and non-implicative verbs is therefore an essential component of natural language understanding, relevant to ...

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, we introduce the notion of bi-Smarandache BL-algebra, bi-weak Smarandache BL-algebra, bi-Q-Smarandache ideal and bi-Q-Smarandache implicative filter, we obtain some related results and construct quotient of bi-Smarandache BL-algebras via MV-algebras (or briefly bi-Smarandache quotient BL-algebra) and prove some theorems. Finally, the notion of bi-strong Smarandache BL-algebra is ...

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

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...

Molodtsov's soft set theory provides a general mathematical framework for dealing with uncertainty. The concepts of (M, N)-SI implicative (Boolean) filters of BL-algebras are introduced. Some good examples are explored. The relationships between (M, N)-SI filters and (M, N)-SI implicative filters are discussed. Some properties of (M, N)-SI implicative (Boolean) filters are investigated. In part...

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...