Fuzzy logic and arithmetical hierarchy. II (Q677082)

[For Part I see Fuzzy Sets Syst. 73, No. 3, 359-363 (1995; Zbl 0857.03011).] Fuzzy logic RQL here means an extension of Łukasiewicz's infinite-valued first-order logic by graded notions of provability and of consequence together with (truth degree) constants for all rationals of the truth degree set \([0,1]\). Fuzzy theories are fuzzy sets of RQL-formulas with only rational membership degrees. The author gives a very simple axiomatization for RQL and proves the strong completeness theorem, i.e. the coincidence of provability and consequence for all fuzzy theories. Furthermore, he proves that there exists an axiomatizable fuzzy theory \(T_0\) (i.e. the membership function of \(T_0\) is recursive) whose set of 1-provable formulas is \(\Pi_2\)-complete.