Paraconsistent fuzzy logic preserving non-falsity (Q1697334)

Consider a standard axiomatization of the logic \(\mathbf T\) of ``ticket entailment'', introduced and motivated by \textit{A. R. Anderson} and \textit{N. D. Belnap jun.} in [Entailment. The logic of relevance and necessity. Vol. I. Princeton, N. J.: Princeton University Press. (1975; Zbl 0323.02030)]. The system \(\mathbf{TMP}\) is obtained by adding to \(\mathbf T\) the following two axioms: \(\varphi \rightarrow (\varphi \rightarrow \varphi)\); \(\varphi\vee (\varphi\rightarrow\psi)\). The system \(\mathbf{FT}\) is obtained by adding to \(\mathbf{TMP}\) the axiom of linearity: \((\varphi\rightarrow\psi)\vee(\psi\rightarrow\varphi)\). A \(\mathbf{TMP}\)-structure is a tuple \({\mathcal M} = \langle A, \leq, 0, 1, \neg, \rightarrow\rangle\) such that: {\parindent=8mm \begin{itemize}\item[(1)] \(\langle A, \leq, 0, 1, \neg \rangle\) is a bounded De-Morgan lattice; \item[(2)] 0 is meet-irreducible in \({\mathcal M}\); \item[(3)] \(a \rightarrow b = \neg a \vee b\), if \(a \leq b\), and \(= 0\) otherwise. \end{itemize}} A \(\mathbf{TMP}\)-structure is called linear if \(\langle A, \leq\rangle\) is linear. Consider \({\mathcal M}_{[0,1]} = \langle [0,1], \leq, 0, 1, \neg, \rightarrow\rangle\), where \([0, 1]\) is the unit interval, \(\leq\) is its usual order relation, \(\neg a = 1 - a\), \(a \rightarrow b = \max(1 - a, b)\) if \(a \leq b\) and \(a \rightarrow b=0\) if \(a > b\). Then \({\mathcal M}_{[0,1]}\) is a linear \(\mathbf{TMP}\)-structure. It can be proved that every countable linear \(\mathbf{TMP}\)-structure can be embedded in \({\mathcal M}_{[0,1]}\). Define a valuation \(v\) in \(\mathcal M\) as a function from the set of formulas to \(A\) such that \(v(\neg \varphi) = \neg v(\varphi)\) and \(v(\varphi \diamond \psi) = v(\varphi) \diamond v(\psi)\) for \(\diamond \in \{\rightarrow, \wedge, \vee\}\). Both \(\mathbf{TMP}\) and \(\mathbf{FT}\) are strongly decidable. The author proves that \(\mathbf{TMP}\) is sound and complete with respect to every \(\mathbf{TMP}\)-structure, and \(\mathbf{FT}\) is sound and complete with respect to every linear \(\mathbf{TMP}\)-structure. Moreover, \({\mathcal M}_{[0,1]}\) is strongly characteristic for \(\mathbf{FT}\). The author argues that while \(\mathbf{TMP}\) has the variable sharing property, and thus, is a relevant logic, \(\mathbf{FT}\) may be viewed as a semi-relevant counterpart of Łukasiewicz logic \(\mathbf{\L}_\infty\), which preserves non-falsity rather than truth.