We consider the fuzzification of the notion of implicative hyper BCK-ideals, and then investigate several properties. Using the concept of level subsets, we give a characterization of a fuzzy implicative hyper BCK-ideal. We state a relation between a fuzzy hyper BCK-ideal and a fuzzy implicative hyper BCK-ideal. We establish a condition for a fuzzy hyper BCK-ideal to be a fuzzy implicative hype...

This paper presents two classes of propositional logics (understood as a consequence relation). First we generalize the well-known class of implicative logics of Rasiowa and introduce the class of weakly implicative logics. This class is broad enough to contain many “usual” logics, yet easily manageable with nice logical properties. Then we introduce its subclass— the class of weakly implicativ...

The aim of this paper is to introduce the notion of (∈,∈∨ q)-fuzzy (implicative, MV and G-) filters of pseudo-BL algebras and to investigate some of their related properties. Some characterization theorems of these generalized fuzzy (implicative) filters are derived. The relationship among these generalized fuzzy filters of pseudo-BL algebras is considered. It is proved that an (∈,∈ ∨q)-fuzzy f...

In this paper, by using the concept of belongingness (∈) and quasi-coincidence (q) between fuzzy points and fuzzy sets, we introduce (α, β)-fuzzy positive implicative ideals in BCK-algebras where α, β are any of {∈, q, ∈ ˅ q, ∈ ˄ q} with α ≠ ∈ ˄ q.

This paper complements a series of works on implicative verbs such as manage to and fail to. It extends the description of simple implicative verbs to phrasal implicatives as take the time to and waste the chance to. It shows that the implicative signatures of verb-noun collocations depend both on the semantic type of the verb and the semantic type of the noun in a systematic way.

In this paper, we introduce the concepts of right, left and product stabilizers on hoops and study some properties and the relation between them.  And we try to find that how they can be equal and investigate that under what condition they can be filter, implicative filter, fantastic and positive implicative filter. Also, we prove that  right and product stabilizers are filters and if they are ...

In this note first we define a BCK‐algebra on the states of a deterministic finite automaton. Then we show that it is a BCK‐algebra with condition (S) and also it is a positive implicative BCK‐algebra. Then we find some quotient BCK‐algebras of it. After that we introduce a hyper BCK‐algebra on the set of all equivalence classes of an equivalence relation on the states of a deterministic finite...