“…Throughout the paper, we shall use the definitions and notation concerning L-valuations, L-interpretations, graded formulae, graded clauses, and substitutions given in Section 2 [2]. The only difference is that formulae are built up from atoms using the connectives ¬, negation, ∧, conjunction, &, strong conjunction, ∨, disjunction, and →, implication, which are interpreted by the respective operators − , ∧, * , ∨, and ⇒ on L. PropForm, Form L denotes the set of (propositional) formulae (of L), and analogously, PropForm L , Form L L the set of graded formulae, of the form (, c) where ∈ PropForm, Form L and c ∈ L is its truth degree.…”