A formal deductive system for fuzzy propositional calculus (Q1376008)

The author considers the simplest version of propositional fuzzy logic, in which to every propositional variable \(p\), we can assign a value \(v(p)\) from the interval [0,1], and then compute the value \(v(F)\) of each propositional formula \(F\) by applying the expressions \(v(A\& B)=\min(v(A),v(B))\), \(v(A\vee B)=\max(v(A),v(B))\), \(v(\neg A)=1-v(A)\), and \(v(A\to B)=f_\to (v(A),v(B))\) for some function \(f_\to(a,b):[0,1]\times [0,1]\to [0,1]\) (called \textit{implication function}). We can say that a propositional formula \(F\) is a \textit{tautology} if \(v(F)=1\) for all assignments \(v(p)\). Alternatively, we can fix a real number \(\alpha\in [0,1]\), and define an \textit{\(\alpha\)-tautology} as a formula \(F\) for which \(v(F)\geq\alpha\) for all assignments \(v(p)\), and an \textit{\(\alpha^+\)-tautology} if \(v(F)>\alpha\). In the paper under review, a formal (crisp) deductive system is given which describes tautologies for the implication functions \(f_\to(a,b)=\max(b,1-a)\) and \(f_\to(a,b)=\min(1-a+b,1)\). The author also describes when a formula \(F\) \textit{implies} formula \(G\) (e.g., in the sense of \(v(F)\leq v(G)\), or in the sense of deriving \(F\to G\)). For a fragment which does not include implication \(\to\), similar problems were analyzed by \textit{H. T. Nguyen, O. M. Kosheleva} and \textit{V. Kreinovich} [Int. J. Intell. Syst. 11, 295-326 (1996; Zbl 0854.68101)] and by \textit{H. T. Nguyen} and \textit{V. Kreinovich} [``Using Gelfond-Przymusinska's epistemic specifications to justify (some) heuristic methods used in expert systems and intelligent control'', Soft Computing 1, No. 4, 198-209 (1997)].