In this paper we present a different proof of the standard completeness theorem for the monoidal t-norm based logic. In fact, we prove even more since we show that MTL is complete w.r.t. the class of standard MTL-algebras with finite congruence lattice.
In this paper we present a different proof of the standard completeness theorem for the monoidal t-norm based logic. In fact, we prove even more since we show that MTL is complete w.r.t. the class of standard MTL-algebras with finite congruence lattice. (en)