Abstract
This study focuses on the Modus Tollens (MT) property induced by discrete uninorms. Specifically, we identify the set of necessary and sufficient criteria for a discrete implication function to comply with this logical property. This rule of inference is studied by using discrete residual implication functions derived from uninorms of two of the most important families of these discrete operators (, idempotents), exploring which properties these operators must satisfy, as well as providing some characterizations of the Modus Tollens in this domain of definition. Our findings contribute to a deeper understanding of reasoning mechanisms in fuzzy logic, particularly in discrete settings.
Keywords:
modus tollens; discrete uninorms; fuzzy discrete implication; discrete RU-implications; negation on a finite chain MSC:
03B52; 03E72; 68T27; 68T37; 94D05
1. Introduction
Fuzzy logic, since its inception by Zadeh in 1965 [1], has become a fundamental tool in modeling imprecise reasoning. Unlike classical binary logic, where statements are true or false, fuzzy logic allows propositions to take on a continuum of truth values in the unit interval [2]. This enables a more faithful representation of the kind of reasoning often employed by humans, particularly in domains where information is incomplete, uncertain, vague, or linguistically expressed.
In many artificial intelligence applications, such as expert systems, control systems, data fusion, and decision-making under uncertainty, fuzzy logic provides a formal framework that allows the capture and manipulation of approximate information. The strength of fuzzy logic lies not only in its ability to handle gradation but also in its flexibility in generalizing classical logical concepts such as implication, conjunction, disjunction, and negation [3,4,5,6,7].
A central focus in fuzzy logic is the adaptation of classical inference rules to the fuzzy setting [8,9,10,11,12]. Among these, the rule of Modus Tollens (which in classical logic states that from and , one may infer ) has drawn considerable attention. In classical logic, this property holds universally as a tautology. However, in fuzzy logic, this inference rule is not necessarily valid for all combinations of fuzzy operators. Its fuzzy analogue is generally studied in terms of a functional inequality involving different operators. This inequality, known as the fuzzy Modus Tollens condition, is written as
where T is a triangular norm, I is a fuzzy implication function, and N is a fuzzy negation operator [13,14].
This formulation captures the spirit of Modus Tollens in fuzzy logic, with truth degrees reflecting the gradual nature of inference [2]. Researchers have proposed generalizing t-norms and t-conorms through the notion of uninorms, studying this functional inequality for different families of this class of operators [15,16].
However, many real-world applications require discrete representations. In fields such as decision theory, knowledge-based systems, and qualitative reasoning, information is often given on ordinal scales rather than precise numerical values. For example, an expert can rate a risk as ‘low’,‘medium’, or ‘high’, corresponding to a finite chain of degrees of truth. Such discrete structures, commonly referred to as finite chains (e.g., ), are widely used to model linguistic variables and are well-suited for practical implementations [17].
Analogous to the continuous case, in this discrete setting, the different classical operators (t-norms, t-conorms, uninorms, negation functions, implication functions, etc.) and certain inference rules have been studied, giving rise to analogous results or adaptations appropriate to the discrete environment [18,19,20,21,22,23,24]. Following this approach, in this paper, we investigate the U-Modus Tollens using discrete conjunctive uninorms (instead of discrete t-norms), discrete negations, and discrete implication functions:
This inference rule is studied for residual implication functions derived from the two main families of discrete uninorms ( and idempotents ()). Moreover, we investigate what properties these operators should satisfy, and we provide some characterizations of the U-Modus Tollens in this domain.
The structure of this article is organized as follows. In Section 2, the basic notions required of discrete uninorms and discrete implication functions that will be used in the paper are introduced for easy reading of the paper. In Section 3, the U-Modus Tollens is initially studied with respect to a discrete uninorm and a discrete implication. In particular, U-Modus Tollens is characterized by implication functions derived from discrete uninorms of and . Finally, the last section presents the conclusions of the work, along with some possible directions for future research.
2. Preliminaries
We present several established definitions and results that provide the essential background for the topic at hand.
We assume that the reader has a basic understanding of the basic notions of discrete operators (t-norms, t-conorms, implications, uninorms, negations). For further details on these concepts, we refer the reader to the relevant literature (please see references [19,25,26]).
For any positive integer n, we consider the finite chain with elements, denoted by . We shall also make use of interval notation interchangeably; that is, . Moreover, for any , we write and to refer to the corresponding subsets of , namely and , respectively.
Definition 1
([18,19]). A discrete uninorm, or simply a uninorm on , is a mapping that fulfills the following properties: associativity, commutativity, and non-decreasingness with respect to each argument. Additionally, there exists an element , referred to as the neutral element, such that for every .
For a better understanding of the previous definition, see Figure 1.
Figure 1.
General structure of a discrete uninorm on , where and are, respectively, the underlying t-norm and t-conorm.
These classes of operators extend both discrete t-norms and discrete t-conorms and are usually denoted as [18,19]. Moreover, for any uninorm U defined on , it holds that . More precisely, if , the operation U is referred to as a discrete conjunctive uninorm, whereas if , it is called a discrete disjunctive uninorm.
In this work, we utilize the family of discrete uninorms in and the family of discrete idempotent uninorms (, those satisfying for all ). These two families have been characterized as follows [19]:
Theorem 1
([19]). Let U be a binary operation on that has a neutral element e with . Then, U belongs to the class of discrete uninorms in if it is defined as follows:
where operates as a discrete t-norm restricted to the closed interval , and acts as a discrete t-conorm applied to the closed interval . This class of uninorms is usually denoted by .
Previous Figure 2 gives the graphical representation of the uninorm described in Theorem 1.
Figure 2.
General structure of a discrete uninorm in .
Theorem 2
([19]). A mapping , having a neutral element e such that , belongs to the class of discrete idempotent uninorms if and only if there exists a non-increasing function satisfying , for which the following holds:
where represents the unique symmetric extension of g that maintains symmetry relative to the main diagonal and is explicitly defined as:
This class of operators is usually denoted by .
The next example illustrates the construction process of a discrete idempotent uninorm according to the previous theorem.
Example 1.
Let us consider the finite chain . Suppose that . Let
In these conditions,
In these conditions, ,
We have highlighted in bold the values at which the discrete idempotent uninorm takes the maximum value.
We have highlighted in bold the values at which the discrete idempotent uninorm takes the maximum value.Next, we recall the concept of the discrete implication function.
Definition 2
([20]). A mapping is called a discrete fuzzy implication, or simply a discrete implication, whenever the requirements stated below are satisfied:
- (I1)
- with , and .
- (I2)
- with , and .
- (I3)
- , and .
It should be noted that, according to the definition, we can deduce that and for every . However, the cases and can not be explicitly determined by these conditions.
Two notable properties of discrete implication functions that we will use in this work are
- Neutral element property
- Identity element property
Definition 3.
A negation on a finite chain is a function that is decreasing and satisfies the boundary conditions and . Such a negation is called a strong negation whenever the negation on is involutive, which implies applies to any .
Note that there is a unique strong negation on , whose expression is given by [26].
Definition 4.
Let I be a fuzzy discrete implication function defined on . The function , given by for every , is a negation on referred to as the natural negation associated with I.
We now recall the definition of residual implication induced by discrete uninorms and introduce some key results related to it.
Definition 5
([25]). Let be a discrete uninorm. The residual operator associated with U, denoted by , can be defined as follows:
Proposition 1
([25]). Let be a discrete uninorm. The associated residual operator is a fuzzy discrete implication if and only if U is conjunctive, that is, whenever .
The result below characterizes the general structure of residual implications relative to uninorms of the family in .
Proposition 2
([25]). Let be a discrete uninorm belonging to the class , having as its neutral element. It follows that the associated residual operator remains a discrete fuzzy implication, defined by:
The general structure of residual implications relative to uninorms in is given below.
Proposition 3
([18]). Let be a discrete idempotent uninorm having as its neutral element, and suppose that . It follows that the residual operator associated with defines a discrete fuzzy implication, and it is given by
Alternatively, this discrete implication function can be expressed as
Here, denotes the unique symmetric extension of with respect to the main diagonal.
Definition 6
([26]). A mapping is called a smooth mapping if, for every with , the absolute difference between consecutive values is at most one, that is, .
Definition 7
([26]). A mapping is referred to as a smooth mapping if, for every fixed , the function is smooth, and similarly, for every fixed , the function is smooth. In other words, both the vertical and horizontal sections of F must satisfy the smoothness condition.
Note that in this case the smoothness property, which is in fact the well-known 1-Lipschitz property (for more details see, Proposition 7.3.3 in [26]).
3. Modus Tollens Derived from Discrete Uninorms
This section focuses on the investigation of the U-Modus Tollens condition in a discrete setting; that is, all operators that we consider throughout the paper are defined on the finite chain .
Definition 8.
Let I be a discrete implication, U a discrete uninorm, and N a negation, all defined on the finite chain . The pair (I,N) fulfills the U-Modus Tollens property if the next condition holds:
The next result shows that a necessary condition for a discrete uninorm U to meet the requirements of the U-Modus Tollens rule in the discrete framework can be obtained.
Proposition 4.
Let I be a discrete implication and N a negation defined on the finite chain such that fulfills the U-Modus Tollens. It follows that the discrete uninorm U is required to be conjunctive.
Proof.
Let us take , ; as the pair is said to fulfill the U-Modus Tollens rule, we have
so and U has to be conjunctive. □
As a consequence of this result, only conjunctive discrete uninorms would be considered when considering the U-Modus Tollens condition.
The following example shows the behavior of the U-Modus Tollens property for a particular negation on a finite chain.
Example 2.
Let us consider U a discrete conjunctive uninorm on and the following negation:
with .
For each , the U-Modus Tollens principle is verified for every because , and we always have .
When , let us differentiate the following two cases:
- 1.
- Consider , so
- (a)
- If , we need for all in order to verify the U-Modus Tollens.
- (b)
- When ,In this case, we need because in order to ensure the U-Modus Tollens.
- 2.
- Consider , sothe U-Modus Tollens is always guaranteed.
Observe that in case , corresponds to the smallest negation on a finite chain . In case , corresponds to the greatest negation on .
We can now derive the following general result concerning the U-Modus Tollens rule for the discrete framework.
Proposition 5.
Let U be a conjunctive discrete uninorm, its residual discrete implication, and N a negation on the finite chain . Then, a discrete implication I verify the U-Modus Tollens condition related to the pair is equivalent to the condition
Proof.
According to Definition 5, we have , therefore
□
The fact that the pair satisfies the U-Modus Tollens property entails several structural consequences for the discrete uninorm and the associated negation.
Proposition 6.
Let U be a conjunctive discrete uninorm defined on with neutral element e. Assume that the pair satisfies the U-Modus Tollens property. Then the following conditions hold:
- (i)
- For every ,
- (ii)
- The inequality holds for any element . Moreover, the condition entails that .
- (iii)
- Let , then:
- (a)
- The equality entails that for every .
- (b)
- The inequality entails that for every .
- (iv)
- The validity of condition (NP), or alternatively of condition (IP) together with the requirement for every , entails that .
Proof.
Each statement will be proved separately.
- (i)
- Since , it follows directly that .
- (ii)
- According to the monotonicity of the uninorm U, we have Now, for any in such a way that , we necessarily have , sowhich implies .
- (iii)
- Define .
- (a)
- If , then whenever .
- (b)
- Suppose . For any , we getwhich implies for all .
- (iv)
- Let us assume (NP) is satisfied. If , then from Item (iii)(b) it follows that for all . However, under condition (NP), we know , which implies . Thus, , leading to a contradiction.Now, assume that (IP) holds and for every . Suppose that , meaning there exists some such that . Then,which contradicts the assumption that . Hence, whenever , and it follows that .
□
When , we obtain the following result.
Proposition 7.
Let be a discrete uninorm belonging to the family of with neutral element . Suppose that . It follows that the pair satisfies the U-Modus Tollens property, which is equivalent to the following condition:
Proof.
It is enough to verify that whenever , the U-Modus Tollens condition holds.
- (a)
- In case , it follows:since , and the uninorm behaves conjunctively in this case.
- (b)
- In case , hence:1 Observe that as , this yields (see Proposition 6), and we are in the case .
□
Now, we consider the case where the implication I satisfies the neutral element property .
Proposition 8.
Let I be a discrete implication satisfying the property, N a negation on , and U a discrete conjunctive uninorm whose neutral element is . Whenever the pair fulfills the U-Modus Tollens condition, then the following statements hold:
- (i)
- for every .
- (ii)
- for every , and whenever .
- (iii)
- whenever .
- (iv)
- Provided that N is a strictly decreasing mapping on , it follows that holds for every pair with .
Proof.
- (i)
- Since , it follows that for every . Hence, .
- (ii)
- Given that property (NP) holds, Proposition 6 (iv) implies . Then, from Proposition 6 (iii.a), we conclude whenever . Moreover, evaluating the condition at , we obtain , so . Since N is decreasing, it follows that for all .
- (iii)
- Assuming that the pair fulfills the U-Modus Tollens condition relative to U, we have:which implies for every .
- (iv)
- Suppose, for contradiction, that there exist for which and . Observe that , since if , then , which contradicts . From part (ii), we know , and because N exhibits a strict monotonic decrease over , we obtain:which contradicts the assumption that the U-Modus Tollens holds. Therefore, it must be that whenever .
□
What follows gives a description of the essential features of those discrete uninorms in for which the U-Modus Tollens holds, under the assumptions that N is strictly decreasing in and I satisfies the property.
Theorem 3.
Let I be a discrete implication function satisfying , and let be a discrete uninorm in the class , with neutral element . Assume also that N is a negation on that is strictly decreasing on the interval . It follows that the pair satisfies the U-Modus Tollens property, which is equivalent to the fulfillment of the following conditions:
- (i)
- whenever .
- (ii)
- for every , and whenever .
- (iii)
- for every .
- (iv)
- The functions and fulfill the Modus Tollens property in relation to for all , taking into account the modified implication and the adjusted negation are defined by
Proof.
Suppose that the pair verifies the U-Modus Tollens property; by (i), (ii), and (iii) of Proposition 8, we obtain (i), (ii), and (iii) of this proposition. Now, let us see that (iv) is also satisfied.
- In case , we have2 by Proposition 6 (ii).3 because .
- In case , observe that ; we havebecause the final inequality is ensured by the U-Modus Tollens requirement fulfilled by I and N.
As I verifies (NP), we obtain , and therefore, by Proposition 7, it remains to check that I and N verify the U-Modus Tollens whenever and the constraints (i), (ii), (iii), and (iv) hold.
We distinguish the following separate cases:
- In case , then
- In case , thenwhere the ultimate inequality holds by condition (iv).
- In case , then , and therefore,in this expression, the last inequality follows from the Condition (i) of this proposition.
□
Next, we provide an illustrative example of the previous result.
Example 3.
Let us consider a discrete uninorm belonging to the class , where Łis the ukasiewicz t-norm, and is an arbitrary t-conorm. Define the negation as follows:
Additionally, consider the fuzzy implication described by the expression:
A direct verification shows that the given operators meet all the specified requirements stated in Theorem 3. Consequently, the pair satisfies the U-Modus Tollens property (see Figure 3).
Figure 3.
Graphical representation of the fuzzy negation (left) and the fuzzy implication (right). It can be seen in the representation that the negation function is strictly decreasing on and that the discrete implication function satisfies (NP).
In what follows, we focus on RU-implications generated by discrete uninorms belonging to the class , specifically those of the form , where is the neutral element, is a t-norm on , and is a t-conorm on . It is worth highlighting that RU-implications associated with such uninorms exhibit the structure described in Equation (7).
3.1. Modus Tollens in the Context of Discrete RU-Implications Induced by Discrete Uninorms in
In this section, it is important to remember the characterization of the residual operator associated with a uninorm given in the Preliminaries section (see Equation (7)).
For this type of RU-implication, it is once again observed that the U-Modus Tollens property holds exclusively in the case that the associated negation N satisfies , which necessarily results in those negations that are non-smooth. In addition, for these RU-implications, the results presented below hold.
Proposition 9.
Let be a discrete implication derived from the discrete uninorm , and let N be a negation on . Consider also a discrete conjunctive uninorm. If the pair satisfies the U-Modus Tollens property, then the following statements hold:
- (i)
- for every .
- (ii)
- for every .
- (iii)
- ; that is, for every .
- (iv)
- In case , then for every .
- (v)
- In case , and if is a smooth t-norm with , then it holds that for all , and in particular for every .
Proof.
- (i)
- As fulfills the U-Modus Tollens condition, we havefor all . Now, putting and considering Equation (7), we achieve for all .
- (ii)
- For any , we have considering Equation (7); therefore, taking ,and on the other side, is always satisfied.
- (iii)
- It follows directly from Proposition 6.
- (iv)
- Taking in Property (i) of this proposition, it follows that , and as N is decreasing, we have for all .
- (v)
- Let us examine that for all . Since is smooth and is an idempotent element, considering that with , then4 by the smoothness of .And by property (i) of this Proposition,which is a contradiction to the hypotheses. Therefore, we obtain for all . Now, let us prove that . As we have , then
□
For the purpose of characterizing the solutions in this setting, we consider three distinct cases, taking into account the relationship between the neutral elements e and . We first address the simplest case, where .
Theorem 4.
Let be the RU-implication associated with the discrete uninorm , let N be a negation on a finite chain, and let be a discrete conjunctive uninorm with as its neutral element. Consequently, the pair satisfies the U-Modus Tollens property is equivalent to the fulfillment of the following condition:
- (i)
- and for all .
- (ii)
- for every , and for all .
- (iii)
- The residual implication , together with the modified negation defined in Equation (12), satisfies the Modus Tollens property in relation to the t-norm , for all .
Proof.
(⇒) Items (i) and (ii) are obtained from Proposition 9. Property (iii) follows the same proof that the one in Theorem 3, considering that in this case, just is the same that in Equation (11).
(⇐) Now, let us suppose that conditions (i), (ii), and (iii) are satisfied, and we will prove the U-Modus Tollens:
(i) If , then by (iv) in Proposition 9, we have and the U-Modus Tollens is satisfied. (ii) In case and , we obtain that , so
5 by (ii) of Proposition 9.
(iii) Now, considering and . We consider two cases:
(1) , then we have
And (2) , then considering (iv) in Theorem 3 and Equation (7)
6 by (iii) of this theorem. □
Remark 1.
Note that the t-conorms and do not contribute to fulfilling the U-Modus Tollens.
The next example illustrates Theorem 4.
Example 4.
Let us consider the finite chain and the uninorm on whose expression is
Now consider the conjunctive uninorm U on whose expression is
Let N be the negation on defined as
According to Equation (12), the expression of the adjusted negation on is
It can be easily verified that and for all . Therefore, Condition (i) of Theorem 4 is satisfied. By construction, the function N satisfies the conditions of item (ii). It can be seen that for every , and that for all . Finally, by construction, the function N satisfies the conditions of item (ii). It can be seen that for every , and that for all . The pair verifies Modus Tollens with respect to the t-norm , for all by Proposition 12 of [22].
Based on the previous reasoning and according to Theorem 4, the pair satisfies the U-Modus Tollens property.
Theorem 5.
Let be the RU-implication derived from the discrete uninorm , let N be a negation on , and let be a discrete conjunctive uninorm with neutral element e, such that . Assume that is defined as follows:
where and are discrete t-norms defined on and , respectively. Then, the pair satisfies the U-Modus Tollens property if and only if the following conditions are satisfied:
- (i)
- for all , and for all .
- (ii)
- for every , and for all .
- (iii)
- The implication , derived from the t-norm , and the negation defined by Equation (12), verifies the Modus Tollens property with respect to the t-norm whenever .
Proof.
Remark 2.
Note that the expression of given by Equation (13) is not a strong condition. Indeed, if we consider a smooth t-norm on and we suppose that , we known is an ordinal sum of Łukasiewicz t-norms [26].
Theorem 6.
Let be the RU-implication derived from the discrete uninorm , N a negation on , and a discrete conjunctive uninorm with neutral element e and . Suppose that the restriction of U to the domain is defined as
Then and N verify the U-Modus Tollens condition precisely when the following properties are satisfied:
- (i)
- for all and whenever .
- (ii)
- for all and for all .
- (iii)
- and fulfill the Modus Tollens relative to the t-norm for every , where denotes the residual implication associated with the t-norm and is given by
Proof.
Property (ii) follows directly from Property (v) in Proposition 9, while (i) and (iii) follow the proof in a similar way to the theorems before. □
3.2. On Modus Tollens for RU-Implications Generated by Discrete Idempotent Uninorms
In this section, we consider RU-implications derived from discrete idempotents uninorms, i.e., uninorms with neutral element such that . Let us remember that in the discrete case, the general structure of the RU-implications derived from idempotent uninorms is given by Proposition 3.
Initially, we will see what happens when we consider the residual implication of a discrete idempotent uninorm such that its symmetric extension is a negation on .
Proposition 10.
Let be a discrete idempotent uninorm with neutral element , and assume that its symmetric extension defines a negation on . Let be the residual discrete implication associated with . Consider also U, a discrete conjunctive uninorm with neutral element e, and let denote its corresponding residual implication. Then, the following statements are equivalent:
- (i)
- Let us denote . The pair satisfies U-Modus Tollens.
- (ii)
- whenever .
Proof.
Let us see that conditions (i) and (ii) are equivalent.
Let us suppose that the pair satisfies U-Modus Tollens, so
equivalently,
but
□
In the following, we consider the case of chains with an odd number of elements, such as . Note that in this case, the element is the central point of this finite chain. For instance, if we consider the linguistic chain (which corresponds to the odd finite chain ), the linguistic term “regular” acts as an uncertainty element, i.e., for a uninorm acting on an odd-valued chain, the uninorm on the “regular” value does not get a clear decision.
Lemma 1.
Let be a discrete idempotent uninorm with neutral element defined on the odd finite chain , under the condition that is the unique strong negation on . Let be its residual fuzzy implication. Then,
for all .
Proof.
Let us remember that
In case ,
In case ,
□
An extended result of Proposition 10 can be obtained when considering a finite odd chain .
Proposition 11.
Let be an odd finite chain, the strong negation on , a discrete idempotent uninorm with neutral element and and let denote its residual implication. Let U be a discrete conjunctive uninorm with neutral element , and let be its corresponding residual implication. Then, the following statements are equivalent:
- (i)
- The pair satisfies U-Modus Tollens.
- (ii)
- for all
- (iii)
- for all .
Proof.
First, note that . The equivalence between statement (i) and condition (ii) follows directly from Proposition 10. We need to prove the equivalence between statements (ii) and (iii). By Lemma 1, we have that for all
Considering Lemma 1 and Condition (ii), we have
for all .
Therefore,
for all ,
(1) By Definition of with , in this case, with ; therefore,
equivalently,
□
The result obtained in Proposition 11 is not true when the negation is not a strong negation on , as the following example shows.
Example 5.
Let be an odd finite chain. Let us consider and be a discrete idempotent uninorm with , where
an its extension,
is a negation function with fixed point . We can see the structures of uninorms and in Figure 4.
Figure 4.
Structures of the uninorms (left) and and (right). Note that in the case of the uninorm U, the underlying t-norm is the minimum t-norm and the underlying t-conorm is the Łukasiewicz t-conorm.
Let us consider the points and . Then, we have
Theorem 7.
Let be a discrete idempotent uninorm with neutral element such that is a negation on . Let N be a negation having as its fixed point, and let U be a discrete uninorm whose neutral element coincides with . Then, the pair satisfies the U-Modus Tollens property if and only if the following conditions are fulfilled:
- (i)
- whenever .
- (ii)
- whenever .
- (iii)
- whenever
- (iv)
- whenever .
Proof.
Suppose that the pair fulfills the U-Modus Tollens. Then,
Let us see that conditions (i)–(iv) are verified.
- (i)
- Taking , we achieve,If ,7 if then .therefore,Similarly, the case can be obtained as before.
- (ii)
- Considering in Equation (10) and bearing in mind that , we obtainwe have that , and considering (i) then
- (iii)
- The proof is similar to item (ii), taking into account that for , we have .
- (iv)
- Now, let us suppose ; therefore, as , we obtain , and by Equation (10)
On the other hand, assume that conditions (i)–(iv) are verified, and we will demonstrate that the pair satisfies the U-Modus Tollens property by analyzing several cases separately:
- Case 1. Let us suppose . Then, we obtain with , thensince the ultimate equality holds by virtue of Assumption (ii) of this proposition.
- Case 2. Let us suppose . Accordingly, we have that with , thenas the last equality is a consequence of Assumption (iii) of this proposition.
- Case 3. We consider now . In this situation, it follows that and , where the first inequality comes from item (i) of this proposition, and . Therefore,since the last step is justified by condition (iv) of this proposition.
- Case 4. We consider , finally. In this situation, it follows that , , and . Now, we take into account two possibilities:
- (a)
- Let us suppose ; in this situation, it follows that and . Considering condition (iv) of this proposition with , we obtain Therefore,
- (b)
- When , we proceed as in the case before.
□
Note that in Theorem 7, uninorm U is any discrete uninorm, and N is any negation on with fixed element . The following result shows two particular cases.
Proposition 12.
Let be a discrete idempotent uninorm with neutral element , and assume that its symmetric extension defines a negation on . Let N be another negation on whose fixed point is also , and let U be a discrete uninorm with neutral element .
If belongs to the class and the underlying t-conorm is , then the pair satisfies the U-Modus Tollens property if and only if the inequality holds for every .
Proof.
Let us suppose that the pair verifies the U-Modus Tollens. We have
By Theorem 7, we achieve for every through condition (i).
Reciprocally, if for all , only Conditions (ii)–(iv) in Theorem 7 must be proven.
In case , observe and ; therefore,
and therefore condition (ii) of Theorem 7 holds.
Alternatively, in the case , observe ; therefore,
and therefore condition (iii) of Theorem 7 is satisfied.
Whenever , it follows that , and we assume for all ; therefore,
and therefore, as conditions (i)–(iv) of Theorem 7 hold, the U-Modus Tollens is satisfied. □
In the particular case that the chain has an odd number of elements with being the neutral element that is located in such a way that it divides the chain into two parts with the same number of elements, i.e., is the central element of the chain, we can obtain the following result.
Proposition 13.
Let be an odd finite chain, and let be a discrete idempotent uninorm with neutral element , such that its symmetric extension defines a negation on . Now consider to be another discrete idempotent uninorm with the same neutral element , and suppose that the symmetric extension corresponds to the unique strong negation on . Then, the residual implication together with the negation satisfies the U-Modus Tollens property if and only if the inequality holds for every .
Proof.
Similar to Proposition 12 let us suppose that and N fulfills the U-Modus Tollens property relative to U, we have
by Theorem 7 we obtain for all through condition (i).
Reciprocally, if for all we only have to see that the properties (ii) to (iv) in Theorem 7 hold. As N is strong and U is idempotent, it is achieved that and therefore conditions (iii) and (iv) in Theorem 7 hold. On the other hand, whenever we have , , so
Condition (ii) in Theorem 7 is also guaranteed. □
Another interesting case is the one of RU-implications constructed from idempotent uninorms of the form , where is the neutral element, , and the symmetric extension satisfies for some . In the following, we analyze two cases: the one where and the one where , where is the neutral element of uninorm U. Note that in both cases due to the decrease in .
Theorem 8.
Let be a discrete idempotent uninorm with neutral element , such that and the symmetric extension satisfies . Let N be a negation on , and let U be a discrete uninorm with neutral element e, where . Then, the pair satisfies the U-Modus Tollens property if and only if the following conditions are met:
- (i)
- for every .
- (ii)
- for every , and for every .
- (iii)
- for every .
Proof.
Assume that the pair fulfills the U-Modus Tollens property, and let us prove properties (i) to (iii).
- (i)
- For all and , we have , and consideringand therefore, for all .
- (ii)
- Considering in condition (i), we have and therefore N(x) = 0 for all because of the decreasingness of N. The case for all is derived from Proposition 9 because for all .
- (iii)
- Takingwhere the last equality holds due to the fact that for every , as a consequence of the symmetry of g. Furthermore, since any uninorm U satisfies , it follows that the equality is achieved for all . Conversely, assume that conditions (i) to (iii) are satisfied. We will now show that the pair fulfills the U-Modus Tollens property related to U.Case . Then by item (ii), and the U-Modus Tollens holds. Now, as U belongs to the class of conjunctive uninorms,Case . Two cases are considered:
- (1)
- If then
- (2)
- If then
□
Example 6.
Let be a discrete idempotent uninorm with neutral element , such that and its symmetric extension satisfies . Now take any value , and define the uninorm . Consider also the following negation on a finite chain
Then, U and verify all conditions in Theorem 8, and therefore, the pair verifies the U-Modus Tollens.
Now, we consider the case . We restrict the case to even under such restriction we obtain a characterization subjected to five conditions.
Theorem 9.
Let be a discrete idempotent uninorm with neutral element , such that , and the symmetric extension satisfies .
Let N be a negation on a finite chain, and let U be a discrete uninorm whose neutral element is . Then, the pair satisfies the U-Modus Tollens property if and only if the following conditions are met:
- (i)
- for every .
- (ii)
- for every .
- (iii)
- for every .
- (iv)
- for every x such that .
- (v)
- for every x such that , and also for every with .
Proof.
Assume that and N satisfy the U-Modus Tollens property relative to the uninorm U. We now proceed to prove that conditions (i) through (v) hold.
- (i)
- Taking we have,, therefore for every .
- (ii)
- This conclusion is derived directly from Proposition 6 ((iii) (a)) because for every .
- (iii)
- Taking , we obtain,But in the case , it is verified that , and then,
- (iv)
- In case ,
- (v)
- IfIf and then,
Reciprocally, let us assume that conditions (i) to (v) hold, and let us see that the pair satisfies U-Modus Tollens considering some cases.
(i) Whenever , then and . Therefore,
where the last equality follows by Property (iii) of this theorem.
(ii) If , then by property (v) we obtain,
(iii) In case , we get
by property (iv).
(iv) In case , then , and we differentiate two possibilities:
(iv.1) Case : considering property (i), we achieve .
(iv.2) Case : therefore, due to property (v). □
4. Conclusions
In this paper, we have explored the logical principles of Modus Tollens (MT) within the framework of discrete uninorms. Our study has provided a detailed analysis of the conditions under which discrete implication functions satisfy this fundamental inference rule.
One of the key findings is the characterization of U-conditional discrete implications, which establish a connection between residual discrete implications, discrete negations, and discrete conjunctive uninorms. The necessary and sufficient conditions derived in this work ensure that discrete uninorm-based implications adhere to logical consistency in inference processes. Moreover, it is studied through the use of discrete residual implication functions derived from uninorms belonging to two of the most important families of these discrete operators ( and ). The work explores the properties these operators must satisfy and provides some characterizations of Modus Tollens within this domain of definition. Additionally, we have analyzed the impact of different neutral elements in discrete uninorm structures and their role in defining valid discrete implication functions.
Our research contributes to the understanding of logical reasoning in discrete fuzzy systems, particularly in contexts where traditional continuous approaches may not be applicable. The results obtained provide a solid foundation for further studies in fuzzy logic, artificial intelligence, and mathematical logic.
As future research, we will investigate the Modus Ponens-Tollens property, that is, under what conditions Modus Ponens and Modus Tollens are verified at the same time in this discrete setting.
Author Contributions
Conceptualization, methodology, and formal analysis, I.A., P.F.-P. and J.V.R.; writing—original draft, review and editing, I.A., P.F.-P. and J.V.R. All authors have read and agreed to the published version of the manuscript.
Funding
P. Fuster-Parra is partially supported by the project Ministerio de Ciencia, Innovación y Universidades with the project PID2022-139248NB-I00 funded by MCIN/AEI/10.13039/501100011033 and “ERDF A way of making Europe”.
Informed Consent Statement
Not applicable.
Data Availability Statement
The research reported in this article did not involve the use of any data.
Conflicts of Interest
The authors state that they have no financial or personal relationships that could have inappropriately affected or influenced the content of this article.
Abbreviations
The following abbreviations are used in this manuscript:
| Finite chain | |
| N | Negation on the finite chain |
| I | Discrete fuzzy implication function |
| Ł | Łukasiewicz t-norm on |
| Łukasiewicz t-conorm on | |
| U | Discrete uninorm |
| Family of uninorms whose expression is given by Equation (1) | |
| An uninorm of the family | |
| Family of idempotent uninorms whose expression is given by Equation (2) | |
| An uninorm of the family | |
| Modus Tollens condition | |
| U-Modus Tollens condition |
References
- Zadeh, L. Fuzzy Sets. Inf. Control 1965, 8, 338–353. [Google Scholar] [CrossRef] [Scilit]
- Hájek, P. Metamathematics of Fuzzy Logic; Kluwer Academic Publishers: Alphen aan den Rijn, The Netherlands, 2008. [Google Scholar] [CrossRef] [Scilit]
- Baczynski, M.; Jayaram, B. Fuzzy Implications from Fuzzy Logic Operations. In Fuzzy Implications; Studies in Fuzziness and Soft Computing; Springer: Berlin/Heidelberg, Germany, 2008; Volume 231. [Google Scholar] [CrossRef] [Scilit]
- Beliakov, G.; Pradera, A.; Calvo, T. Aggregation Functions: A Guide for Practitioners; Studies in Fuzziness and Soft Computing; Springer: Berlin/Heidelberg, Germany, 2010. [Google Scholar] [CrossRef] [Scilit]
- Calvo, T.; Mayor, G.; Mesiar, R. Aggregation Operators; Studies in Fuzziness and Soft Computing; Springer: Berlin/Heidelberg, Germany, 2002. [Google Scholar] [CrossRef] [Scilit]
- Grabisch, M.; Marichal, J.L.; Mesiar, R.; Pap, E. Aggregation Functions; Encyclopedia of Mathematics and its Applications; Cambridge University Press: Cambridge, UK, 2009. [Google Scholar] [CrossRef] [Scilit]
- Mas, M.; Monserrat, M.; Torrens, J.; Trillas, E. A survey on fuzzy implication functions. IEEE Trans. Fuzzy Syst. 2007, 15, 1107–1121. [Google Scholar] [CrossRef] [Scilit]
- Trillas, E.; Mas, M.; Monserrat, M.; Torrens, J. On the representation of fuzzy rules. Int. J. Approx. Reason. 2008, 48, 583–597. [Google Scholar] [CrossRef] [Scilit]
- Mei, J.; Xiaohong, Z. Pseudo-Quasi Overlap Functions and Related Fuzzy Inference Methods. Axioms 2023, 12, 217. [Google Scholar] [CrossRef] [Scilit]
- Minxia, L.; Wenling, L.; Hongyan, S. The Relationship between Fuzzy Reasoning Methods Based on Intuitionistic Fuzzy Sets and Interval-Valued Fuzzy Sets. Axioms 2022, 11, 419. [Google Scholar] [CrossRef] [Scilit]
- Cao, J.; Zhou, T.; Zhi, S.; Lam, S.; Ren, G.; Zhang, Y.; Wang, Y.; Dong, Y.; Cai, J. Fuzzy inference system with interpretable fuzzy rules: Advancing explainable artificial intelligence for disease diagnosis—A comprehensive review. Inf. Sci. 2024, 662, 120212. [Google Scholar] [CrossRef] [Scilit]
- Madrid, N.; Ojeda-Aciego, M. The f-index of inclusion as optimal adjoint pair for fuzzy modus ponens. Fuzzy Sets Syst. 2023, 466, 108474. [Google Scholar] [CrossRef] [Scilit]
- Kawaguchi, M.F.; Ohno, T.; Tachibana, H.; Miyakoshi, M.; Da-Te, T. Modus ponens and modus tollens under the compositional rule of inference with triangular norms. In Proceedings of the IEEE 5th International Fuzzy Systems Conference, New Orleans, LA, USA, 11 September 1996; Volume 2, pp. 912–917. [Google Scholar] [CrossRef] [Scilit]
- Trillas, E.; Alsina, C.; Pradera, A. On MPT-implication functions for Fuzzy Logic. Rev. Real Acad. Cienc. Ser. A Mat. 2004, 98, 259–271. [Google Scholar]
- Aguiló, I.; Riera, J.V.; Suñer, J.; Torrens, J. Modus Tollens with respect to uninorms: U-Modus Tollens. Int. J. Approx. Reason. 2020, 127, 54–69. [Google Scholar] [CrossRef] [Scilit]
- Mas, M.; Monreal, J.; Monserrat, M.; Riera, J.V.; Torrens, J. Modus Tollens on Fuzzy Implication Functions Derived from Uninorms. In Fuzzy Logic and Information Fusion; Studies in Fuzziness and Soft Computing; Springer: Berlin/Heidelberg, Germany, 2016; Volume 339. [Google Scholar] [CrossRef] [Scilit]
- Morente-Molinera, J.; Pérez, I.; Ureña, M.; Herrera-Viedma, E. On multi-granular fuzzy linguistic modeling in group decision making problems: A systematic review and future trends. Knowl.-Based Syst. 2015, 74, 49–60. [Google Scholar] [CrossRef] [Scilit]
- Baets, B.D.; Fodor, J.; Ruiz-Aguilera, D.; Torrens, J. Idempotent uninorms on finite ordinal scales. Int. J. Uncertain. Fuzziness Knowl.-Based Syst. 2009, 17, 1–14. [Google Scholar] [CrossRef] [Scilit]
- Mas, M.; Mayor, G.; Torrens, J. t-Operators and uninorms on a finite totally ordered sets. Int. J. Intell. Syst. 1999, 14, 909–922. [Google Scholar] [CrossRef] [Scilit]
- Mas, M.; Monserrat, M.; Torrens, J. S-implications and R-implications on a finite chain. Kybernetika 2004, 40, 3–20. [Google Scholar]
- Mas, M.; Monserrat, M.; Torrens, J. On two types of discrete implications. Int. J. Approx. Reason. 2005, 40, 262–279. [Google Scholar] [CrossRef] [Scilit]
- Mas, M.; Monserrat, M.; Torrens, J. Modus ponens and modus tollens in discrete implications. Int. J. Approx. Reason. 2008, 49, 422–435. [Google Scholar] [CrossRef] [Scilit]
- Ruiz, D.; Torrens, J. A characterization of discrete uninorms having smooth underlying operators. Fuzzy Sets Syst. 2015, 359, 44–58. [Google Scholar] [CrossRef] [Scilit]
- Munar, M.; Couceiro, M.; Massanet, S.; Ruiz-Aguilera, D. A survey on the enumeration of classes of logical connectives and aggregation functions defined on a finite chain, with new results. Fuzzy Sets Syst. 2024, 490, 109023. [Google Scholar] [CrossRef] [Scilit]
- Mas, M.; Mayor, G.; Monserrat, M.; Torrens, J. Residual Implications from Discrete Uninorms. A Characterization. In Enric Trillas: A Passion for Fuzzy Sets; Magdalena, L., Verdegay, J., Esteva, F., Eds.; Studies in Fuzziness and Soft Computing; Springer: Cham, Switzerland, 2015; pp. 27–40. [Google Scholar] [CrossRef] [Scilit]
- Mayor, G.; Torrens, J. 7—Triangular norms on discrete settings. In Logical, Algebraic, Analytic, and Probabilistic Aspects of Triangular Norms; Klement, E.P., Mesiar, R., Eds.; Elsevier Science: Amsterdam, The Netherlands, 2005; pp. 189–230. [Google Scholar] [CrossRef] [Scilit]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2026 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license.



