VERY TRUE PSEUDO-BCK ALGEBRAS by Ioan Degău

VERY TRUE PSEUDO-BCK ALGEBRAS

arXiv:1802.06210v1 [math.LO] 17 Feb 2018

LAVINIA CORINA CIUNGU Abstract. In this paper we introduce the very true operators on pseudo-BCK algebras and we study their properties. We prove that the composition of two very true operators is a very true operator if and only if they commute. Moreover, given a very true bounded pseudo-BCK algebra (A, v), we define the pseudo-BCKvt,st algebra by adding two truth-depressing hedges operators associated with v. We also define the very true deductive systems and the very true homomorphisms and we investigate their properties. Also, given a normal v-deductive system of a very true pseudo-BCK algebra (A, v) we construct a very true operator on the quotient pseudo-BCK algebra A/H. We investigate the very true operators on some classes of pseudo-BCK algebras such as pseudo-BCK(pP) algebras, FLw -algebras, pseudo-MTL algebras. Finally, we define the Q-Smarandache pseudo-BCK algebras and we introduce the notion of a very true operator on Q-Smarandache pseudo-BCK algebras.

Keywords: Very true pseudo-BCK algebra, very true pseudo-MTL algebra, interior operator, very true deductive system, very true homomorphism, truth-depressing hedge, Smarandache pseudo-BCK algebra AMS Mathematics Subject Classification (2010): 06D35, 06F05, 03F50

1. Introduction Zadeh was the first to consider the importance of fuzzy truth values as ”very true”, ”quite true”, etc., that are in fact fuzzy subsets of all truth degrees (usually, the real interval [0, 1]). He was interested in methods of handling these fuzzy truth values, but without considering any sort of axiomatization. However, an interesting logic problem will be to study if any axiomatization is possible and which methods of mathematical logic could be developed to treat this kind of fuzzy logic. H´ajek introduced in [11] a complete axiomatization of a logic which extends BL-logic by a unary connective ”vt” which can be interpreted as ”very true”. Such a connective is a subdiagonal and monotone operator defined on the set of truth degrees. Subdiagonality ”v(x) ≤ x” for each truth degree x means that each interpretation v of vt is truth-stressing. The concept of very true operator defined by H´ajek is in fact the same as the concept of hedge introduced by Zadeh in [30] and [31] (see also [3]) and it is a tool for reducing the number of possible logical values in multiple-valued fuzzy logic. This tool was used by Bˇelohl´ avek and Vychodil for reducing the size of fuzzy concept lattices ([1]). In this context we mention that an axiomatization of connectives ”slightly” and ”more or less true” extending the propositional BL-logic have been defined by Vychodil in [27] as a superdiagonal and monotone truth operator called ”truth-depressing hedge”. A weaker axiomatization over any core fuzzy logic for both the truth-stressing and truth-depressing connectives, including standard 1

VERY TRUE PSEUDO-BCK ALGEBRAS

completeness results was presented in [8]. Recently, in [16] two axiomatizations were introduced over any propositional core fuzzy logic for multiple truth-stressing and truth-depressing hedges. The notion of a very true operator was extended to other fuzzy logic algebras such as MV-algebras ([17]), effect algebras ([4]), Rℓ-monoids ([21]), MTL-algebras ([28]), residuated lattices ([18],[19]) and equality algebras ([29]). In this paper we introduce the very true operators on pseudo-BCK algebras and we study their properties. We prove that the composition of two very true operators is a very true operator if and only if they commute. It is proved that, if two very true operators have the same image, then the two operators coincide. For a very true bounded pseudo-BCK algebra (A, v), we define the pseudo-BCKvt,st algebra by adding two truth-depressing hedges operators associated with v. Given a very true operator on a good pseudo-BCK algebra A satisfying Glivenko property we define very true operators on Reg (A) and A/Den (A). It is also proved that the composition of a pseudo-valuation with a very true operator is a pseudo-valuation as well. We define the very true deductive systems of a very true pseudo-BCK algebra (A, v) and we prove that the congruences of (A, v) coincide with the congruences of A. We also introduce the notion of a very true homomorphism and we investigate their properties. Given a normal v-deductive system of a very true pseudo-BCK algebra (A, v) we construct a very true operator on the quotient pseudo-BCK algebra A/H. We investigate the very true operators on some classes of pseudo-BCK algebras such as pseudo-BCK(pP) algebras, FLw -algebras, pseudo-MTL algebras. We define the Q-Smarandache pseudo-BCK algebras and we introduce the notion of a very true operator on Q-Smarandache pseudo-BCK algebras. Given a QSmarandache pseudo-BCK algebra A and a very true operator v on A, we prove that the restriction of v to Q is a very true operator on Q. Additionally we define and investigate the interior operators on pseudo-BCK algebras. For any interior operator on a good pseudoBCK algebra A satisfying Glivenko property we construct interior operators on Reg (A) and A/Den (A).

2. Preliminaries Pseudo-BCK algebras were introduced by G. Georgescu and A. Iorgulescu in [10] as algebras with ”two differences”, a left- and right-difference, and with a constant element 0 as the least element. Nowadays pseudo-BCK algebras are used in a dual form, with two implications, → and and with one constant element 1, that is the greatest element. Thus such pseudo-BCK algebras are in the ”negative cone” and are also called ”left-ones”. Pseudo-BCK algebras were intensively studied in [12], [15], [14], [6]. In this section we recall some basic notions and results regarding pseudo-BCK algebras. Definition 2.1. ([10]) A pseudo-BCK algebra (more precisely, reversed left-pseudo-BCK algebra) is a structure A = (A, ≤, →, , 1) where ≤ is a binary relation on A, → and are binary operations on A and 1 is an element of A satisfying, for all x, y, z ∈ A, the axioms: (psBCK1 ) x → y ≤ (y → z) (x → z), x y ≤ (y z) → (x z); (psBCK2 ) x ≤ (x → y) y, x ≤ (x y) → y; (psBCK3 ) x ≤ x; (psBCK4 ) x ≤ 1;

VERY TRUE PSEUDO-BCK ALGEBRAS

(psBCK5 ) if x ≤ y and y ≤ x, then x = y; (psBCK6 ) x ≤ y iff x → y = 1 iff x y = 1. A pseudo-BCK algebra is said to be proper if it is not a BCK-algebra. In a pseudo-BCK algebra (A, →, , 1), one can define a binary relation “ ≤ ” by x ≤ y iff x → y = 1 iff x y = 1, for all x, y ∈ A. If (A, →, , 1) is a pseudo-BCK algebra satisfying x → y = x y, for all x, y ∈ A, then it is a BCK-algebra. If there is an element 0 of a pseudo-BCK algebra (A, →, , 1), such that 0 ≤ x (i.e. 0 → x=0 x = 1), for all x ∈ A, then the pseudo-BCK algebra is said to be bounded and it is denoted by (A, →, , 0, 1). In a bounded pseudo-BCK algebra (A, →, , 0, 1) we define two negations: x− := x → 0, x∼ := x 0, −∼ for all x ∈ A. Obviously x = x ∨1 0 and x∼− = x ∨2 0. If (A, →, , 0, 1) is a bounded pseudo-BCK algebra we denote: Reg (A) = {x ∈ A | x−∼ = x∼− = x}, the set of all regular elements of A, Den (A) = {x ∈ A | x−∼ = x∼− = 1}, the set of all dense elements of A. If Reg (A) = A, then A is said to be involutive. If a bounded pseudo-BCK algebra A satisfies x−∼ = x∼− for all x ∈ A, then A is called a good pseudo-BCK algebra. Obviously, if A is involutive, then A is good and Den (A) = {1}. We will refer to (A, →, , 1) by its universe A. Lemma 2.2. ([10]) Let (A, →, , 1) be a pseudo-BCK algebra. Then the following hold for all x, y, z ∈ A: (1) x → (y z) = y (x → z); (2) x ≤ y implies y → z ≤ x → z and y z≤x z; (3) x ≤ y implies z → x ≤ z → y and z x≤z y; (4) x → y ≤ (z → x) → (z → y) and x y ≤ (z x) (z y). Proposition 2.3. ([10]) Let (A, →, , 0, 1) be a bounded pseudo-BCK algebra. Then the following hold for all x, y ∈ A : (1) x ≤ x−∼ , x ≤ x∼− ; (2) x → y ∼ = y x− and x y − = y → x∼ ; ∼ −∼ − ∼− (3) x → y =y x and x− y ∼− = y ∼ → x−∼ ; (4) x ≤ y implies y − ≤ x− , y ∼ ≤ x∼ , x−∼ ≤ y −∼ and x∼− ≤ y ∼− ; (5) x−∼− = x− and x∼−∼ = x∼ ; (6) x → y −∼ = y − x− = x−∼ → y −∼ and x y ∼− = y ∼ → x∼ = x∼− y ∼− ; ∼ ∼− − −∼ ∼ − −∼ ∼ ∼− − (7) x → y = y x =x → y and x y =y →x =x y ; ∼− ∼− ∼− −∼ −∼ −∼ (8) (x → y ) =x→y and (x y ) =x y ; (9) x → y ≤ y − x− and x y ≤ y ∼ → x∼ . Remark 2.4. Pseudo BCK-logic was defined by J. K¨ uhr ([15, Definition 1.3.1]). Formulas of pseudo BCK-logic are built from propositional variables and the primitive connectives → and . The axioms are the following formulas: (B1 ) (ϕ → ψ) → ((ψ → ϑ) (ϕ → ϑ)), (B2 ) (ϕ ψ) → ((ψ ϑ) → (ϕ ϑ)), (C1 ) (ϕ → (ψ ϑ)) → (ψ (ϕ → ϑ)),

VERY TRUE PSEUDO-BCK ALGEBRAS

(C2 ) (ϕ (ψ → ϑ)) → (ψ → (ϕ ϑ)), (K1 ) ϕ → (ψ → ϕ), (K2 ) ϕ (ψ ϕ). The inference rules are the following: , i.e. from ϕ and ϕ → ψ we infer ψ, (M P ) ϕ,ϕ→ψ ψ (IM P1 ) (IM P2 )

ϕ→ψ ϕ ψ, ϕ ψ ϕ→ψ ,

i.e. from ϕ → ψ we infer ϕ

ψ,

ψ we infer ϕ → ψ.

i.e. from ϕ

Example 2.5. ([2]) Consider the set A = {a, b, c, 1} and the following tables: → 1 a b c 1 a 1 1 a b c 1 1 a a 1 1 1 1 a 1 1 b 1 a 1 c b 1 c c 1 b 1 1 c 1 c Then (A, →, , 1) is a bounded pseudo-BCK algebra. Example 2.6. ([5]) Consider the structure (A, →, A = {1, a, b, c, d, e} are defined as follows: → 1 a b c d e Then (A, →,

1 1 1 1 1 1 1

a a 1 c a c 1

b b d 1 d b 1

c c 1 1 1 c 1

d d 1 1 d 1 1

e e d c a b 1

1 a b c d e

1 1 1 1 1 1 1

a a 1 d d a 1

operations →, b b 1 1 1

given by the

c c 1 . c 1

, 1), where the operations → and b b c 1 b c 1

c c 1 1 1 c 1

d d 1 1 d 1 1

e e c d b a 1

1 s ★❝ ★ ❝ s ❝s d c ★ ❍ ❍❍✟✟✟ ✟✟❍❍❍s. a s✟ b ❝ ★ ❝ ★ s ❝★

, e, 1) is an involutive pseudo-BCK algebra.

Definition 2.7. A good pseudo-BCK algebra A has the Glivenko properties if it satisfies the following conditions for all x, y ∈ A : (x → y)−∼ = x → y −∼ and (x y)−∼ = x y −∼ . Remark 2.8. Let A, →, , 0, 1) a good pseudo-BCK algebra satisfying Glivenko property. (1) Applying Proposition 2.3(6) we get: (x → y)−∼ = x−∼ → y −∼ and (x y)−∼ = x−∼ y −∼ , for all x, y ∈ A. (2) (Reg (A), →, , 0, 1) is a subalgebra of A. (3) Den (A) ∈ DS n (A). Obviously any involutive pseudo-BCK algebra has the Glivenko property. A subset D of a pseudo-BCK algebra A is called a deductive system of A if it satisfies the following axioms: (ds1 ) 1 ∈ D, (ds2 ) x ∈ D and x → y ∈ D imply y ∈ D. A subset D of A is a deductive system if and only if it satisfies (ds1 ) and the axiom: (ds′2 ) x ∈ D and x y ∈ D imply y ∈ D.

VERY TRUE PSEUDO-BCK ALGEBRAS

Denote by DS(A) the set of all deductive systems of A. A deductive system D of A is proper if D 6= A. A deductive system D of a pseudo-BCK algebra A is said to be normal if it satisfies the condition: (ds3 ) for all x, y ∈ A, x → y ∈ D iff x y ∈ D. Denote by DSn (A) the set of all normal deductive systems of A. For details regarding deductive systems and congruence relations on a pseudo-BCK algebra we refer the reader to [15]. Denote by CON (A) the set of all congruences on A. If θ ∈ CON (A), then Hθ = {x ∈ A | (x, 1) ∈ θ} ∈ DS n (A). Given H ∈ DS n (A), the relation ΘH on A defined by (x, y) ∈ ΘH iff x → y ∈ H and y → x ∈ H is a congruence on A. We write x/H = [x]ΘH for every x ∈ A and we have H = [1]ΘH . Then (A/ΘH , →, , [1]ΘH ) is a pseudo-BCK algebra called quotient pseudo-BCK algebra via H and denoted by A/H. The function πH : A −→ A/H defined by πH (x) = x/H for any x ∈ A is a surjective homomorphism which is called the canonical projection from A to A/H. One can easily prove that Ker (πH ) = H. Let A, B be two pseudo-BCK algebras. A map f : A −→ B is called a pseudo-BCK homomorphism if f (x → y) = f (x) → f (y) and f (x y) = f (x) f (y), for all x, y ∈ A. (We use the same notations for the operations in both pseudo-BCK algebras, but the reader must be aware that they are different). If B = A, then f is called a pseudo-BCK endomorphism. Denote HOM(A, B) the sets of all pseudo-BCK homomorphisms from A to B. One can easily check that, if f is a pseudo-BCK homomorphism, then: (1) f (1) = 1; (2) x ≤ y implies f (x) ≤ f (y). If f is a bounded pseudo-BCK homomorphism such that f (0) = 0, then the following hold: (3) f (x− ) = f (x)− ; (4) f (x∼ ) = f (x)∼ . A pseudo-BCK algebra with the (pP) condition (i.e. with the pseudo-product condition) or a pseudo-BCK(pP) algebra for short, is a pseudo-BCK algebra (A, ≤, →, , 1) satisfying the (pP) condition: (pP) For all x, y ∈ A, x ⊙ y exists where x ⊙ y = min{z | x ≤ y → z} = min{z | y ≤ x z}. Any involutive pseudo-BCK algebra is a bounded pseudo-BCK(pP) algebra ([12]). A residuated lattice is an algebra (A, ∧, ∨, ⊙, →, , 1) satisfying the following axioms: (rl1 ) (A, ∧, ∨) is a lattice; (rl2 ) (A, ⊙, 1) is a monoid; (rl3 ) x ⊙ y ≤ z iff x ≤ y → z iff y ≤ x z, for all x, y, z ∈ A (pseudo-residuation). A bounded residuated lattice (A, ∧, ∨, ⊙, →, , 0, 1) is called an FLw -algebra or bounded integral residuated lattice. Bounded pseudo-BCK(pP) lattices are categorically isomorphic with FLw -algebras. A FLw -algebra (A, ∧, ∨, ⊙, →, , 0, 1) satisfying the pseudo-prelinearity condition: (x → y) ∨ (y → x) = (x y) ∨ (y x) = 1, for all x, y ∈ is called a pseudo-MTL algebra. A FLw -algebra (A, ∧, ∨, ⊙, →, , 0, 1) satisfying the pseudo-divisibility condition: (x → y) ⊙ x = x ⊙ (x y) = x ∧ y,

VERY TRUE PSEUDO-BCK ALGEBRAS

for all x, y ∈ is called a bounded Rℓ-monoid or a divisible residuated lattice. If a FLw -algebra (A, ∧, ∨, ⊙, →, , 0, 1) satisfies the pseudo-prelinearity and pseudo-divisibility conditions, then it is called a pseudo-BL algebra. An involutive pseudo-BL algebra is a pseudoMV algebra ([12]). A FLw -algebra A is a pseudo-MV algebra if and only if it satisfies the identities: x ∨ y = (x → y) y = (x y) → y, for all x, y ∈ A ([9]). Lemma 2.9. ([6]) In any pseudo-BCK(pP) (A, ⊙, →, , 1) the following hold, for all x, y, z ∈ A: (1) x ⊙ y ≤ x, y; (2) x → y ≤ (x ⊙ z) → (y ⊙ z) ≤ x → (z → y) and x y ≤ (z ⊙ x) (z ⊙ y) ≤ x (z y). If A is a FLw -algebra, then: (3) (x → y) ⊙ x ≤ x ∧ y and (x ⊙ (x y) ≤ x ∧ y; (4) (x → z) ∧ (y → z) = (x ∨ y) → z and (x z) ∧ (y z) = (x ∨ y) z; (5) x ∨ y ≤ ((x → y) y) ∧ ((y → x) x)) and x ∨ y ≤ ((x y) → y) ∧ ((y x) → x)).

3. Interior operators on pseudo-BCK algebras Interior operators were defined and studied for Rℓ-monoids and residuated lattices in [22], [24] and [23]. We define and investigate the interior operators on pseudo-BCK algebras. The main results proved in this section are similar to the results proved in [20] for the case of closure operators on ordered sets. For any interior operator on a good pseudo-BCK algebra A satisfying Glivenko property we define interior operators on Reg (A) and A/Den (A). Definition 3.1. Let A be a pseudo-BCK algebra. A mapping ϕ : A −→ A is operator on A if it satisfies the following conditions for all x, y ∈ A : (IO1 ) ϕ(x) ≤ x; (IO2 ) x ≤ y implies ϕ(x) ≤ ϕ(y); (IO3 ) ϕϕ(x) = ϕ(x).

called an interior (decreasing) (monotone) (idempotent)

Denote IN T O(A) the set of all interior operators on A. Remark 3.2. If condition (IO1 ) is replaced by condition x ≤ ϕ(x) (increasing), then v is called a closure operator. Denote CLO(A) the set of all closure operators on A. Proposition 3.3. Let A be a pseudo-BCK algebra and let ϕ, ψ ∈ IN T O(A). Then ϕ ≤ ψ if and only if ϕψ = ϕ. Proof. Let ϕ, ψ ∈ IN T O(A). Suppose that ϕ ≤ ψ and let x ∈ A. We have ϕ(x) = ϕϕ(x) ≤ ϕψ(x). Moreover ϕψ(x) ≤ ψψ(x) = ψ(x) ≤ x, hence ϕϕψ(x) ≤ ϕ(x), that is ϕψ(x) ≤ ϕ(x). Thus ϕψ = ϕ. Conversely, assume that ϕψ = ϕ, hence ϕ(x) = ϕψ(x) ≤ ψ(x), for all x ∈ A, that is ϕ ≤ ψ. Theorem 3.4. Let A be a pseudo-BCK algebra and let ϕ, ψ ∈ IN T O(A). The following are equivalent: (a) ϕψ = ψϕ;

VERY TRUE PSEUDO-BCK ALGEBRAS

(b) ϕψ, ψϕ ∈ IN T O(A); (c) ϕψϕψ = ϕψ and ψϕψϕ = ψϕ. Proof. Let ϕ, ψ ∈ IN T O(A). (a) ⇒ (b) Suppose that ϕψ = ψϕ. For all x, y ∈ A, we have: (1) ϕψ(x ≤ ψ(x) ≤ x. (2) ϕψϕψ(x) = ϕϕψψ(x) = ϕϕψ(x) = ϕψ(x). (3) x ≤ y implies ψ(x) ≤ ψ(y), so ϕψ(x) ≤ ϕψ(y). It follows that ϕψ satisfies (IO1 ), (IO2 ), (IO3 ), hence ϕψ ∈ IN T O(A). Similarly ψϕ ∈ IN T O(A). (b) ⇒ (c) Assume that ϕψ, ψϕ ∈ IN T O(A). Then we have ϕψϕψ ≤ ϕψ, and applying Proposition 3.3 we get ϕψϕψ = ϕψ. Similarly ψϕψϕ = ψϕ. (c) ⇒ (a) Since ϕψϕψ = ϕψ and ψϕψϕ = ψϕ, then we have: ϕψ(x) = ϕψϕψ(x) ≤ ψϕψ(x) ≤ ψϕ(x), ψϕ(x) = ψϕψϕ(x) ≤ ϕψϕ(x) ≤ ϕψ(x), for all x ∈ A. Hence ϕψ = ψϕ. For any ϕ ∈ IN T O(A), denote by Fix (ϕ) = {x ∈ A | ϕ(x) = x}. Theorem 3.5. Let A be a pseudo-BCK algebra and let ϕ, ψ ∈ IN T O(A). If Fix (ϕ) = Fix (ψ), then ϕ = ψ. Proof. Since ϕϕ(x) = ϕ(x), we have ϕ(x) ∈ Fix (ϕ) = Fix (ψ), that is ψϕ(x) = ϕ(x), for all x ∈ A. Hence ψϕ = ϕ. Similarly ϕψ = ψ. From ϕ(x) ≤ x and ψ(x) ≤ x we get ϕ(x) = ψϕ(x) ≤ ψ(x) and ψ(x) = ϕψ(x) ≤ ϕ(x), respectively. Hence ϕ(x) = ψ(x), for all x ∈ A, that is ϕ = ψ. Proposition 3.6. Let (A, →, , 0, 1) be a pseudo-BCK algebra and let ϕ ∈ IN T O(A). Then the following hold for all x, y ∈ A : (1) x → ϕ(y) ≤ ϕ(x) → y and x ϕ(y) ≤ ϕ(x) y; (2) ϕ(x → y) ≤ ϕ(x) → y and ϕ(x y) ≤ ϕ(x) y. If A is bounded, then: (3) ϕ(0) = 0; (4) ϕ(x− ) ≤ ϕ(x)− and ϕ(x∼ ) ≤ ϕ(x)∼ ; (5) x ≤ ϕ(x− )∼ and x ≤ ϕ(x∼ )− ; (6) ϕ(x → y) ≤ y − x− and ϕ(x y) ≤ y ∼ → x∼ . Proof. (1) From ϕ(x) ≤ x, by Lemma 2.2(2) we have x → ϕ(y) ≤ ϕ(x) → ϕ(y). On the other hand, from ϕ(y) ≤ y by Lemma 2.2(3) we get ϕ(x) → ϕ(y) ≤ ϕ(x) → y. Hence x → ϕ(y) ≤ ϕ(x) → y and similarly x ϕ(y) ≤ ϕ(x) y. (2) Since ϕ(x → y) ≤ x → y and ϕ(x) ≤ x, by Lemma 2.2(2) we get ϕ(x → y) ≤ x → y ≤ ϕ(x) → y. Similarly ϕ(x y) ≤ ϕ(x) y. (3) By (IO1 ), ϕ(0) ≤ 0, hence ϕ(0) = 0. (4) It follows from (2) for y := 0. (5) From ϕ(x− ) ≤ x− , ϕ(x∼ ) ≤ x∼ we get x ≤ x−∼ ≤ ϕ(x− )∼ and x ≤ x∼− ≤ ϕ(x∼ )− , respectively. (6) It follows applying (IO1 ) and (psBCK1 ) for z := 0.

VERY TRUE PSEUDO-BCK ALGEBRAS

Proposition 3.7. Let (A, →, , 0, 1) be a good pseudo-BCK algebra satisfying Glivenko property and let ϕ ∈ IN T O(A). Define ϕ˜ : Reg (A) −→ Reg (A), by ϕ(x) ˜ = ϕ(x)−∼ . Then ϕ˜ ∈ IN T O(Reg (A)). Proof. Let x ∈ Reg (A). Since ϕ(x) ≤ x, then ϕ(x) ˜ = ϕ(x)−∼ ≤ x−∼ = x, hence ϕ˜ satisfies (IO1 ). If x, y ∈ Reg (A) such that x ≤ y, then ϕ(x) ≤ ϕ(y) and ϕ(x)−∼ ≤ ϕ(y)−∼ . Thus −∼ ) = (ϕ(x)−∼ )−∼ = ϕ(x) ˜ ≤ ϕ(y), ˜ that is (IO2 ). Finally, for all x ∈ A, ϕ˜ϕ(x) ˜ = ϕ(ϕ(x) ˜ −∼ ϕ(x) = ϕ(x), ˜ hence (IO3 ) is satisfied. We conclude that ϕ˜ ∈ IN T O(Reg (A)). Proposition 3.8. Let (A, →, , 0, 1) be a good pseudo-BCK algebra satisfying Glivenko property and let ϕ ∈ IN T O(A). Define ϕ˜ : A/Den (A) −→ A/Den (A), by ϕ([x] ˜ Den (A) ) = [ϕ(x)]Den (A) . Then ϕ˜ ∈ IN T O(A/Den (A)). Proof. We show that ϕ˜ is well defined. Applying Glivenko property we can see that [x]Den (A) = [x−∼ ]Den (A) and [x]Den (A) = [y]Den (A) iff x−∼ = y −∼ . Indeed: [x]Den (A) = [y]Den (A) iff x → y, y → x ∈ Den (A) iff (x → y)−∼ = (y → x)−∼ = 1 iff x−∼ → y −∼ = y −∼ → x−∼ = 1 iff x−∼ ≤ y −∼ and y −∼ ≤ x−∼ iff x−∼ = y −∼ . If x, y ∈ A such that [x]Den (A) = [y]Den (A) , we have: ϕ([x] ˜ Den (A) ) = ϕ([x ˜ −∼ ]Den (A) ) = [ϕ(x−∼ )]Den (A) = [ϕ(y −∼ )]Den (A) = ϕ([y ˜ −∼ ]Den (A) ) = ϕ([y] ˜ Den (A) ), hence ϕ˜ is well defined. Let x ∈ A. From ϕ(x) ≤ x we get [ϕ(x)]Den (A) ≤ [x]Den (A) , so ϕ([x] ˜ Den (A) ) ≤ [x]Den (A) , thus (IO1 ) is verified. For any x, y ∈ A such that x ≤ y we have ϕ(x) ≤ ϕ(y), so [ϕ(x)]Den (A) ≤ [ϕ(y)]Den (A) ]. It follows that ϕ([x] ˜ ˜ Den (A) ), hence ϕ˜ satisfies (IO2 ). Let x ∈ A, Den (A) ) ≤ ϕ([y] so ϕϕ(x) = ϕ(x) and [ϕϕ(x)]Den (A) = [ϕ(x)]Den (A) . Thus ϕ˜ϕ([x] ˜ ˜ Den (A) ) = ϕ([x] Den (A) ), so (IO3 ) is satisfied. Hence ϕ˜ ∈ IN T O(A/Den (A)). Example 3.9. Let (A, →, , 1) be the pseudo-BCK algebra from Example 2.5 and the maps ϕi : A −→ A, i = 1, · · · , 8, given in the table below: x ϕ1 (x) ϕ2 (x) ϕ3 (x) ϕ4 (x) ϕ5 (x) ϕ6 (x) ϕ7 (x) ϕ8 (x)

1 1 1 1 1 a b b c

a a a a a a a a a

b a b b c a b b c

c a a c c . a a c c

Then IN T O(A) = {ϕ1 , · · · , ϕ8 }. 4. Very true pseudo-BCK algebras In this section we introduce the very true operators on pseudo-BCK algebras and we study their properties. We prove that the composition of two very true operators is a very true

VERY TRUE PSEUDO-BCK ALGEBRAS

operator if and only if they commute. It is proved that, if two very true operators have the same image, then the two operators coincide. For a very true bounded pseudo-BCK algebra (A, v), we define the pseudo-BCKvt,st algebra by adding two truth-depressing hedges operators associated with v. Given a very true operator on a good pseudo-BCK algebra A satisfying Glivenko property we define very true operators on Reg (A) and A/Den (A). Finally, it is proved that the composition of a pseudo-valuation with a very true operator is a pseudovaluation as well. Definition 4.1. Let A be a pseudo-BCK algebra. A mapping v : A −→ A is called a very true operator on A if it satisfies the following conditions for all x, y ∈ A : (V T1 ) v(1) = 1; (V T2 ) v(x) ≤ x; (V T3 ) v(x) ≤ vv(x); (V T4 ) v(x → y) ≤ v(x) → v(y) and v(x y) ≤ v(x) v(y). The pair (A, v) is called a very true pseudo-BCK algebra. Denote VT O(A) the set of all very true operators on A. For v ∈ VT O(A), Ker (v) = {x ∈ A | v(x) = 1} is called the kernel of v. Remark 4.2. Axiom (V T1 ) means that absolutely true is very true, while (V T2 ) means that if ϕ is very true then it is true. (V T3 ) says that very true of very true is very true, which is a kind of necessitation with respect to very true connective. (V T4 ) means that if ϕ, ϕ → ψ and ϕ ψ are very true then so is ψ (see the comments from [11], [28], [29]). Example 4.3. The two boundary cases of truth-stressing hedges are the following: (1) Identity: IdA ∈ VT O(A) for any pseudo-BCK algebra. (2) Globalization ([26]): If A is a bounded pseudo-BCK algebra and v : A −→ A is defined by 1, if x = 1 ϕ(x) = 0, if x < 1, then v ∈ VT O(A). Globalization can be seen as an interpretation of a connective ”absolutely/fully true” ([18], [19]). Proposition 4.4. Let (A, v) be a very true pseudo-BCK algebra. Then the following hold for all x, y ∈ A : (1) v(x) = 1 if and only if x = 1; (2) x ≤ y implies v(x) ≤ v(y); (3) vv(x) = v(x); (4) v(x) ≤ y if and only if v(x) ≤ v(y); (5) Im (v) = Fix (v); (6) if v is surjective, then v = IdA ; (7) Ker (v) = {1}; (8) Ker (v) ∈ DS(A). Proof. (1) Suppose that there exists x ∈ A such that v(x) = 1. Then by (V T2 ), 1 = v(x) ≤ x, that is x = 1. Conversely, by (V T1 ), v(1) = 1. (2) Let x, y ∈ A, x ≤ y, that is x → y = x y = 1. Applying (V T4 ) we have 1 = v(1) = v(x → y) ≤ v(x) → v(y), hence v(x) → v(y) = 1, so v(x) ≤ v(y).

VERY TRUE PSEUDO-BCK ALGEBRAS

(3) Since by (V T2 ), vv(x) ≤ v(x), taking into consideration (V T3 ) we get vv(x) = v(x). (4) If v(x) ≤ y, then v(x) = vv(x) ≤ v(y). Conversely, from v(x) ≤ v(y) and (V T2 ) we get v(x) ≤ v(y) ≤ y. (5) If y ∈ Im (v), there exists x ∈ A such that v(x) = y. Then by (3), v(y) = vv(y) = vvv(x) = v(x) = y, so y ∈ {x ∈ A | v(x) = x} = Fix (v). It follows that Im (v) ⊆ Fix (v). Since the converse is obvious, we get Im (v) = Fix (v). (6) Let x ∈ A. Since A = Im (v), there exists x′ ∈ A such that x = v(x′ ). Hence v(x) = vv(x′ ) = v(x′ ) = x. Thus v = IdA . (7) Let x ∈ Ker (v), that is v(x) = 1. It follows that 1 = v(x) ≤ x, that is x = 1. Hence Ker (v) = {1}. (8) Let x, y ∈ A such that x, x → y ∈ Ker (v), that is v(x) = v(x → y) = 1. Since 1 = v(x → y) ≤ v(x) → v(y) = 1 → v(y) = v(y), we get v(y) = 1, so y ∈ Ker (v). Thus Ker (v) ∈ DS(A). Let (A, v) be a very true bounded pseudo-BCK algebra. Define s1 , s2 : A −→ A, by s1 (x) = v(x− )∼ , s2 (x) = v(x∼ )− , for all x ∈ A. Proposition 4.5. Let (A, v) be a very true bounded pseudo-BCK algebra. Then the following hold for all x, y ∈ A : (1) s1 (0) = s2 (0) = 0; (2) x ≤ s1 (x) and x ≤ s2 (x); (3) x ≤ y implies s1 (x) ≤ s1 (y) and s2 (x) ≤ s2 (y); (4) s1 s1 (x) = s1 (x) and s2 s2 (x) = s2 (x). Proof. (1) It is obvious. (2) It follows from Proposition 3.6(5). (3) From x ≤ y we have y − ≤ x− , hence v(y − ) ≤ v(x− ). It follows that v(x− )∼ ≤ v(y − )∼ , that is s1 (x) ≤ s1 (y). Similarly s2 (x) ≤ s2 (y). (4) For all x ∈ A, we have: s1 s1 (x) = s1 (v(x− )∼ ) = (v((v(x− ))∼ )− )∼ = (v(v(x− ))∼− )∼ . From v(x− ) ≤ (v(x− ))∼− we get vv(x− ) ≤ v((v(x− ))∼− ), hence v(x− ) ≤ v((v(x− ))∼− ). It follows that: s1 (x) = (v(x− )∼ ≥ (v((v(x− ))∼− ))∼ = s1 s1 (x). On the other hand, by (2), s1 (x) ≤ s1 s1 (x), hence s1 s1 (x) = s1 (x). Similarly s2 s2 (x) = s2 (x). Remark 4.6. By Proposition 4.5(2),(3),(4), s1 , s2 ∈ CLO(A). Example 4.7. Let (A, →, , 1) be the pseudo-BCK algebra from Example 2.5 and the maps vi : A −→ A, i = 1, 2, 3, 4, given in the table below: x v1 (x) v2 (x) v3 (x) v4 (x) Then VT O(A) = {v1 , v2 , v3 , v4 }.

1 1 1 1 1

a a a a a

b a b b c

c a a . c c

VERY TRUE PSEUDO-BCK ALGEBRAS

Remark 4.8. In any pseudo-BCK algebra A, VT O(A) ⊆ IN T O(A). As we can see in Examples 4.7 and 3.9, VT O(A) 6= IN T O(A). Theorem 4.9. Let A be a pseudo-BCK algebra and let v1 , v2 ∈ VT O(A). If Im (v1 ) = Im (v2 ), then v1 = v2 . Proof. According to Proposition 4.4(5) we have Fix (v1 ) = Fix (v2 ) and applying Theorem 3.5 it follows that v1 = v2 . Theorem 4.10. Let A be pseudo-BCK algebra and v1 , v2 ∈ VT O(A). Then v1 ◦v2 ∈ VT O(A) if and only if v1 ◦ v2 = v2 ◦ v1 . Proof. Let v1 , v2 ∈ VT O(A) such that v1 ◦ v2 ∈ VT O(A). According to Remark 4.8 we have v1 ◦ v2 ∈ IN T O(A) and applying Theorem 3.4 it follows that v1 ◦ v2 = v2 ◦ v1 . Conversely, let v1 , v2 ∈ VT O(A) such that v1 ◦ v2 = v2 ◦ v1 and let v = v1 ◦ v2 = v2 ◦ v1 . By Theorem 3.4, v ∈ IN T O(A), that is v satisfies (V T2 ) and (V T3 ). Obviously v(1) = 1, hence v satisfies (V T1 ). Since v1 and v2 satisfy (V T4 ) we have: v(x → y) = v1 (v2 (x → y)) ≤ v1 (v2 (x) → v2 (y)) ≤ v1 (v2 (x)) → v1 (v2 (y)) = v(x) → v(y). Similarly v(x y) ≤ v(x) v(y), that is v satisfies (V T4 ). Hence v ∈ VT O(A). Example 4.11. Let (A, →, , 1) be the pseudo-BCK algebra from Example 4.7 with VT O(A) = {v1 , v2 , v3 , v4 }. One can easily check that v1 ◦v2 = v2 ◦v1 = v1 ∈ VT O(A), while v4 ◦v2 6= v2 ◦v4 and v4 ◦ v2 ∈ / VT O(A). Proposition 4.12. Let (A, →, , 0, 1) be a good pseudo-BCK algebra satisfying Glivenko property and let v ∈ VT O(A). Define v˜ : Reg (A) −→ Reg (A) by v˜ = v(x)−∼ . Then v˜ ∈ VT O(Reg (A)). Proof. According to Proposition 3.7, v˜ satisfies (V T2 ) and (V T3 ). Obviously ˜ 1 = 1, hence (V T1 ) is also verified. Since A has Glivenko property and v ∈ VT O(A), we have: v˜(x → y) = v(x → y)−∼ ≤ (v(x) → v(y))−∼ = v(x)−∼ → v(y)−∼ = v˜(x) → v˜(y). Similarly v˜(x y) ≤ v˜(x) v˜(y), thus v˜ satisfies (V T4 ). Hence v˜ ∈ VT O(Reg (A)).

Proposition 4.13. Let (A, →, , 0, 1) be a good pseudo-BCK algebra satisfying Glivenko property and let v ∈ VT O(A). Define v˜ : A/Den (A) −→ A/Den (A) by v˜([x]Den (A) ) = [v(x)]Den (A) . Then v˜ ∈ VT O(A/Den (A)). Proof. By Proposition 3.8, v˜ is well defined and it satisfies (V T2 ) and (V T3 ). Clearly v˜([1]Den (A) ) = [1]Den (A) , that is (V T1 ) . For any x, y ∈ A we have: v˜([x]Den (A) → [y]Den (A) ) = v˜([x → y]Den (A) ) = [v(x → y)]Den (A) ≤ [(v(x) → v(y))]Den (A) = [v(x)]Den (A) → [v(y)]Den (A) = v˜([x]Den (A) ) → v˜([y]Den (A) ), Similarly v˜([x]Den (A) [y]Den (A) ) ≤ v˜([x]Den (A) ) v˜([y]Den (A) ), hence (V T4 ) is satisfied. We conclude that v˜ ∈ VT O(A/Den (A)). In order to study the truth-depressing hedges on BL-algebras, Vychodil ([27]) introduced the BLvt,st algebra extending a very true BL-algebra (A, ∧, ∨, ⊙, →, v, 0, 1) by an additional unary operator s : A −→ A satisfying the following conditions, for all x, y ∈ A :

VERY TRUE PSEUDO-BCK ALGEBRAS

(s1 ) s(0) = 0; (s2 ) x ≤ s(x); (s3 ) v(x → y) ≤ s(x) → s(y). The operator s is called a truth-depressing hedge associated with v. Similarly, we can define the pseudo-BCKvt,st algebra extending a very true bounded pseudoBCK algebra (A, →, , v, 0, 1) by two additional unary operators. Definition 4.14. A pseudo-BCKvt,st algebra is a very true bounded pseudo-BCK algebra (A, →, , v, 0, 1) endowed with two unary operators s1 , s2 : A −→ A satisfying the following conditions, for all x, y ∈ A : (ST1 ) s1 (0) = s2 (0) = 0; (ST2 ) x ≤ s1 (x) and x ≤ s2 (x); (ST3 ) v(x → y) ≤ s1 (x) → s1 (y) and v(x y) ≤ s2 (x) s2 (y). The pseudo-BCKvt,st will be denoted by (A, →, depressing hedges associated with v

, v, s1 , s2 , 0, 1), and s1 , s2 are called truth-

Theorem 4.15. Let (A, v) be a very true bounded pseudo-BCK algebra. Define s1 , s2 : A −→ A, by s1 (x) = v(x− )∼ , s2 (x) = v(x∼ )− , for all x ∈ A. Then (A, →, , v, s1 , s2 , 0, 1) is a bounded pseudo-BCKvt,st algebra. Proof. According to Proposition 4.5, s1 , s2 satisfy the conditions (ST1 ), (ST2 ). Applying twice Proposition 2.3(9) we get: v(x → y) ≤ v(y − x− ) ≤ v(y − ) v(x− ) ≤ v(x− )∼ → v(y − )∼ = s1 (x) → s1 (y) v(x y) ≤ v(y ∼ → x∼ ) ≤ v(y ∼ ) → v(x∼ ) ≤ v(x∼ )− v(y ∼ )− = s2 (x) s2 (y), that is (ST3 ). Hence (A, →, , v, s1 , s2 , 0, 1) is a bounded pseudo-BCKvt,st algebra. Pseudo-valuations on a pseudo-BCK algebra A were defined in [7] as real-valued functions ϕ : A −→ R satisfying the conditions: (pv1 ) ϕ(1) = 0; (pv2 ) ϕ(y) − ϕ(x) ≤ min{ϕ(x → y), ϕ(x y)} for all x, y ∈ A. A pseudo-valuation ϕ is said to be a valuation if it satisfies the condition: (pv3 ) v(x) = 0 implies x = 1 for all x ∈ A. Denote PV(A) the set of all pseudo-valuations on A. If ϕ ∈ PV(A), then the following hold for all x, y ∈ A: (pv4 ) ϕ(x) ≥ ϕ(y), whenever x ≤ y (ϕ is order reversing); (pv5 ) ϕ(x) ≥ 0. Theorem 4.16. Let A be a pseudo-BCK algebra and let v ∈ VT O(A). If ϕ ∈ PV(A), then ϕv = ϕ ◦ v ∈ PV(A). Proof. Obviuosly ϕv (1) = ϕ(v(1)) = ϕ(1) = 0, so ϕv satisfies (pv1 ). Since by (V T4 ) and (pv4 ) we have ϕ(v(x) → v(y)) ≤ ϕ(v(x → y)) and ϕ(v(x) v(y)) ≤ ϕ(v(x y)), applying (pv2 ) we get: ϕv (y) − ϕv (x) = ϕ(v(y)) − ϕ(v(x)) ≤ min{ϕ(v(x) → v(y)), ϕ(v(x) v(y))} ≤ min{ϕ(v(x → y)), ϕ(v(x y))} = min{ϕ ◦ v(x → y), ϕ ◦ v(x y)} = min{ϕv (x → y), ϕv (x y)}, for all x, y ∈ A, that is (pv2 ). Hence ϕv ∈ PV(A).

VERY TRUE PSEUDO-BCK ALGEBRAS

5. Very true deductive systems and very true pseudo-BCK homomorphisms We define the very true deductive systems of a very true pseudo-BCK algebra (A, v) and we prove that the congruences of (A, v) coincide with the congruences of A. We also introduce the notion of a very true homomorphism and we investigate their properties. Given a normal v-deductive system of a very true pseudo-BCK algebra (A, v) we construct a very true operator on the quotient pseudo-BCK algebra A/H. Given two very true pseudo-BCK algebras (A, v) and (B, u) and ψ a very true homomorphism we prove that the image of a very true subalgebra of A is a very true subalgebra of B and the kernel of ψ is a very true deductive system of A. If moreover ψ is surjective, it is proved that the image of a very true deductive system of A is a very true deductive system of B. Definition 5.1. Let (A, v) be a very true pseudo-BCK algebra and let D ∈ DS(A). Then D is called a v-deductive system of A if v(D) ⊆ D. If D ∈ DS n (A) such that v(D) ⊆ D, then D is called a normal v-deductive system of A. Denote DS v (A) the set of all v-deductive systems of A and DS vn (A) the set of all normal v-deductive systems of A. Remark 5.2. {1}, A, Ker (v) ∈ DS v (A), for all v ∈ VT O(A). Example 5.3. Let (A, →, , 1) be the pseudo-BCK algebra from Example 4.7 with VT O(A) = {v1 , v2 , v3 , v4 }. We have DS(A) = {{1}, {1, b}, A}. One can easily see that DS v1 (A) = DS v4 (A) = {{1}, A} and DS v2 (A) = DS v3 (A) = DS(A). Theorem 5.4. Let (A, v) be a very true pseudo-BCK algebra and let H ∈ DS vn (A). Define vˆ : A/H −→ A/H by vˆ([x]H ) = [v(x)]H , for all x ∈ A. Then vˆ ∈ VT O(A/H). Proof. If [x]H = [y]H , then x → y, y → x ∈ H, hence v(x → x), v(y → x) ∈ H. By (V T4 ) we get v(x) → v(y), v(y) → v(x) ∈ H, that is [v(x)]H = [v(y)]H , hence vˆ is well defined. Clearly vˆ([1]H ) = [v(1)]H = [1]H and vˆ([x]H ) = [v(x)]H ≤ [x]H , hence vˆ satisfies (V T1 ) and (V T2 ). For all x ∈ A we have: vˆvˆ([x]H ) = vˆ([v(x)]H ) = [vv(x)]H = [v(x)]H = vˆ([x]H ), so (V T3 ) is verified. Finaly, for all x, y ∈ A we have: vˆ([x]H → [y]H ) = vˆ([x → y]H ) = [v(x → y)]H ≤ [v(x) → v(y)]H = [v(x)]H → [v([y]H = vˆ([x]H ) → vˆ([y]H ). Similarly vˆ([x]H [y]H ) ≤ vˆ([x]H ) vˆ([y]H , thus (V T4 ) holds. Hence vˆ ∈ VT O(A/H). Proposition 5.5. The congruences on a very true pseudo-BCK algebra (A, v) coincide with the congruences of A. Proof. Let θ ∈ CON (A). There is a one-to-one correspondence between CON (A) and DS n (A). Let H ∈ DS n (A) and let (x, y) ∈ θH , that is x → y, y → x ∈ H. It follows that v(x → y), v(y → x) ∈ H. Since v(x → y) ≤ v(x) → v(y) and v(y → x) ≤ v(y) → v(x), we get v(x) → v(y), v(y) → v(x) ∈ H, that is (v(x), v(y)) ∈ θH . Hence θH ∈ CON (A, v). Definition 5.6. Let (A, v) and (B, u) be very true pseudo-BCK algebras and let ψ : A −→ B be a pseudo-BCK homomorphism. Then ψ is called a very true pseudo-BCK homomorphism if ψ(v(x)) = u(ψ(x)), for all x ∈ A.

VERY TRUE PSEUDO-BCK ALGEBRAS

Denote VHOM((A, v), (B, u)) the sets of all very pseudo-BCK homomorphisms from (A, v) to (B, u). For ψ ∈ VHOM((A, v), (B, u)), Ker (ψ) = {x ∈ A | ψ(x) = 1} is called the kernel of ψ. Remark 5.7. If (A, v) is a very true pseudo-BCK algebra, then 1A , IdA ∈ VHOM((A, v), (A, v)). Example 5.8. Let (A, →, , e, 1) be the bounded pseudo-BCK algebra from Example 2.6 and define the maps vi : A −→ A, i = 1, · · · , 10 and ψi : A −→ A, i = 1, 2, 3 as in the tables below: x v1 (x) v2 (x) v3 (x) v4 (x) v5 (x) v6 (x) v7 (x) v8 (x) v9 (x) v10 (x)

1 1 1 1 1 1 1 1 1 1 1

a a a a a e e e e e e

b b e e e b b b e e e

c c a a c b b c c e e

d d a d a b d b e d e

e e e e e e e e e e e

x ψ1 (x) ψ2 (x) ψ3 (x)

1 1 1 1

a 1 a b

b 1 b a

c 1 c d

d 1 d c

e 1 . e e

Then: (1) V T O(A) = {v1 , · · · , v10 }; (2) HOM(A, A) = {ψ1 , ψ2 , ψ3 }; (3) VHOM((A, vi ), (A, vi )) = {ψ1 , ψ2 }, i = 1, · · · , 9; (4) VHOM((A, v10 ), (A, v10 )) = {ψ1 , ψ2 , ψ3 }. Theorem 5.9. Let (A, v) and (B, u) be very true pseudo-BCK algebras and let ψ ∈ VHOM((A, v), (B, u)). Then the following hold: (1) if (A′ , v) is a very true subalgebra of A, then (ψ(A′ ), u) is a very true subalgebra of B; (2) Ker (ψ) ∈ DS vn (A); (3) if ψ is surjective and D ∈ DS v (A), then ψ(D) ∈ DS u (B); (4) if G ∈ DS u (B), then ψ −1 (G) ∈ DS v (A). Proof. (1) Let A be a subalgebra of A. It is known that ψ(A′ ) is a subalgebra of B, so we prove that u satisfies axioms (V T1 ) − (V T4 ): (V T1 ) : u(1) = u(ψ(1)) = ψ(v(1)) = ψ(1) = 1. (V T2 ) : Let y ∈ ψ(A′ ), so there exists x ∈ A′ such that y = ψ(x). Then we have: u(y) = u(ψ(x)) = ψ(v(x)) ≤ ψ(x) = y. (V T3 ) : uu(y) = uu(ψ(x)) = u(ψ(v(x))) = ψ(vv(x)) = ψ(v(x)) = u(ψ(x) = u(y). (V T4 ) : Let y1 , y2 ∈ ψ(A′ ) and let x1 , x2 ∈ A′ such that y1 = ψ(x1 ) and y2 = ψ(x2 ). u(y1 → y2 ) = u(ψ(x1 ) → ψ(x2 )) = u(ψ(x1 → x2 )) = ψ(v(x1 → x2 )) ≤ ψ(v(x1 ) → v(x2 )) = ψ(v(x1 )) → ψ(v(x2 )) = u(ψ(x1 )) → u(ψ(x2 ))

VERY TRUE PSEUDO-BCK ALGEBRAS

= u(y1 ) → u(y2 ). Similarly u(y1 y2 ) ≤ u(y1 ) u(y2 ). Hence (ψ(A′ ), u) is a very true subalgebra of B. (2) Clearly Ker (ψ) ∈ DS(A). For any x ∈ Ker (ψ), we have ψ(v(x)) = u(ψ(x)) = u(1) = 1, that is v(x) ∈ Ker (ψ). Hence Ker (ψ) ∈ DS v (A). Moreover: x → y ∈ Ker (ψ) iff ψ(x → y) = 1 iff ψ(x) → ψ(y) = 1 iff ψ(x) ≤ ψ(y) iff ψ(x) ψ(y) = 1 iff ψ(x y) = 1 iff x y ∈ Ker (ψ). It follows that Ker (ψ) ∈ DS vn (A). (3) Let D ∈ DS v (A). One can easily check that, if ψ is surjective then ψ(D) ∈ DS(B). Let y ∈ ψ(D) and x ∈ D such that ψ(x) = y. By hypothesis, v(x) ∈ D, so ψ(v(x)) ∈ ψ(D). It follows that u(y) = u(ψ(x)) = ψ(v(x)) ∈ ψ(D). Thus ψ(D) ∈ DS u (B). (4) Let G ∈ DS u (B). It is not difficult to prove that ψ −1 (G) ∈ DS(A). Consider x ∈ ψ −1 (G), so ψ(x) ∈ G. It follows that u(ψ(x)) ∈ G, hence ψ(v(x)) ∈ G, that is v(x) ∈ ψ −1 (G). We conclude that ψ −1 (G) ∈ DS v (A). Corollary 5.10. Let (A, v) and (B, u) be very true pseudo-BCK algebras and let ψ ∈ VHOM((A, v), (B, u)). Then the following hold: (1) ψ −1 (Ker (u)) ∈ DS v (A); (2) if ψ is surjective, then ψ(Ker (v)) ∈ DS u (B). Proposition 5.11. Let (A, v) be a very true pseudo-BCK algebra and let H ∈ DS vn (A). Define π : A −→ A/H by π(x) = [x]H and vˆ : A/H −→ A/H by vˆ([x]H ) = [v(x)]/H, for all x ∈ A. Then the following hold: (1) Ker (π) = H; (2) π ∈ VHOM((A, v), (A/H, vˆ)); (3) π −1 (Ker (ˆ v )) ⊆ v −1 (H); (4) π(Ker (v)) ⊆ Ker (ˆ v ). Proof. (1) It is obvious. (2) According to Theorem 5.4, vˆ ∈ VT O(A/H). Obviously π ∈ HOM(A, A/H) and we have: π(v(x)) = [v(x)]H = vˆ([x]H ) = vˆ(π(x)), for all x ∈ A. Hence π ∈ VHOM((A, v), (A/H, vˆ)). (3) Let x ∈ π −1 (Ker (ˆ v )), that is π(x) ∈ Ker (ˆ v ). Then we have: π(v(x)) = vˆ(π(x)) = vˆ(1) = [1]H , hence v(x) ∈ Ker (π) = H. It follows that x ∈ v −1 (H), thus π −1 (Ker (ˆ v )) ⊆ v −1 (H). (4) If y ∈ π(Ker (v)), then there exists x ∈ Ker (v) such that π(x) = y. We have: vˆ(y) = vˆ(π(x)) = π(v(x)) = π(1) = [1]H , hence y ∈ Ker (ˆ v ). We conclude that π(Ker (v)) ⊆ Ker (ˆ v ). Theorem 5.12. Let (A, v) and (B, u) be very true pseudo-BCK algebras, and let ψ ∈ VHOM((A, v), (B, u)). Consider H ∈ DS vn (A) such that H ⊆ Ker (ψ), and let π ∈ VHOM((A, v), (A/H, vˆ)), vˆ ∈ VT O(A/H), defined in Proposition 5.11. Then there exits a unique ψ˜ ∈ VHOM((A/H, vˆ), (B, u)) such that the following diagram is commutative.

VERY TRUE PSEUDO-BCK ALGEBRAS

✲ (B, u) ✯ ✟ ✟✟ ✟ ✟ π ✟✟ ψ˜ ✟✟ ✟ ❄✟

(A, v)

(A/H, vˆ) ˜ = Im (ψ) and Ker (ψ) ˜ = Ker (ψ)/H. Moreover Im (ψ) ˜ H ) = ψ(x). Let x, y ∈ A such that y ∈ [x]H . It Proof. Define ψ˜ : A/H −→ B, by ψ([x] follows that x → y, y → x ∈ H ⊆ Ker ψ, that is 1 = ψ(x → y) = ψ(x) → ψ(y) and 1 = ψ(y → x) = ψ(y) → ψ(x). Thus ψ(x) ≤ ψ(y) and ψ(y) ≤ ψ(x), that is ψ(x) = ψ(y). ˜ H ) = ψ([y] ˜ H ), so that ψ˜ is well defined on A/H. Hence ψ([x] Since ψ ∈ VHOM((A, v), (B, u)), we have: ˜ v ([x]H )) = ψ([v(x)] ˜ ˜ ψ(ˆ H ) = ψ(v(x)) = u(ψ(x)) = u(ψ([x]H )), for all x ∈ A. Hence ψ˜ ∈ VHOM((A/H, vˆ), (B, u)) and obviously ψ˜ ◦ π = ψ. Suppose that there exists µ ∈ VHOM((A/H, vˆ), (B, u)) with ψ˜ ◦ π = µ ◦ π. It follows that ˜ ψ(π(x)) = µ(π(x)), for all x ∈ A. Since π is surjective, for any element y ∈ A/H there exists ˜ x ∈ A such that y = π(x), hence µ = ψ. We can see that: ˜ = {y ∈ B | there exists [x]H ∈ A/H, ψ([x] ˜ H ) = y} Im (ψ) = {y ∈ B | there exists x ∈ A, ψ(x) = y} = Im (ψ). ˜ if and only if ψ([x] ˜ H ) = 1 if and only if Moreover, for all x ∈ A we have: [x]/H ∈ Ker (ψ) ψ(x) = 1 if and only if x ∈ Ker (ψ). Hence: ˜ = {[x]H ∈ A/H | x ∈ Ker (ψ)} = Ker (ψ)/H. Ker (ψ) Corollary 5.13. Let (A, v) and (B, u) be very true pseudo-BCK algebras, and let ψ ∈ VHOM((A, v), (B, u)). Then there exists a very true pseudo-BCK isomorphism between (A/Ker (ψ), v) and (Im (ψ), u). Proof. Taking H = Ker (ψ) and B = Im (ψ) in Theorem 5.12, it follows that ψ˜ is a very true isomorphism between (A/Ker (ψ), v) and (Im (ψ), u).

6. Very true operators on classes of pseudo-BCK algebras In this section we investigate the very true operators on some classes of pseudo-BCK algebras such as pseudo-BCK(pP) algebras, FLw -algebras, pseudo-MTL algebras. We define the QSmarandache pseudo-BCK algebras and we introduce the notion of a very true operator on Q-Smarandache pseudo-BCK algebras. Given a Q-Smarandache pseudo-BCK algebra A and a very true operator v on A, we prove that the restriction of v to Q is a very true operator on Q. Let us denote: PSBCK — the class of pseudo-BCK algebras psBCK(pP) — the class of pseudo-BCK(pP) algebras

VERY TRUE PSEUDO-BCK ALGEBRAS

FLw — psMT L — divRL — psBL — psMV — The relationship

the class of FLw -algebras ∼ = the class of bounded pseudo-BCK(pP) algebras the class of pseudo-MTL algebras the class of divisible residuated lattices (Rℓ-monoids) the class of pseudo-BL algebras the class of pseudo-MV algebras between these structures can be represented as follows: psBCK s s psBCK(pP ) s FLw ★❝ ★ ❝ ❝s divRL psMT L s★ ❝ ★ ❝ ★ ❝★ s psBL s

psMV Proposition 6.1. Let (A, v) be a very true pseudo-BCK(pP) algebra. Then the following hold for all x, y, z ∈ A : (1) if x ⊙ y ≤ z then v(x) ⊙ v(y) ≤ v(z); (2) v(x) ⊙ v(y) ≤ v(x ⊙ y); (3) v(x → y) ≤ v(x) → (v(z) → v(y)) and v(x y) ≤ v(x) (v(z) v(y)). Proof. (1) From x⊙y ≤ z we have x ≤ y → z, so v(x) ≤ v(y) → v(z), that is v(x)⊙v(y) ≤ v(z). (2) It follows from (1) for z = x ⊙ y. (3) Since by Lemma 2.9, x → y ≤ x → (y → z) and x y ≤x (y z), x, y, z ∈ A, applying (V T4 ) and Proposition 2.2(3) we get: v(x → y) ≤ v(x) → v(z → y) ≤ v(x) → (v(z) → v(y)), v(x y) ≤ v(x) v(z → y) ≤ v(x) (v(z) v(y)). Proposition 6.2. In any very true pseudo-BCK(pP) algebra (A, v), condition (V T4 ) is equivalent to condition: (V T4 ′ ) v(x → y) ≤ v(x) → (v(z) → v(y)) and v(x y) ≤ v(x) (v(z) v(y)), for all x, y, z ∈ A. Proof. Suppose that condition (V T4 ) holds and let x, y ∈ A, hence by Proposition 6.1(3) condition (V T4 ′ ) is satisfied. Conversely, if (V T4 ′ ) is satisfied, then taking z := 1 we get (V T4 ). Proposition 6.3. In any very true pseudo-BCK(pP) algebra (A, v), condition (V T4 ) is equivalent to condition: (V T4 ′′ ) v(x) ⊙ v(y) ≤ v(x ⊙ y), for all x, y ∈ A. Proof. Suppose that condition (V T4 ) holds and let x, y ∈ A. From x ⊙ y ≤ x ⊙ y we have y≤x x ⊙ y and applying (V T4 ) we get v(y) ≤ v(x x ⊙ y) ≤ v(x) v(x ⊙ y). Hence v(x) ⊙ v(y) ≤ v(x ⊙ y).

VERY TRUE PSEUDO-BCK ALGEBRAS

Conversely, if (V T4 ′′ ) is satisfied, from x → y ≤ x → y we have (x → y) ⊙ x ≤ y, thus v(x → y) ⊙ v(x) ≤ v((x → y) ⊙ x) ≤ v(y), that is v(x → y) ≤ v(x) → v(y). Similarly v(x y) ≤ v(x) v(y). Definition 6.4. Let (A, ∧, ∨, ⊙, →, , 0, 1) be a FLw -algebra. A mapping v : A −→ A is called a very true operator on A if it satisfies condtitions (V T1 ) − (V T4 ) and the following condition, for all x, y ∈ A : (V T5 ) v(x ∨ y) ≤ v(x) ∨ v(y). Proposition 6.5. Let (A, v) be a very true FLw -algebra. Then the following hold for all x, y ∈ A : (1) v(x → y) ⊙ v(x) ≤ v(x ∧ y) ≤ v(x) ∧ v(y) and v(x) ⊙ v(x y) ≤ v(x ∧ y) ≤ v(x) ∧ v(y); (2) v(x ∨ y) = v(x) ∨ v(y). Proof. (1) Since (x → y) ⊙ x ≤ x ∧ y, applying Proposition 6.1(2) we have: v(x → y) ⊙ v(x) ≤ v((x → y) ⊙ x) ≤ v(x ∧ y) ≤ v(x) ∧ v(y). Similarly v(x) ⊙ v(x y) ≤ v(x ∧ y) ≤ v(x) ∧ v(y). (2) From v(x), v(y) ≤ v(x ∨ y) we get v(x) ∨ v(y) ≤ v(x ∨ y). Applying (V T5 ) it follows that v(x ∨ y) = v(x) ∨ v(y). Proposition 6.6. In any very true pseudo-MTL algebra (A, v), condition (V T5 ) is equivalent to condition: (V T5 ′ ) v(x → y) ∨ v(y → x) = 1 and v(x y) ∨ v(y x) = 1, for all x, y ∈ A. Proof. Suppose that condition (V T5 ′ ) holds and let x, y ∈ A. Applying Lemmas 2.9(5),(4) and 2.2(3), we get: v(x ∨ y) ≤ (v(x → y) v(y)) ∧ (v(y → x) v(x)) ≤ (v(x → y) (v(x) ∨ v(y))) ∧ (v(y → x) (v(x) ∨ v(y))) = (v(x → y) ∨ v(y → x)) → (v(x) ∨ v(y)) =1 (v(x) ∨ v(y)) = v(x) ∨ v(y). Hence v(x ∨ y) = v(x) ∨ v(y), that is (V T5 ). Conversely, if (V T5 ) is satisfied, then: v(x → y) ∨ v(y → x) = v((x → y) ∨ (y → x)) = v(1) = 1 and v(x y) ∨ v(y x) = v((x y) ∨ (y x)) = v(1) = 1, ′ hence (V T5 ) is verified. Theorem 6.7. A very true FLw -algebra (A, v) satisfies (V T5 ′ ) if and only if A is a pseudoMTL algebra. ′

Proof. Let (A, v) be a very true FLw -algebra satisfying (V T5 ) and suppose that A is not a pseudo-MTL algebra. It follows that there exists x, y ∈ A such that (x → y) ∨ (y → x) < 1 or (x y) ∨ (y x) < 1. If (x → y) ∨ (y → x) < 1, then v(x → y) ∨ v(y → x) ≤ (x → ′ y) ∨ (y → x) < 1, which is in contradiction to (V T5 ). Similarly for (x y) ∨ (y x) < 1, hence A is a pseudo-MTL algebra. Conversely, if (A, v) is a very true pseudo-MTL algebra, ′ then according to Proposition 6.6, (V T5 ) holds. Theorem 6.8. Let (A, ∧, ∨, ⊙, →, lent: (a) A is a pseudo-MV algebra;

, 0, 1) be a FLw -algebra. Then the following are equiva-

VERY TRUE PSEUDO-BCK ALGEBRAS

(b) for any v ∈ VT O(A) the following identities hold: v(x ∨ y) = (v(x) → v(y)) v(y) = (v(x) for all x, y ∈ A.

v(y)) → v(y),

Proof. (a) ⇒ (b) If A is a pseudo-MV algebra, then we have x ∨ y = (x → y) y = (x y) → y, for all x, y ∈ A. Applying Proposition 6.5(2) we get v(x ∨ y) = v(x) ∨ v(y) = (v(x) → v(y)) v(y) = (v(x) v(y)) → v(y). (b) ⇒ (a) Suppose that the identities: v(x ∨ y) = (v(x) → v(y)) v(y) = (v(x) v(y)) → v(y) are satisfied for any v ∈ VT O(A). Taking v := IdA we get x∨y = (x → y) y = (x y) → y, for all x, y ∈ A. Hence A is a pseudo-MV algebra. Generally, in any human field, a Smarandache structure on a set A means a weak structure W on A such that there exists a proper subset B of A which is embedded with a strong structure S (see [13]). If A is a set endowed with a structure W of a pseudo-BCK algebra, then B is a subset of A endowed with a structure S which can be any of the above mentioned structures: psBCK(pP), FLw , psMTL, divRL, psBL or psMV-algebra. In this section we will consider a subset B of A endowed with a structure of a pseudo-MTL algebra. Definition 6.9. A bounded pseudo-BCK algebra (A, →, , 0, 1) is said to be a Q-Smarandache pseudo-BCK algebra if there is a proper subset Q of A satisfying the following conditions: (S1 ) 0, 1 ∈ Q and |Q| ≥ 3; (S2 ) (Q, ∧, ∨, ⊙, →, , 0, 1) is a pseudo-MTL algebra. Definition 6.10. Let A be a Q-Smarandache pseudo-BCK algebra. A mapping v : A −→ A is called a very true Q-Smarandache operator if vs = v|Q : Q −→ Q is a very true pseudo-MTL operator. The pair (A, v) is called a very true Q-Smarandache pseudo-BCK algebra. Denote SVT OQ (A) the set of all very true Q-Smarandache operators on a Q-Smarandache pseudo-BCK algebra A. Proposition 6.11. Let A be a linearly ordered Q-Smarandache pseudo-BCK algebra. If v ∈ VT O(A), then v|Q ∈ SVT OQ (A). Proof. Let v ∈ VT O(A). It is well known that a linearly ordered (A, ≤) is a lattice. Moreover, according to [12], every linearly ordered pseudo-BCK algebra is a pseudo-BCK(pP) ′ algebra satisfying the prelinearity condition. Hence v satisfies condition (V T5 ), that is v|Q ∈ SVT OQ (A). Proposition 6.12. Let Q1 and Q2 be pseudo-MTL algebras such that Q1 ⊆ Q2 ⊆ A. Then SVT OQ2 (A) ⊆ SVT OQ1 (A). Proof. It is straightforward.

VERY TRUE PSEUDO-BCK ALGEBRAS

Example 6.13. Consider the set A = {0, a, b, c, d, 1} and the operations →, following tables: → 0 a b c d 1

0 1 0 0 0 0 0

a 1 1 b b b a

b 1 1 1 b b b

c 1 1 1 1 1 c

d 1 c c c 1 d

1 1 1 1 1 1 1

0 1 0 0 0 0 0

0 a b c d 1

a 1 1 c a a a

b 1 1 1 b b b

c 1 1 1 1 1 c

d 1 c c c 1 d

1 1 1 1 1 1 1

1 r

d r

Then (A, →, , 0, 1) is a bounded pseudo-BCK algebra (see [15, Ex. 3.1.4]). Define the maps vi : A −→ A, i = 1, 2, 3, 4, 5 as in the table below: x v1 (x) v2 (x) v3 (x) v4 (x) v5 (x)

0 0 0 0 0 0

a 0 0 0 a a

b 0 0 0 a b

c 0 c d c c

d 0 d d d d

given by the

rc ❙ ❙r b

r ❅ ❅ ✓ a r ❅✓

1 1 1 . 1 1 1

One can easily check that V T O(A) = {v1 , v2 , v3 , v4 , v5 }. Consider Q = {0, c, d, 1} ⊆ A. We can see that (Q, ≤) is linearly ordered, so it is a lattice. Then (Q, ∧, ∨, ⊙, →, , 0, 1) is a pseudo-MTL algebra, where ⊙ is given in the table below. ⊙ 0 c d 1 x 0 c d 1 0 0 0 0 0 v1′ 0 0 0 1 d 0 d d c . v2′ 0 c d 1 c 0 d d d v3′ 0 d d 1 1 0 c d 1 We have SV T OQ (A) = {v1′ , v2′ , v3′ }, with v1′ , v2′ , v3′ from the table above. Obviously v1′ = v 1|Q , v2′ = v 2|Q = v 4|Q = v 5|Q , v3′ = v 3|Q . 7. Conclusions In this paper we generalized to the case of pseudo-BCK algebras the notions and results of very true operators which have been proved for other fuzzy logic algebras such as MValgebras, effect algebras, Rℓ-monoids, MTL-algebras, residuated lattices and equality algebras. As another direction of research, one could extend these results to the case of more general algebras of fuzzy logic, such as pseudo-BE algebras ([2]) and pseudo-CI algebras ([25]). References [1] R. Bˇelohl´ avek, V. Vychodil, Reducing the size of fuzzy concept lattices by hedges, In: FUZZ-IEEE 2005, the IEEE international conference on fuzzy systems, Reno, NV, USA, pp. 663–668. [2] R.A. Borzooei, A. Borumand Saeid, A. Rezaei, A. Radfar and R. Ameri, On pseudo-BE algebras, Discuss. Math. Gen. Algebra Appl. 33(2013), 95–108. [3] I. Chajda, Hedges and successors in basis algebras, Soft. Comput. 15 (2011), 613-618. [4] I. Chajda, M. Kolaˇr´ik, Very true operators in eﬀect algebras, Soft. Comput. 16 (2012), 1213-1218.

VERY TRUE PSEUDO-BCK ALGEBRAS

[5] L.C. Ciungu, J. K¨ uhr, New probabilistic model for pseudo-BCK algebras and pseudo-hoops, J. Mult.-Valued Logic Soft Comput. 20(2013), 373–400. [6] L.C. Ciungu, Non-commutative Multiple-Valued Logic Algebras, Springer, Cham, Heidelberg, New York, Dordrecht, London, 2014. [7] L.C. Ciungu, Fantastic deductive systems in probability theory on generalizations of fuzzy structures, submitted. [8] F. Esteva, L. Godo, C. Noguera, A logical approach to fuzzy truth hedges, Inf. Sci. 232 (2013), 366-385. [9] N. Galatos, P. Jipsen, T. Kowalski, H. Ono, Residuated Lattices: An Algebraic Glimpse at Substructural Logics, Elsevier, 2007. [10] G. Georgescu, A. Iorgulescu, Pseudo-BCK algebras: An extension of BCK-algebras, Proceedings of DMTCS’01: Combinatorics, Computability and Logic, Springer, London, 2001, pp. 97–114. [11] P. H´ ajek, On very true, Fuzzy Sets Syst. 14(12001), 329–333. [12] A. Iorgulescu, Classes of pseudo-BCK algebras - Part I, J. Mult.-Valued Logic Soft Comput. 12(2006), 71–130. [13] Y.B. Jun, Smarandache BCI-algebras, Sci. Math. Jpn. 62(2005), 137-142. [14] J. K¨ uhr, Pseudo-BCK semilattices, Demonstr. Math. 40(2007), 495–516. [15] J. K¨ uhr, Pseudo-BCK algebras and related structures, Habilitation thesis, Palack´ y University in Olomouc, 2007. [16] V.H. Le, D.K. Tran, Extending fuzzy logics with many hedges, Fuzzy Sets Syst. DOI:10.1016/j.fss.2018.01.014. [17] I. Leu¸stean, Lukasiewicz propositional logic, Arch. Math. Logic 45(2006), 191–213. [18] X. Liu, Z. Wang, On very true operators and v-ﬁlters, WSEAS Transactions on Mathematics 104(2008), 599–608. [19] X. Liu, Z. Wang, On v-ﬁlters of commutative residuated lattices with weak vt-operators, Proceedings of the 3rd WSEAS Int. Conf. on Computer engineering and applications CEA’09, Ningbo, China, 2009, pp. 133–137. [20] J. Rach˚ unek, Modal operators on ordered sets, Acta Univ. Palacki. Olomuc., Fac. Rer. Nat., Math. 24(1)(1985) 9-14. ˇ [21] J. Rach˚ unek, D. Salounov´ a, Truth values on generalizations of some commutative fuzzy structures, Fuzzy Sets Syst. 157(2006), 3159–3168. ˇ cek, Interior and closure operators on bounded commutative residuated ℓ-monoids, [22] J. Rach˚ unek, F. Svrˇ Discuss. Math. Gen. Algebra Appl. 28(2008), 11–27. [23] J. Rach˚ unek, Z. Svoboda, Interior and closure operators on commutative bounded residuated lattices, Acta Univ. Palacki. Olomuc., Fac. Rer. Nat., Math. 52(1)(2013) 121-134. [24] J. Rach˚ unek, Z. Svoboda, Interior and closure operators on bounded residuated lattices, Cent. Eur. J. Math. 12(3)(2014), 534–544. [25] A. Rezaei, A. Borumand Saeid and K. Yousefi Sikari Saber, On pseudo-CI algebras, submitted. [26] G. Takeuti, S. Titani, Globalization of intuitionistic set theory, Ann. Pure Appl. Logic 33(1987), 195 -211. [27] V. Vychodil, Truth-depressing hedges and BL-logic, Fuzzy Sets Syst. 157(2006), 2074 -2090. [28] J.T. Wang, X.L. Xin, A. Borumand Saeid, Very true operators on MTL-algebras, Open Math. 14(2016), 955–969. [29] J.T. Wang, X.L. Xin, Y.B. Jun, Very true operators on equality algebras, J. Comput. Anal. Appl. 24(2018), 507–521 [30] L. Zadeh, A fuzzy-set-theoretical interpretation of linguistic hedges, J. Cybern. 2(1972), 4–34. [31] L. Zadeh, Fuzzy logic and approximate reasoning, Synthese 30(1975), 407–428. Lavinia Corina Ciungu Department of Mathematics University of Iowa 14 MacLean Hall, Iowa City, Iowa 52242-1419, USA Email: lavinia-ciungu@uiowa.edu