Abstract
The logic sqŁ* is closely related to complex fuzzy sets. In this paper, we continue our study on sqŁ* by establishing a system that includes all formulas with values in sqŁ*. This system has paraconsistent formulas within sqŁ*. Moreover, we show that this logical system is both sound and weakly complete.
MSC:
03B52; 03G25
1. Introduction
As a natural extension of Łukasiewicz infinite-valued propositional logic Ł, the logic Ł* was first introduced by Chang [1]. Subsequently, Lewin et al. investigated this logical system further and showed that Ł* is both sound and complete [2]. In fact, the original motivation for investigating the logical system Ł* was to extend the truth values of Łukasiewicz infinite-valued propositional logic Ł from the real unit interval to the real closed interval . In [1], Chang introduced that , where and for any , the algebra is an MV*-algebra. Consider the matrix ; a formula is a tautology in Ł* iff its evaluation on always belongs to . In [3], Lewin and Sagastume pointed out that there is a formula such that for any evaluation e, . Because , we have . This means that if is a tautology, then is also a tautology. Moreover, they showed that does not hold in Ł*, so Ł* is paraconsistent [4]. Based on these facts, the system was established, which is the paraconsistent fragment of Ł*, and the soundness and completeness of were discussed [3].
In order to characterize the algebraic structures of quantum computational logic, Ledda et al. introduced quasi-MV algebras in [5]. Afterward, Bou et al. [6] established the logical system qŁ associated with quasi-MV algebras and showed that the logical system qŁ is sound and complete. Note that the domain of truth values in qŁ is ; it is natural to consider extending the domain to . Inspired by this, Jiang and Chen proposed quasi-MV* algebras as the generalization of MV*-algebras and quasi-MV algebras [7]. Recent investigations [8,9] show that quasi-MV algebras and quasi-MV* algebras are related to complex fuzzy logic [10,11]. In order to study further, Cai and Chen introduced strong quasi-MV* algebras as the algebraic characterization of complex fuzzy sets. Since the connective implication is more suitable to construct a logical system, they also introduced strong quasi-Wajsberg* algebras [12] and proved that strong quasi-Wajsberg* algebras are termwise equivalent to strong quasi-MV* algebras. The standard strong quasi-Wajsberg* algebra is , where
Denote sqŁ* the logical system associated with strong quasi-Wajsberg* algebras and consider the matrix ; a formula is a tautology in sqŁ* iff its evaluation on always belongs to . Similarly to the logic Ł*, for any evaluation e and a formula , if , then , so both and are tautologies. However, even if and take the value , the formula still takes a negative value, when takes the negative value; we have that is not a tautology in sqŁ*. Therefore, does not hold in sqŁ* and then sqŁ* is paraconsistent.
Hence, in this paper, we want to axiomatize the system of all those formulas that are paraconsistent in sqŁ*. This paper is organized as follows. In Section 2, we recall some definitions and results that relate to strong quasi-Wajsberg* algebras and sqŁ*. In Section 3, we axiomatize the paraconsistent fragment of sqŁ* and discuss the soundness and completeness of this system. Finally, a conclusion is given.
2. Preliminary
In this section, we recall some definitions and results that are relevant to strong quasi-Wajsberg* algebras and the logical system sqŁ*. Here, the algebras and the logical system are in language .
Definition 1
([12]). Let be an -algebra. If the following conditions are satisfied for any ,
(QW*1) ,
(QW*2) ,
(QW*3) ,
(QW*4) ,
(QW*5) ,
(QW*6) ,
(QW*7) ,
(QW*8) ,
(QW*9) ,
(QW*10) ,
(QW*11) ,
in which ones define , , and , then is called a strong quasi-Wajsberg* algebra.
We abbreviate a strong quasi-Wajsberg* algebra as and denote the variety of all strong quasi-Wajsberg* algebras by .
Given a strong quasi-Wajsberg* algebra S, we have proved that for any in [13]. Denote for any , then we have from (QW*6). Moreover, we defined a binary relation as iff for any ; the relation ≤ is quasi-ordering [13].
Proposition 1
([13]). Let S be a strong quasi-Wajsberg* algebra. Then for any , we have
(1) ,
(2) if and , then ,
(3) ,
(4) and ,
(5) .
In [12], an -term is called regular if contains → or 1. Given a regular -term , we have proved that for any -term , is valid in all strong quasi-Wajsberg* algebras, i.e., is valid in all strong quasi-Wajsberg* algebras. Furthermore, if is not regular, then we call it non-regular, and then we can get that is the one belonging to the set is a variable and .
Proposition 2
([12]). Let t and s be -terms. Then iff .
Below, we recall some contents of the logic sqŁ*, which is associated with strong quasi-Wajsberg* algebras.
Let V be the propositional variables set and the formulas set generated by V with language . Then is a free algebra. For any , the notation stands for and . Furthermore, we use the following abbreviations: for any ,
The axioms and deduction rules of are defined as follows.
- Axioms schemas
(Q1) ,
(Q2) ,
(Q3) ,
(Q4) ,
(Q5) ,
(Q6) ,
(Q7) ,
(Q8) ,
(Q9) ,
(Q10) .
- Rules of deduction
(qMP) ,
(Reg) ,
(AReg1) ,
(AReg2) ,
(AReg3) ,
(AReg4) ,
(Inv1) ,
(Inv2) ,
(Flat) ,
(R2′) ,
(R3′) .
Definition 2.
Let be a set of formulas. If is a sequence of formulas such that one of the following cases holds:
(1) is an axiom,
(2) ,
(3) is obtained by and for some with the rules of deduction,
then the sequence is called a proof from to and denoted by . If there is a sequence from Γ to , then is called a provable formula from Γ. Especially if , the provable formula is called a theorem and denoted by .
In order to discuss the soundness and completeness of the logic sqŁ*, it is necessary to introduce the following basic semantical notions.
Definition 3.
Let S be a strong quasi-Wajsberg* algebra. The pair is an -matrix where F is a subset of S.
Definition 4.
Let be a strong quasi-Wajsberg* algebra. A mapping is called an -valuation if the following conditions are satisfied for any ,
(1) ,
(2) ,
(3) .
Remark 1.
For any -valuation e, we have for .
Definition 5.
Let be a set of formulas. Then φ is a semantical consequence of Γ with respect to matrix if for each -valuation e, we have that whenever .
If is a semantical consequence of with respect to the matrix , then it is denoted by . Especially if , then it is denoted by .
For any strong quasi-Wajsberg* algebra S, the set is a subset of S, and then is a matrix. We have shown the following result.
Theorem 1
([12]). iff .
3. The Logic sq
In this section, we introduce an axiomatization for all those formulas of the logic sqŁ* that take value for any valuation. This system is denoted by sq, and the soundness and completeness of sq are discussed mainly.
The axioms and deduction rules of sq are defined as follows.
- Axioms schemas
(Q1) ,
(Q2) ,
(Q3) ,
(Q4) where and ,
(Q5) ,
(Q6) ,
(Q7) where ,
(Q8) ,
(Q9) .
- Rules of deduction
(qMP) ,
(Reg) ,
(AReg1) ,
(AReg2) ,
(AReg3) ,
(AReg4) ,
(Neg1) ,
(Neg2) ,
(TR) ,
(qK*) .
Theorem 2.
For any , the following hold in sq.
(1) .
(2) If and , then .
(3) , .
(4) .
Proof.
- (1)
- Hence, .
- (2)
- If and , then
- (3)
- Hence, , .
- (4)
- Hence .
□
Theorem 3.
For any , the following hold in sq.
(1) If , then .
(2) If and , then .
(3) If and , then .
(4) .
(5) .
(6) Suppose that β is obtained from α by replacing the subformula in α with . If , then .
(7) .
(8) .
(9) .
(10) and .
(11) and .
(12) .
(13) and .
Proof.
According to Theorem 2 (3), the rule (R2′) holds in sq. The Proofs of (1)–(13) are similar to Proposition 4.1 in [12]. □
In the following, we derive some theorems of sq in order to discuss the completeness of sq.
Theorem 4.
For any , the following hold in sq.
(1) .
(2) .
(3) and .
(4) .
(5) and .
(6) and .
(7) .
(8) .
(9) .
Proof.
- (1)
- (2)
- Since and , we have .
- (3)
- Hence, . Similarly, we can prove .
- (4)
- From (Q4), we have . Then by Theorem 3 (13), (1), and (Q3), we get that .
- (5)
- Since , it turns out that . Similarly, we can prove .
- (6)
- From (4), we have . Then by (Q2), (Q3), Theorem 3 (6), Theorem 3 (3), and Theorem 3 (9), we get that . Similarly, we can prove .
- (7)
- Since , we get that applying Theorem 3 (6), Theorem 3 (11), Theorem 3 (13), (Q3), (1), (5), (6), and (AReg1).
- (8)
- Hence .
- (9)
□
Theorem 5.
For any , the following hold in sq.
(1) .
(2) .
(3) .
(4) .
Proof.
- (1)
- So . Furthermore, we haveSo . Hence, .
- (2)
- Hence, .
- (3)
- Hence, .
- (4)
- From (Q5) and Theorem 3 (4), we have . If and , then we have and from (3). Since , we have by Theorem 3 (6), it follows that . Applying (2), we have , so .
□
In the following, we discuss the soundness and completeness of sq. Let be a set of formulas. For any strong quasi-Wajsberg* algebra , if always holds, then we denote it by .
Theorem 6.
If , then .
Proof.
Suppose that . Then we only need to prove that for any strong quasi-Wajsberg* algebra S, . From Definition 2, is one of the following cases:
(1) is an axiom of sq. Then we need to verify that all the axioms take value 0 for any valuation. If is the axiom (Q1), then we may assume that . For any strong quasi-Wajsberg* algebra and any S-valuation e, we have . From (QW*1), we get that , so , i.e., . The case that is the axiom in (Q2)–(Q9) can be proved similarly.
(2) . Then it is obvious that .
(3) is derived from axioms and applying the rules of deduction. Then we need to verify that for any strong quasi-Wajsberg* algebra and any S-valuation e, the rules keep .
(qMP) Suppose that and . Then we have and then by Proposition 1 (3). Since , we have .
(Reg) Suppose that . Then we have , it turns out that .
(AReg1) Suppose that . Then we have , it turns out that .
(AReg2) Suppose that . Then we have , it turns out that .
(AReg3) Suppose that . Then we have , it turns out that .
(AReg4) Suppose that . Then we have , it turns out that .
(Neg1) Suppose that . Then , it turns out that .
(Neg2) Suppose that . Then , it turns out that . Hence, .
(TR) Suppose that . Then we have and from Proposition 1 (1). Since and by Proposition 1 (4) and Proposition 1(5), it follows that and . So by Proposition 1 (2), and then . Hence, .
(qK*) Suppose that . Then we have and from Proposition 1 (3), it turns out that .
Therefore, if , then . □
Corollary 1.
If , then .
Below, we show a weak completeness theorem of sq. That is, if a formula’s value is always , then it is a theorem in sq.
Theorem 7.
If , then .
Proof.
Suppose that . Then for any strong quasi-Wajsberg* algebra and any S-valuation e, we have . We claim that is regular. If not, we may assume that , where p is a variable and . Define an SW*-valuation e such that . Then ; this is a contradiction. Furthermore, we get ; it follows that . Now, according to Theorem 1, we have that implies , and then implies .
Below, we prove that implies . Since , we have that is one of the following two cases.
(1) is an axiom of sqŁ*.
If is an axiom in (Q1)–(Q9). Then is obvious. So we have from Theorem 4 (3).
If is the axiom (Q10). Then we can assume that .
Since , we have .
Therefore, if is the axiom of sqŁ*, then we get that .
(2) is obtained from axioms applying the rules of sqŁ*.
Suppose that is obtained from (qMP). We may assume that , , where , are axioms of sqŁ* and . Then we have and from (1). Since , we have from Theorem 3 (6), Theorem 2 (1), and (AReg1). Hence, applying Theorem 5 (2), we have , i.e., .
Suppose that is obtained from (Reg). We may assume that , where is an axiom of sqŁ* and . Then we have from (1). Since , we have from Theorem 3 (6), it follows that by Theorem 2 (1) and (AReg1), i.e., .
Suppose that is obtained from (AReg1). We may assume that , where is an axiom of sqŁ* and . Then we have from (1). Since , we have from Theorem 3 (6). Then applying Theorem 2 (1) and (AReg1), we get that , i.e., .
The cases that is obtained from (AReg2), (AReg3), or (AReg4) can be proved similarly.
Suppose that is obtained from (Inv1) or (Inv2). Since , we can get that and by Theorem 3 (6), Theorem 2 (1), and (AReg1). Thus, if is obtained from (Inv1) or (Inv2), then .
Consider the rule (Flat). Since is not the axiom of sqŁ*, we have that cannot be obtained from axioms using the rule (Flat).
Suppose that is obtained from (R2′). We may assume that , where , are axioms of sqŁ* and . Then we have and from (1). Applying Theorem 5 (4), we get that , i.e., .
Suppose that is obtained from (R3′). We may assume that , where is an axiom of sqŁ* and . Then we have from (1). Since , we have from Theorem 3 (6), Theorem 2 (1), and (AReg1). So by Theorem 4 (3), we get that , i.e., .
In summary, we have that implies . Thus, if , then we have and , and then and . Applying Theorem 3 (11), Theorem 2 (1), and (AReg2), we have .
Since is regular, we get that by (AReg1), (AReg2), (AReg3), and (AReg4).
Therefore, if , then . □
Theorem 8.
iff .
Proof.
From Corollary 1 and Theorem 7, we have that iff . Then by Proposition 2, we have that iff . It turns out that iff . □
4. Conclusions
In this paper, we introduce the paraconsistent logical system sq as a fragment of sqŁ*, demonstrating its soundness and weak completeness. The proposed framework offers practical utility in artificial intelligence for managing contradictory data streams, facilitating fault-tolerant reasoning in heterogeneous multi-source databases, and enabling robust decision-making under conflicting premises within complex fuzzy systems. Additionally, it provides innovative formal foundations for applications requiring non-classical reasoning, such as automated legal argumentation systems and medical diagnostic models with inherent uncertainty. In future work, we will focus on further investigating the logic sqŁ* and exploring more relationships between sqŁ* and complex fuzzy logic.
Author Contributions
Writing—original draft, L.C.; Writing—review & editing, W.C. All authors have read and agreed to the published version of the manuscript.
Funding
This research was funded by Shandong Provincial Natural Science Foundation, China (No. ZR2020MA041).
Data Availability Statement
Data are contained within the article.
Conflicts of Interest
The authors declare no conflicts of interest.
References
- Chang, C.C. Logic with positive and negative truth values. Acta Philos. Fenn. 1963, 16, 19–39. [Google Scholar] [CrossRef]
- Lewin, R.; Sagastume, M.; Massey, P. Chang’s Ł* logic. Log. J. IGPL 2004, 12, 485–497. [Google Scholar] [CrossRef]
- Lewin, R.; Sagastume, M. Paraconsistency in Chang’s logic with positive and negative truth values. In Paraconsistency, the Logical Way to the Inconsistent; Carnielli, W.A., Coniglio, M.E., D’Ottaviano, I.M.L., Eds.; Marcel Dekker: New York, NY, USA, 2002; pp. 381–396. [Google Scholar]
- Barrio, E.; Pailos, F.; Szmuc, D. What is a paraconsistent logic? In Contradictions, from Consistency to Inconsistency; Springer International Publishing: Berlin, Germany, 2018; pp. 89–108. [Google Scholar] [CrossRef]
- Ledda, A.; Konig, M.; Paoli, F. MV algebras and quantum computation. Stud. Log. 2006, 82, 245C–270. [Google Scholar] [CrossRef]
- Bou, F.; Paoli, F.; Ledda, A.; Spinks, M. Giuntini, R. The logic of quasi-MV algebras. J. Log. Comput. 2010, 20, 619C–643. [Google Scholar] [CrossRef]
- Jiang, Y.Y.; Chen, W.J. Quasi-MV* algebras: A generalization of MV*-algebras. Soft Comput. 2022, 26, 6999–7015. [Google Scholar] [CrossRef]
- Dai, S.S. Quasi-MV algebras for complex fuzzy logic. AIMS Math. 2021, 7, 1416–1428. [Google Scholar] [CrossRef]
- Tamir, D.E.; Last, M.; Kandel, A. The theory and applications of generalized complex fuzzy propositional logic. In Soft Computing: State of the Art Theory; Yager, R.R., Abbasov, A., Reformat, M., Shahbazova, S., Eds.; Springer: Berlin/Heidelberg, Germany, 2013; Volume 291, pp. 177–192. [Google Scholar] [CrossRef]
- Ramot, D.; Milo, R.; Friedman, M.; Kandel, A. Complex fuzzy sets. IEEE Trans. Fuzzy Syst. 2002, 10, 171–186. [Google Scholar] [CrossRef]
- Ramot, D.; Friedman, M.; Langholz, G.; Kandel, A. Complex fuzzy logic. IEEE Trans. Fuzzy Syst. 2003, 11, 450–461. [Google Scholar] [CrossRef]
- Cai, L.; Chen, W.J. Strong quasi-MV* algebras and their logics. arXiv 2025, arXiv:2503.13887. [Google Scholar] [CrossRef]
- Cai, L.; Jiang, Y.Y.; Chen, W.J. The logic of quasi-MV* algebras. arXiv 2025, arXiv:2503.14081. [Google Scholar] [CrossRef]
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. |
© 2025 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 (https://creativecommons.org/licenses/by/4.0/).