It is well known that MTL satisfies the finite embeddability property. Thus MTL is complete w. r. t. the class of all finite MTL-chains. In order to reach a deeper understanding of the structure of this class, we consider the extensions of MTL by adding the generalized contraction since each finite MTL-chain satisfies a form of this generalized contraction. Simultaneously, we also consider extensions of MTL by the generalized excluded middle laws introduced in [9] and the axiom of weak cancellation (...) defined in [31]. The algebraic counterpart of these logics is studied characterizing the subdirectly irreducible, the semisimple, and the simple algebras. Finally, some important algebraic and logical properties of the considered logics are discussed: local finiteness, finite embeddability property, finite model property, decidability, and standard completeness. (shrink)