On arithmetical complexity of fragments of prominent fuzzy predicate logics (Q2466754)

This paper is concerned with the arithmetical complexity of fragments of the predicate versions of five well-known fuzzy logics, namely Łukasiewicz, product, and Gödel logic as well as BL and strict BL. The fragments are given by the restriction to the connectives \(\rightarrow\) and \(\bar 0\). The complexity of the set of standardly/generally satisfiable finite sets of formulas as well as the complexity of the set of standard/general tautologies is determined in each case, and is the same as in the case of the respective whole logic. Furthermore, several results are achieved for the case that the set of t-norms on which the logic is based, is an arbitrary set of continuous t-norms containing the product t-norm. The set of standardly satisfiable finite sets of formulas and the set of standard tautologies of the resulting fragment are both not arithmetical.