In this paper, we investigate the properties of fuzzy Galois (dual Galois, residuated, and dual residuated) connections in a complete residuated lattice L . We give their examples. In particular, we study fuzzy Galois (dual Galois, residuated, dual residuated) connections induced by L -fuzzy relations. A Galois connection is an important mathematical tool for algebraic structure, data analysis, and knowledge processing [1 - 10] . Hájek [11] introduced a complete residuated lattice L that is an algebraic structure for many-valued logic. A context consists of ( U, V, R ), where U is a set of objects, V is a set of attributes, and R is a relation between U and V . Bĕlohlávek [1 - 3] developed a notion of fuzzy contexts using Galois connections with R ∈ L ^X×Y on L . In this paper, we investigate properties of fuzzy Galois (dual Galois, residuated, and dual residuated) connections in L and give their examples. In particular, we study fuzzy Galois (dual Galois, residuated, and dual residuated) connections induced by L -fuzzy relations. Definition 1.1. [11 , 12] An algebra (L, ∧, ∨, ⊙, →, 0, 1) is called a complete residuated lattice if it satisfies the following conditions: (C1) L = ( L ,≤,∨,∧, 1, 0) is a complete lattice with the greatest element 1 and the least element 0; (C2) ( L , ⊙, 1) is a commutative monoid; (C3) x ⊙ y ≤ z iff x ≤ y → z for x , y, z ∈ L . Remark 1.2. [11 , 12] (1) A completely distributive lattice L = ( L , ≤, ∨, ∧ = ⊙, → 1, 0) is a complete residuated lattice defined by In particular, the unit interval ([0, 1],∨,∧ = ⊙, → 0, 1) is a complete residuated lattice defined by (2) The unit interval with a left-continuous t-norm ⊙, ([0, 1], ∨, ∧, ⊙, →, 0, 1) , is a complete residuated lattice defined by In this paper, we assume that ( L , ∧, ∨, ⊙, →, 0, 1) is a complete residuated lattice with the law of double negation, i.e., α = α ^** where α = α → 0. Lemma 1.3. [12] For each x, y, z, x_i, y_i , ∈ L , we have the following properties. Definition 1.4. [4 , 7] Let X denote a set. A function e_X : X × X → L is called: (E1) reflexive if e_X ( x, x ) = 1 for all x ∈ X , (E2) transitive if e_X ( x, y ) ⊙ e_X ( y, z ) ≤ e_X ( x, z ), for all x, y, z ∈ X , and (E3) if e_X ( x, y ) = e_X ( y, x ) = 1, then x = y . If e satisfies (E1) and (E2), ( X, e_X ) is a fuzzy preorder set. If e satisfies (E1), (E2), and (E3), ( X, e_X ) is a fuzzy partially order set (for simplicity, fuzzy poset). Example 1.5. (1) We define a function as Then, ( L^X, e_LX ) is a fuzzy poset from Lemma 1.3 (10, 11). (2) If ( X, e_X ) is a fuzzy poset and we define a function is a fuzzy poset. Definition 2.1. Let ( X, e_X ) and ( Y, e_Y ) denote fuzzy posets and f : X → Y and g : Y → X denote maps. (1) ( e_X, f, g, e_Y ) is called a Galois connection if for all x ∈ X, y ∈ Y , (2) ( e_X, f, g, e_Y ) is called a dual Galois connection if for all x ∈ X , y ∈ Y , (3) ( e_X, f, g, e_Y ) is called a residuated connection if for all x ∈ X , y ∈ Y , (4) ( e_X, f, g, e_Y ) is called a dual residuated connection if for all x ∈ X , y ∈ Y , (5) f is an isotone map if e_Y ( f(x ₁ ), f(x ₂ )) ≥ e_X ( x ₁ , x ₂ ) for all x ₁ , x ₂ ∈ X . (6) f is an antitone map if e_Y ( f(x ₁ ), f(x ₂ )) ≥ e_X ( x ₂ , x ₁ ) for all x ₁ , x ₂ ∈ X . (7) f is an embedding map e_Y ( f(x ₁ ), f(x ₂ )) ≥ e_X ( x ₁ , x ₂ ) for all x ₁ , x ₂ ∈ X . If X = Y and e_X = e_Y , we simply denote ( e_X, f, g ) for ( e_X, f, g, e_Y ). ( X , ( e_X, f, g )) is called a Galois (resp. residuated, dual Galois, and dual residuated) pair. Remark 2.2. Let ( X, _eX ) and ( Y, _eY ) denote a fuzzy poset and f : X → Y and g : Y → X denote maps. (1) ( e_X, f, g, e_Y ) is a Galois (resp. dual Galois) connection iff ( e_Y, g, f, eX ) is a Galois (resp. dual Galois) connection. (2) ( e_X, f, g, e_Y ) is a Galois (resp. residuated) connection iff is a dual (resp. dual residuated) Galois connection. (3) ( e_X, f, g, e_Y ) is a residuated (resp. dual residuated) connection iff is a residuated (resp. dual residuated) connection. (4) ( e_X, f, g, e_Y ) is a Galois (resp. dual Galois) connection iff is a residuated (resp. dual residuated) connection. (5) ( e_X, f, g, e_Y ) is a residuated connection iff ( e_Y, g, f, e_X ) is a dual residuated connection. Theorem 2.3. Let ( X, e_X ) and ( Y, e_Y ) denote a fuzzy poset and f : X → Y and g : Y → X denote maps. (1) ( e_X, f, g, e_Y ) is a Galois connection if f, g are antitone maps and e_Y (y, f(g(y ))) = e_X(x, g(f(x) )) = 1. (2) ( e_X, f, g, e_Y ) is a dual Galois connection if f, g are antitone maps and e_Y(f(g(y)),y) = e_X(g(f(x)), x) = 1. (3) ( e_X, f, g, e_Y ) is a residuated connection if f, g are isotone maps and e_Y(f(g(y)),y) = e_X(x,g(f(x))) = 1. (4) ( e_X, f, g, e_Y ) is a dual residuated connection if f, g are isotone maps and e_Y(y,f(g(y))) = e_X(g(f(x)),x) = 1. Proof. (1) Let ( f, g ) denote a Galois connection. Since we have and Furthermore, Conversely, Similarly, e_Y(y, f(x)) ≤ e_X(x, g(y)). (2) Since e_Y(f(x), y) = e_X(g(y), x) , we have and Furthermore, Conversely, Similarly, e_Y(f(x), y) ≤ e_X(g(y), x). (3) Since e_Y(f(x), y) = e_X(x, g(y)) , we have and Furthermore, Conversely, Moreover, (4) It is similarly proved as (3). Example 2.4. Let X = {a, b, c} denote a set and f : X → X denote a function as f(a) = b, f(b) = a, f(c) = c . Define a binary operation ⊙ (called Łukasiewicz conjunction) on L = [0, 1] using (1) Let ( X = { a, b, c }, e ₁ ) denote a fuzzy poset as follows: Since e₁(x, y) = e₁(f(x), f(y)), then, ( e₁; f, f ) are both residuated and dual residuated connections. Since 0:7 = e ₁ ( c, a ) ≰ e ₁ ( f(a), f(c )) = e ₁ ( b, c ) = 0.5, f is not an antitone map. Hence, ( e ₁ , f, f ) are neither Galois nor dual Galois connections. (2) Let ( X = { a, b, c }, e ₂ ) denote a fuzzy poset as follows: Since e ₂ ( x, y ) = e ₂ ( f(y), f(x )), then, ( e₂, f, f ) are both Galois and dual Galois connections. Since 0.7 = e ₂ ( c,a ) ≰ e ₂ ( f(c), f(a )) = e ₂ ( c, b ) = 0.5, f is not an isotone map. Hence, ( e ₂ , f, f ) are neither residuated nor dual residuated connections. Definition 2.5. Let R ∈ L^X×Y denote a fuzzy relation. For each A ∈ L^X and B ∈ L^Y , we define operations R ^–1 ( y, x ) = R(x, y ) and as follows: Theorem 2.6. Let R ∈ L^X×Y denote a fuzzy relation. For each A ∈ L^X and B ∈ L^Y , Proof. (1) From Lemma 1.3 (13,14), we have (3) From Lemma 1.3 (7), we have From Lemma 1.3 (8), we have (4) From Lemma 1.3 (8), we have Other cases are similarly proved. Theorem 2.7. Let R ∈ L×Y denote a fuzzy relation, ( L^X , e_LX ) and ( L^Y , e_LY ) denote fuzzy posets. We have the following properties. Proof. (1) For each C ∈ L^X , B ∈ L^Y , (2) For each C ∈ L^X , B ∈ L^Y , (3) For each C ∈ L^X , B ∈ L^Y , (4) For each C ∈ L^X , B ∈ L^Y , For each C ∈ L^X , B ∈ L^Y , Other cases are similarly proved. In this paper, we investigated the properties of fuzzy Galois (dual Galois, residuated, and dual residuated) connections in a complete residuated lattice L . In particular, we studied fuzzy Galois (dual Galois, residuated, and dual residuated) connections induced by L -fuzzy relations. In the future, we will investigate the properties using fuzzy connections on algebraic structures and study the fuzzy concept lattices. No potential conflict of interest relevant to this article was reported.