Keywords

1 Introduction

Formal Concept Analysis (FCA) is a mathematical theory applied to the analysis of data (see [6]). The input of FCA is a triple called formal context that consists of a set of objects, a set of attributes, and a binary relation between objects and attributes. FCA techniques extract a collection of formal concepts from every formal context.

Formal concepts are special clusters that correspond to concepts such as “numbers divisible by 5”, or “white roses in the garden”. Fuzzy Formal Concept Analysis (FFCA) generalizes formal concept analysis to include also vague information. The input of FFCA is an L-context (XYI) where L is a support of an algebra of truth values, X is a set of objects, Y a set of attributes, and I is a fuzzy relation \(I: X \times Y\rightarrow L\).

A fuzzy concept is a pair (AB) where AB are fuzzy sets \(A: X\rightarrow L\), \(B: Y\rightarrow L\). A is called extent and it is a fuzzy set of all objects \(x\in X\) that have all attributes of B, and B is called intent and it is a fuzzy set of all attributes \(y\in Y\) being satisfied by all objects of A. Namely, A(x) is the degree to which “x has all attributes of B”, and B(y) is the degree to which “the attribute y is satisfied by all objects of A”.

In this article, we define twelve special operators as a tool to deepen the analysis of data. To explain their function, let us consider the following situation.

Let (XYI) be an L-context, where X is a set of students, Y are their skills, I(xy) is the degree to which “a student x has the skill y”. Thus, given a fuzzy concept (AB), we know that A is the fuzzy set representing all students with all skills in B.

Let us now ask, how many students share “almost all skills in B” (“most skills in B”, or “many skills in B”). Additionally, we may need to classify students with respect to how many skills of B they do not have and exactly, to consider the following fuzzy sets of X: students sharing “few skills in B”, students who do not have “most skills in B”, or students “do not have many skills in B”. Similarly, we can also consider a fuzzy set of Y formed of all skills shared by “almost all” (“most”, “many”, or “few”) students of A, and the fuzzy set of Y made of all skills that are not shared by “most” (or “many”) students in A. Each of the previous sets is generated by a fuzzy quantifier-based concept-forming operator, that allows us to introduce an extended notion of fuzzy concept.

Fuzzy quantifier-based operators are defined taking into account expressions of natural language extremely big, very big, and not small that are formalized within the theory of evaluative linguistic expressions [8]. Finally, starting from the \(\L \)ukasiewicz MV-algebra, we employ the fuzzy quantifier-based operators to represent a graded decagon of opposition, which is a graded extension of Aristotle’s square (see Fig. 1).

Fig. 1.
figure 1

Aristotle’s square. The lines denote that the corresponding propositions are contradictories, sub-contraries, sub-alterns, and contraries, respectively.

The article is organized as follows. Section 2 reviews some basic notions and results regarding MV-algebras, fuzzy formal concept analysis, and the graded square of opposition. Section 3 introduces the fuzzy quantifier-based operators and the corresponding new notions of fuzzy concepts. In Sect. 4, we construct a graded decagon of opposition using the former. Finally, in the last section we discuss further possible development of our results.

2 Preliminaries

This section describes some fundamental notions and results regarding MV-algebras, fuzzy formal concept analysis, and the graded square of opposition.

2.1 MV-Algebras

Definition 1

A lattice \(\langle L, \vee , \wedge \rangle \) is complete if and only if all subsets of L have both supremum and infimum.

Definition 2

A residuated lattice is an algebra \(\langle L, \vee , \wedge , \otimes , \rightarrow , \mathbf 0 , \mathbf 1 \rangle \) where

  1. (i)

    \(\langle L, \wedge , \vee , \mathbf 0 , \mathbf 1 \rangle \) is a bounded lattice,

  2. (ii)

    \(\langle L, \otimes , \mathbf 1 \rangle \) is a commutative monoid, and

  3. (iii)

    \(a \otimes b \le c \text{ iff } a \le b \rightarrow c\), for all \(a,b, c \in L\) (adjunction property).

Definition 3

([3, 11]). An MV-algebra is a residuated lattice

$$ \mathcal {L}=\langle L, \vee , \wedge , \otimes , \rightarrow , \mathbf 0 , \mathbf 1 \rangle $$

where \(a \vee b = (a \rightarrow b) \rightarrow b,\) for each \(a,b \in L\). We will also work with the following additional operations on L:

  1. (i)

    \(\lnot a = a \rightarrow \mathbf 0 \) (negation),

  2. (ii)

    \(a \oplus b = \lnot (\lnot a \otimes \lnot b)\) (strong disjunction),

  3. (iii)

    \(a \leftrightarrow b = (a \rightarrow b) \wedge (b \rightarrow a)\) (biresiduation).

Example 1

A special MV-algebra is the standard Łukasiewicz MV-algebra

$$ \mathcal {L}_{\L }=\langle [0,1], \vee , \wedge , \otimes , \rightarrow , 0, 1 \rangle $$

where \(a \vee b=\max (a,b)\), \(a \wedge b=\min (a,b)\), \(a \otimes b=\max (0, a+b-1)\) and \(a \rightarrow b = \min (1,1-a+b)\), \(\lnot a = 1 - a\) and \(a \oplus b= \min \{1, a + b\}\), for all \(a,b \in L\).

In the following lemma, we list some properties of complete MV-algebrasFootnote 1 that will be used below.

Lemma 1

Let \(\mathcal {L}=\langle L, \vee , \wedge , \otimes , \rightarrow , \mathbf 0 , \mathbf 1 \rangle \) be a complete MV-algebra. Then the following holds for all \(a, b, c, d, e \in L\):

  1. (a)

    If \(a \le b\) and \(c \le d\), then \(a \wedge c \le b \wedge d\).

  2. (b)

    Let I be any index set. Then for each \(k \in I\), \(\bigwedge _{i \in I} a_i \le a_k\) and \(a_k \le \bigvee _{i \in I} a_i\).

  3. (c)

    If \(a_i \le b_i\) for each \(i \in I\), then \(\bigvee _{i \in I} a_i \le \bigvee _{i \in I} b_i\).

  4. (d)

    \(a \oplus \lnot a = \mathbf 1 \) and \(a \otimes \lnot a = \mathbf 0 \).

  5. (e)

    If \(a \otimes b \le e\), then \((a \wedge c) \otimes (b \wedge d) \le e\).

  6. (f)

    If \(a \le b\) and \(c \le d\), then \(a \otimes c \le b \otimes d\) and \(a \oplus c \le b \oplus d\).

2.2 Fuzzy Formal Concept Analysis

In this subsection, we recall the definition of two pairs of fuzzy concept-forming operators (\(^\uparrow \), \(^\downarrow \)), and (\(^\cap \), \(^\cup \)) existing in literature. Given a complete residuated lattice L, by a fuzzy set of the universe X we mean a function \(A: X \rightarrow L\). If A is a fuzzy set on X, then we write . For each , we put \(\mathcal {S}_X(A,B)=\bigwedge _{x \in X}(A(x) \rightarrow B(x))\), which represents the degree of inclusion of A in BFootnote 2.

Definition 4

([1, 12]). Let (XYI) be an L-context and , . We put

$$ A^{{\uparrow }}(y)=\bigwedge _{x \in X}(A(x) \rightarrow I(x,y)) \ \ \text{ and } \ \ B^{{\downarrow }}(x)=\bigwedge _{y \in Y}(B(y) \rightarrow I(x,y)), $$

for all \(x \in X\) and \(y \in Y\).

The \(A^{{\uparrow }}(y)\) and \(B^{{\downarrow }}(x)\) correspond to the truth degrees of the statements “an attribute y is shared by all objects of A” and “an object x has all attributes of B”, respectively.

Definition 5

([13]). Let (XYI) be an L-context. If and , then

$$A^{{\cap }}(y)=\bigvee _{x \in X}(A(x) \otimes I(x,y)) \ \ \text{ and } \ \ B^{{\cup }}(x)=\bigwedge _{y \in Y}(I(x,y) \rightarrow B(y)),$$

for all \(x \in X\) and \(y \in Y\).

The operators \(^\cap \) and \(^\cup \) are borrowed from the rough set theory. Namely, \(A^{{\cap }}(y)\) and \(B^{{\cup }}(x)\) correspond to the truth degrees of the statements “an attribute y is shared by at least one object of A" and “an object x has no attributes outside B", respectively.

Each pair \((A,B) \in L^X \times L^Y\) such that \(A^{\uparrow }=B\) and \(B^{\downarrow } = A\) is called standard L-concept. Analogously, each pair \((A, B) \in L^X \times L^Y\) such that \(A^{\cap } = B\) and \(B^{\cup }= A\) is called property-oriented L-concept.

Theorem 1

The pair of mappings \(^{\uparrow }:L^X \rightarrow L^Y\) and \(^{\downarrow }:L^Y \rightarrow L^X\) forms an antitone Galois connection between X and Y, i.e. \(\mathcal {S}_X(A,B^{\downarrow })=\mathcal {S}_Y(B,A^\uparrow )\), for each and .

Theorem 2

The pair of mappings \(^{\cap }:L^X \rightarrow L^Y\) and \(^{\cup }:L^Y \rightarrow L^X\) forms an isotone Galois connection between X and Y, i.e. \(\mathcal {S}_X(A,B^{\cup })=\mathcal {S}_Y(A^\cap ,B)\), for each and .

Definition 6

Given a set X and a complete residuated lattice L, by a fuzzy preposet we mean a pair \((X,\mathcal {R})\) where \(\mathcal {R}\) is a fuzzy relation on X that is reflexive, i.e. \(\mathcal {R}(x,x)=1\) for each \(x \in X\), and \(\otimes \)-transitive, i.e. \(\mathcal {R}(x,y) \otimes \mathcal {R}(y,z) \le \mathcal {R}(x,z)\), for each \(x,y,z \in X\).

2.3 Graded Square of Opposition and Fuzzy Concept-Forming Operators

In this subsection, we define graded square of opposition referring to [5], and we enunciate a theorem that shows how this square can be obtained using the fuzzy concept-forming operators introduced in Subsect. 2.2.

Definition 7

Let \(P_A\) and \(P_B\) be properties represented by , then we say that

  1. 1.

    \(P_A\) and \(P_B\) are contraries if and only if \(A(x) \otimes B(x) = 0\) for each \(x \in X\),

  2. 2.

    \(P_A\) and \(P_B\) are sub-contraries if and only if \(A(x) \oplus B(x) = 1\) for each \(x \in X\),

  3. 3.

    \(P_A\) and \(P_B\) are sub-alterns if and only if \(A(x) \rightarrow B(x) =1\) for each \(x \in X\),

  4. 4.

    \(P_A\) and \(P_B\) are contradictories if and only if \(A(x)= \lnot B(x)\) for each \(x \in X\).

Definition 8

In a graded square of opposition the vertices \({{\mathbf {\mathsf{{A}}}}}\), \({{\mathbf {\mathsf{{E}}}}}\), \({{\mathbf {\mathsf{{I}}}}}\), and \({{\mathbf {\mathsf{{O}}}}}\) are fuzzy sets representing the propositions \(P_{{\mathbf {\mathsf{{A}}}}}\), \(P_{{\mathbf {\mathsf{{E}}}}}\), \(P_{{\mathbf {\mathsf{{I}}}}}\), and \(P_{{\mathbf {\mathsf{{O}}}}}\) such that the following conditions hold:

  1. 1.

    \(P_{{\mathbf {\mathsf{{A}}}}}\) and \(P_{{\mathbf {\mathsf{{E}}}}}\) are contraries;

  2. 2.

    \(P_{{\mathbf {\mathsf{{I}}}}}\) and \(P_{{\mathbf {\mathsf{{O}}}}}\) are sub-contraries;

  3. 3.

    \(P_{{\mathbf {\mathsf{{A}}}}}\) and \(P_{{\mathbf {\mathsf{{I}}}}}\) are sub-alterns, as well as \(P_{{\mathbf {\mathsf{{E}}}}}\) and \(P_{{\mathbf {\mathsf{{O}}}}}\);

  4. 4.

    \(P_{{\mathbf {\mathsf{{A}}}}}\) and \(P_{{\mathbf {\mathsf{{O}}}}}\) are contradictories, as well as \(P_{{\mathbf {\mathsf{{E}}}}}\) and \(P_{{\mathbf {\mathsf{{I}}}}}\).

From now, given the L-contexts (XYI), we suppose that L is the \(\L \)ukasiewicz MV-algebra, because we will need the double negation law, i.e. \(\lnot \lnot a = a\) for each \(a \in L\). Moreover, we put \((\lnot I)(x,y) = \lnot I(x,y)\). In the standard Łukasiewicz algebra, \(\lnot I(x,y) = 1-I(x,y)\), for all \(x \in X\) and \(y \in Y\).

This lemma follows from the results found in [5].

Lemma 2

Let be a normal fuzzy setFootnote 3, then

  1. 1.

    \(A^\uparrow _I(y) \otimes A^\uparrow _{\lnot I}(y) = 0\),

  2. 2.

    \(A^\cap _I(y) \oplus A^\cap _{\lnot I}(y) = 1\),

  3. 3.

    \(A^\uparrow _I(y) \le A^{\cap _I}(y)\), and \(A^\uparrow _{ \lnot I}(y) \le A^\cap _{\lnot I}(y)\),

  4. 4.

    \(\lnot A^\uparrow _I(y) = A^\cap _{\lnot I}(y)\), and \(\lnot A^\cap _I(y) = A^\uparrow _{\lnot I}(y)\),

for each \(y \in Y\).

Theorem 3

Let . If A is normal, then \(A^\uparrow _I\), \(A^\uparrow _{\lnot I}\), \(A^\cap _I\) and \(A^\cap _{\lnot I}\) are the vertices of a graded square of opposition, and they represent proprieties that are in relation of contrary, sub-contrary, sub-altern, and contradictory as shown in Fig. 2.

Observe that we obtain the graded square of opposition defined in [4] when fixing \(y \in Y\).

Fig. 2.
figure 2

Graded square of opposition

Fig. 3.
figure 3

Example of graded square of opposition

Example 2

Let (XYI) be an L-context, where \(X=\{x_1,x_2,x_3, x_4\}\), \(Y=\{y_1,y_2, y_3,y_4\}\), and \(I(x_1,y_1)=0.25\), \(I(x_2,y_1)=0.6\), \(I(x_3,y_1)=1\), \(I(x_4,y_1)=0.25\). The graded square of opposition associated to \(A=\{x_1, 0.5/x_2, 0.6/x_3, 0.5/x_4\}\) and \(y_1\) is depicted in Fig. 3.

3 Fuzzy Quantifier-Based Operators

In this section, we introduce the fuzzy quantifier based-operators extending the notion of fuzzy concept. Our theory is based on the theory of intermediate quantifiers presented in [7, 9] and elsewhere. The theory is based on the concept of evaluative linguistic expression. These are expressions of natural language such as “small, very big, rather medium”, etc. In this paper we confine only to “not small”, “very big” and “extremely big” and use a simplified model in which we consider only extensions in the (linguistic) context \(\langle 0, 0.5, 1\rangle \)Footnote 4 that are fuzzy sets \(\mathsf {Bi Ex}, \mathsf {BiVe}, \lnot \mathsf {Sm}\nu \) depicted in Fig. 4. For justification of this model, see [8, 10].

Fig. 4.
figure 4

Shapes of the fuzzy sets \(\mathsf {Bi Ex}, \mathsf {BiVe}, \lnot \mathsf {Sm}\nu \).

Remark 1

It is clear that \( \mathsf {Bi Ex}(x) \le \mathsf {BiVe}(x) \le \lnot \mathsf {Sm}\nu (x)\) holds for all \(x \in [0,1]\).

The cardinality of is defined by \(|A|= \sum _{x \in X} A(x).\) Furthermore, given , we consider the following measure that expresses how large the size of A is w.r.t. the size of B (see [9])

$$ \mu _B(A)= {\left\{ \begin{array}{ll} 1 &{} \text{ if } B = \emptyset \text{ or } A=B,\\ \frac{|A|}{|B|} &{} \text{ if } B \ne \emptyset \text{ and } A \subseteq B,\\ 0 &{} \text{ otherwise. } \end{array}\right. } $$

For our further reasoning, we need a special operation called cut of a fuzzy set. It is motivated by the need to form a new fuzzy set from a given one by extracting several elements together with their membership degrees and putting the other membership degrees equal to 0.

Definition 9

([7]). Let . The cut of A with respect to B is the fuzzy set

$$\begin{aligned} (A|B) (x)= {\left\{ \begin{array}{ll} A(x) &{} \text{ if } A(x)=B(x),\\ 0 &{} \text{ otherwise }. \end{array}\right. } \end{aligned}$$
(1)

Now, we give the definition of positive and negative fuzzy quantifier based-operators that are based on the relation I, and on the functions \(\lnot \mathsf {Sm v}, \mathsf {BiVe}\) and \(\mathsf {Bi Ex}\). Our aim is to capture positive, or negative information in (XYI).

Definition 10

(Fuzzy quantifier-based operators). Let us consider an L-context (XYI), , , \(x \in X\), and \(y \in Y\). Let \(Ev \in \{\lnot \mathsf {Sm v}, \mathsf {BiVe}, \mathsf {Bi Ex}\}\). Then we put:

  1. (i)

    Positive fuzzy quantifier based-operators

    (2)

    and

    (3)
  2. (ii)

    Negative fuzzy quantifier based-operators

    (4)

    and

    (5)

Informal explanation of the formulas in Definition 10 is the following:

  1. (i)

    \(A^{\uparrow }_{I, Ev}(y)\) is the truth degree to which there exists a cut of A such that “all its objects have the attribute y” and “its size is Ev (not small, very big or extremely big) w.r.t. the size of A”. Analogous statement holds for \(B^{\downarrow }_{I, Ev}(y)\).

  2. (ii)

    \(A^{\uparrow }_{\lnot I, Ev}(x)\) is the truth degree to which there exists a cut of A such that “all its objects do not have the attribute y” and “its size is Ev (not small, very big or extremely big) w.r.t. the size of A”. Analogous statement holds for and \(B^{\downarrow }_{\lnot I, Ev}(y)\).

Remark 2

  1. (a)

    If and \(y \in Y\), then \(\bigwedge _{x \in X}((A | Z)(x) \rightarrow I(x,y)) = (A | Z)^\uparrow _I(y)\) and \(\bigwedge _{x \in X}((A|Z)(x) \rightarrow \lnot I(x,y)) = (A|Z)^\uparrow _{\lnot I}(y).\)

  2. (b)

    If and \(x \in X\), then \(\bigwedge _{y \in Y}((B|Z)(y) \rightarrow I(x,y)) = (B|Z)^\downarrow _I(y)\) and \(\bigwedge _{y \in Y}((B|Z)(y) \rightarrow \lnot I(x,y)) = (B|Z)^\downarrow _{\lnot I}(x).\)

Since \(\mathsf {Bi Ex}\), \(\mathsf {BiVe}\) and \(\lnot \mathsf {Sm v}\) lay behind the definition of the intermediate quantifiers almost, most and many (cf. [9]), formulas \(A^{\uparrow }_{I, Ev}(y)\), \(A^{\uparrow }_{\lnot I, Ev}(y)\), \(B^{\downarrow }_{I, Ev}(x)\) and \(B^{\downarrow }_{\lnot I, Ev}(x)\) can be understood as interpretation of the linguistic expressions summarized in Table 1.

Table 1. Verbal description of the fuzzy quantifier-based operators

In the sequel, new notions of fuzzy concepts are introduced considering additional information generated by the fuzzy-quantifier-based operators.

Definition 11

Let \(Ev \in \{\lnot \mathsf {Sm v}, \mathsf {BiVe}, \mathsf {Bi Ex}\}\) and \(H \in \{I, \lnot I\}\). For each , and , we set

  1. (i)

    \(A^\Uparrow _{H, Ev}=(A^{\uparrow }_H, A^\uparrow _{H, Ev})\) and \((B, \tilde{B})^\Downarrow _{H, Ev}=B^{\downarrow }_H\),

  2. (ii)

    \((A,\tilde{A})^\triangle _{H, Ev}=A^{\uparrow }_H\) and \(B^\bigtriangledown _{H, Ev}=(B^{\downarrow }_H, B^\downarrow _{H,Ev})\).

Definition 12

(Extended fuzzy concepts). Let \(Ev \in \{\lnot \mathsf {Sm v}, \mathsf {BiVe}, \mathsf {Bi Ex}\}\), , and . Then, we say that

  1. (i)

    \((A,(B,\tilde{B}))\) is a positive concept with Ev-attributes if and only if \(A=(B, \tilde{B})^\Downarrow _{I, Ev}\) and \((B, \tilde{B})=A^\Uparrow _{I, Ev}\).

  2. (ii)

    \((A,(B,\tilde{B}))\) is a negative concept with Ev-attributes if and only if \(A=(B, \tilde{B})^\Downarrow _{\lnot I, Ev}\) and \((B, \tilde{B})=A^\Uparrow _{\lnot I, Ev}\).

  3. (iii)

    \(((A, \tilde{A}),B)\) is a positive concept with Ev-objects if and only if \((A, \tilde{A})=B^{\bigtriangledown }_{I, Ev}\) and \(B=(A,\tilde{A})^{\triangle }_{I, Ev}\).

  4. (iv)

    \(((A, \tilde{A}),B)\) is a negative concept with Ev-objects if and only if if \((A, \tilde{A})=B^{\bigtriangledown }_{\lnot I, Ev}\) and \(B=(A,\tilde{A})^{\triangle }_{\lnot I, Ev}\).

The following theorems state that the pairs of operators given by Definition 11 are both Galois connections between fuzzy preposets (see Definition 6). Given a set X, for each , we set

$$\begin{aligned} \mathcal {R}_X((A,B),(C,D))=\mathcal {S}_X(C,A). \end{aligned}$$
(6)

Theorem 4

Let \(Ev \in \{\lnot \mathsf {Sm v}, \mathsf {BiVe}, \mathsf {Bi Ex}\}\) and \(H \in \{I, \lnot I\}\). Then,

  1. (a)

    the pair of mappings \(^{\Uparrow }_{H, Ev}: L^X \rightarrow L^Y \times L^Y\) and \(^{\Downarrow }_{H, Ev}:L^Y \times L^Y \rightarrow L^X\) is a Galois connection between the fuzzy preposets \((L^X,\mathcal {S}_X)\) and \((L^Y \times L^Y, \mathcal {R}_Y)\), i.e. \(\mathcal {S}_X(A, (B,\tilde{B})^\Downarrow _{H,Ev})=\mathcal {R}_Y(A^{\Uparrow }_{H, Ev}, (B, \tilde{B}))\) for each and ,

  2. (b)

    the pair of mappings \(^{\triangle }_{H, Ev}: L^Y \times L^Y \rightarrow L^X\) and \(^{\bigtriangledown }_{H, Ev}:L^X \rightarrow L^Y \times L^Y\) is a Galois connection between the fuzzy preposets \((L^Y \times L^Y, \mathcal {R}_Y)\) and \((L^X,\mathcal {S}_X)\), i.e. \(\mathcal {R}_Y((A, \tilde{A}), B^\bigtriangledown _{H,Ev})=\mathcal {S}_X((A, \tilde{A})^{\triangle }_{H, Ev}, B)\) for each and .

Proof

We prove only item (a), because item (b) can be proved analogously.

Let , and . By Definition 11(i), \(\mathcal {S}_X(A, (B, \tilde{B})^{\Downarrow }_{H, Ev}) = \mathcal {S}_X(A, B^{\downarrow }_{H})\). Moreover, by Theorem 1, we know that \(\mathcal {S}_X(A, B^{\downarrow }_{H}) = \bigwedge _{x \in X}(A(x) \rightarrow B^{\downarrow }_{H}(x))\) is equal to \(\mathcal {S}_Y(B, A^{\uparrow }_{H})=\bigwedge _{y \in Y}(B(y) \rightarrow A^{\uparrow }_{H}(y))\). Eventually, by (6), \(\mathcal {S}_Y(B, A^{\uparrow }_{H})=\mathcal {R}_Y(A^{\Uparrow }_{H, Ev}, (B, \tilde{B})).\) Then, we conclude that \(\mathcal {S}_X(A, (B,\tilde{B})^\Downarrow _{H,Ev})=\mathcal {R}_Y(A^{\Uparrow }_{H, Ev}, (B, \tilde{B}))\).    \(\square \)

4 Graded Decagon of Opposition with Fuzzy Quantifier-Based Operators

In this section, we introduce the definition of graded decagon of opposition, which is a generalization of the graded square of opposition given in Definition 8. Moreover, we construct a graded decagon of opposition using some fuzzy quantifier-based operators.

Definition 13

(Graded decagon of opposition). A graded decagon of opposition consists of vertices , and representing the propositions \(P_{A_1}, \ldots , P_{A_5}\), \(P_{N_1}, \ldots , P_{N_5}\) such that:

  1. 1.

    \(P_{A_i}\) and \(P_{N_j}\) are contraries, for each \(i, j \in \{1 \ldots , 4\}\),

  2. 2.

    \(P_{A_5}\) and \(P_{N_5}\) are sub-contraries,

  3. 3.

    \(P_{A_i}\) and \(P_{A_{i+1}}\) are sub-alterns, as well as \(P_{N_i}\) and \(P_{N_{i+1}}\), for each \(i \in \{1, \ldots , 4\}\),

  4. 4.

    \(P_{A_1}\) and \(P_{N_5}\) are contradictories, as well as \(P_{A_5}\) and \(P_{N_1}\).

The graded decagon of opposition is depicted in Fig. 5.

Fig. 5.
figure 5

Graded decagon of opposition

In the sequel, we prove a few lemmas in order to construct a graded decagon of opposition with the fuzzy quantifier-based operators.

Lemma 3

For each and \(y \in Y\), the following properties hold:

  1. (a)

    \(A^\uparrow _I(y) \le A^{\uparrow }_{I, \mathsf {BiEx}}(y) \le A^{\uparrow }_{I, \mathsf {BiVe}}(y) \le A^{\uparrow }_{I, \lnot \mathsf {Sm v}}(y)\),

  2. (b)

    \(A^\uparrow _{\lnot I}(y) \le A^{\uparrow }_{\lnot I, \mathsf {BiEx}}(y) \le A^{\uparrow }_{\lnot I, \mathsf {BiVe}}(y) \le A^{\uparrow }_{\lnot I, \lnot \mathsf {Sm v}}(y)\).

Proof

We give the proof of item (a) only. The proof of item (b) is analogous.

Let \(Ev \in \{\lnot \mathsf {Sm v}, \mathsf {BiVe}, \mathsf {Bi Ex}\}\). Trivially, \(A^\uparrow _I(y)= (A|A)^\uparrow _I(y) \wedge Ev(\mu _A(A | A)).\) By Lemma 1(b),

namely \(A^\uparrow _I(y) \le A^{\uparrow }_{I, Ev}(y)\). By Remark 1, for each ,

$$ \mathsf {Bi Ex} (\mu _A(A | Z)) \le \mathsf {Bi Ve}(\mu _A(A | Z)) \le \lnot \mathsf {Sm v} (\mu _A(A | Z)). $$

Consequently, by Lemma 1(a),

figure b

Finally, by Lemma 1(c), \(A^{\uparrow }_{I, \mathsf {BiEx}}(y) \le A^{\uparrow }_{I, \mathsf {BiVe}}(y) \le A^{\uparrow }_{I, \lnot \mathsf {Sm v}}(y)\).    \(\square \)

In some relations, it is necessary to add the assumption that the fuzzy set in concern is non-empty. In classical logic, we add the formula \((\exists x)A(x)\) that assures us that “there exists at least one element x” and speak about existential import (or presupposition). In fuzzy logic, the quantifier \(\exists \) is interpreted by supremum. This leads us to the following definition.

Definition 14

Let , \(y \in Y\), \(Ev \in \{\lnot \mathsf {Sm v}, \mathsf {BiVe}, \mathsf {Bi Ex}\}\), and \(H \in \{I, \lnot I\}\). Then the following formulas have existential import:

  1. (i)

    \((A^{\uparrow }_{H}(y))^{*}= \bigwedge _{x \in X}(A(x) \rightarrow H(x,y)) \otimes \bigvee _{x \in X}A(x)\),

  2. (ii)

    .

The existential import is used in the following lemmas.

Lemma 4

Let , \(y \in Y\), \(Ev \in \{\lnot \mathsf {Sm v}, \mathsf {BiVe}, \mathsf {Bi Ex}\}\), and \(H \in \{I, \lnot I\}\). Then,

$$ (A^{\uparrow }_{H, Ev}(y))^{*} \le \left( \bigvee _{x \in X}A(x)\right) \rightarrow A^\cap _H(y). $$

Proof

By Lemma 1(b), the following inequality holds: for each and \(x \in X\)

$$ (A |Z)^{\uparrow }_H(y) \le (A|Z)(x) \rightarrow H(x,y). $$

By the adjunction property, \((A |Z)^{\uparrow }_H(y) \otimes (A|Z)(x) \le H(x,y).\) By Lemma 1(f),

$$ (A |Z)^{\uparrow }_H(y) \otimes (A|Z)(x) \otimes A(x) \le A(x) \otimes H(x,y). $$

Hence,

$$ (A |Z)^{\uparrow }_H(y) \otimes \bigvee _{x \in X}(A|Z)(x) \otimes \bigvee _{x \in X}A(x) \le \bigvee _{x \in X}A(x) \otimes H(x,y). $$

By Lemma 1(e),

$$ ( (A |Z)^{\uparrow }_H(y) \wedge Ev(\mu _A(A | Z)) ) \otimes \bigvee _{x \in X}(A|Z)(x) \otimes \bigvee _{x \in X} A(x) \le \bigvee _{x \in X}A(x) \otimes H(x,y). $$

Using the adjunction property, we conclude that \((A^{\uparrow }_{H, Ev}(y))^{*} \le (\bigvee _{x \in X}A(x)) \rightarrow A^\cap _H(y).\)    \(\square \)

Lemma 5

Let , \(y \in Y\), and \(Ev_1, Ev_2 \in \{\lnot \mathsf {Sm v}, \mathsf {BiVe}, \mathsf {Bi Ex}\}\). Then,

$$(A^{\uparrow }_{I, Ev_1}(y))^* \ \otimes \ (A^{\uparrow }_{\lnot I, Ev_2}(y))^*= 0.$$

Proof

Let \(y \in Y\), \(x \in X\) and . By Definition 4, and by Lemma 1(b),

$$(A|Z_1)^\uparrow _I(y) \le (A|Z_1)(x) \rightarrow I(x,y), \text{ and } (A|Z_2)^\uparrow _{\lnot I}(y) \le (A|Z_2)(x) \rightarrow \lnot I(x,y).$$

Then, by the adjunction property,

$$(A|Z_1)^\uparrow _I(y) \otimes (A|Z_1)(x) \le I(x,y), \text{ and } (A|Z_2)^\uparrow _{\lnot I}(y) \otimes (A|Z_2)(x) \le \lnot I(x,y).$$

By Lemma 1(e), \(((A|Z_1)^\uparrow _I(y) \wedge Ev_1(\mu _A(A | Z_1))) \otimes (A|Z_1)(x) \le I(x,y), \text{ and } \) \(((A|Z_2)^\uparrow _{\lnot I}(y) \wedge Ev_2(\mu _A(A | Z_2))) \otimes (A|Z_2)(x) \le \lnot I(x,y).\)

By Lemma 1(d), (f),

figure c

Finally,

figure d

and hence, \((A^{\uparrow }_{I, Ev_1}(y))^* \otimes (A^{\uparrow }_{\lnot I, Ev_2}(y))^* = 0\).   \(\square \)

Lemma 6

Let , \(y \in Y\), and \(Ev \in \{\lnot \mathsf {Sm v}, \mathsf {BiVe}, \mathsf {Bi Ex}\}\). Then,

$$ (A^{\uparrow }_{I, Ev}(y))^* \otimes (A^{\uparrow }_{\lnot I}(y))^* = 0 \ \ \text { and } \ \ (A^{\uparrow }_{I}(y))^* \otimes (A^{\uparrow }_{\lnot I, Ev}(y))^*=0. $$

Proof

The proof is similar to that of Lemma 5.    \(\square \)

The following theorem shows that we can obtain a decagon of oppositions starting from our operators.

Theorem 5

Let (XYI) be an L-context, where L is the standard \(\L \)ukasiewicz MV-algebra, and let . If A is normal, then

$$\begin{aligned} A^{\uparrow }_I, A^{\uparrow }_{I, \mathsf {Bi Ex}}, A^{\uparrow }_{I, \mathsf {Bi Ve}}, A^{\uparrow }_{I, \lnot \mathsf {Smv}}, A^{\cap }_I, A^{\uparrow }_{\lnot I}, A^{\uparrow }_{\lnot I, \mathsf {Bi Ex}}, A^{\uparrow }_{\lnot I, \mathsf {Bi Vi}}, A^{\uparrow }_{\lnot I, \lnot \mathsf {Smv}}, A^{\cap }_{\lnot I} \end{aligned}$$

are the vertices of a graded decagon of opposition, and they represent proprieties that are in relation of contrary, sub-contrary, sub-altern, and contradictory as shown in Fig. 6.

Proof

The proof follows by Theorem 3, Lemma 3, Lemma 4, Lemma 5, and Lemma 6.    \(\square \)

Table 2. The fuzzy relation I between the objects of X and attribute \(y_1\).

Example 3

Let (XYI) be an L-context, where \(X=\{x_1, \ldots , x_{24}\}\), \(Y=\) \(\{y_1,\) \(\ldots , y_{10}\}\), and the L-relation I between the objects of X and the attribute \(y_1\) of Y is defined by Table 2. Let us fix the context \(\langle 0,0.5,1\rangle \). Then the functions \(\lnot \mathsf {Smv}: [0,1] \rightarrow [0,1]\), \(\mathsf {Bi Ve}: [0,1] \rightarrow [0,1]\), and \(\mathsf {Bi Ex}: [0,1] \rightarrow [0,1]\) are defined in [10] (cf. also Fig. 4). Furthermore, put

figure e

Then we obtain the graded decagon of opposition depicted in Fig. 7.

Fig. 6.
figure 6

Graded decagon of opposition

Fig. 7.
figure 7

Example of graded decagon of opposition

5 Future Directions

In this article, a graded decagon of opposition is introduced as a graded generalization of Aristotle’s square, and it is constructed using some fuzzy quantifier-based operators. As future work, we intend to analyze more deeply the role that the fuzzy quantifier-based operators could have in fuzzy formal concept analysis. Moreover, fixed an evaluative linguistic expression \(Ev_1\), we will find another evaluative linguistic expression \(Ev_2\) such that the pair of operators \(^\uparrow _{I, Ev_1}\) and \(^\downarrow _{I, Ev_2}\) forms a Galois connection. Finally, we would like to propose our operators as fuzzy generalizations of the scaling quantifiers used in Relational concept analysis [2].