A note on axiomatizations of Pavelka-style complete fuzzy logics

Pavelka-style completeness, a property relating degrees of provability and truth, was previously studied mainly in the context of logics with continuous connectives. It is known that in some other logics one can use infinitary deduction rule(s) to retain this form of completeness. The present paper offers a systematic study of this idea for fuzzy logics which expand MTL and are given by a fixed standard algebra. We explore the structure of the class of all ‘reasonable’ expansions of any such logic by rational truth constants and, for several prominent cases, provide axiomatizations of particular expansions enjoying the Pavelka-style completeness.