Complexity of some language fragments of fuzzy logics (Q1699732)

This article analysis whether fuzzy logics (MTL and its extension) can be reduced to their implicational fragments. In particular, it is shown that (a) the semigroup reducts can generate a chain of subvarietes of commutative semigroups and (b) the implicational fragments of BL and some of its extensions are polynomial equivalent to the full logic. The author discusses consequences of the obtained results and, at the end of article, she presents several open problems.