Abstract Algebraic Logic is a general theory of the algebraization of deductive systems arising as an abstraction of the well-known Lindenbaum-Tarski process. The notions of logical matrix and of Leibniz congruence are among its main building blocks. Its most successful part has been developed mainly by BLOK, PIGOZZI and CZELAKOWSKI, and obtains a deep theory and very nice and powerful results for the so-called protoalgebraic logics. I will show how the idea (already explored by WÓJCKICI and NOWAK) ofdeÞning logics using a scheme of “preservation of degrees of truth ” (as opposed to the more usual one of “preservation of truth”) characterizes a wide class of logics which are not necessarily protoalgebraic and provide another fairly general framework where recent methods in Abstract Algebraic Logic (developed mainly by JANSANA and myself) can give some interesting results. After the general theory is explained, I apply it to an inÞnite family of logics deÞned in this way from subalgebras of the real unit interval taken as an MV-algebra. The general theory determines the algebraic counterpart of each of these logics without having to perform any computations for each particular case, and proves some interesting properties common to all of them. Moreover, in the Þnite case the logics so obtained are protoalgebraic, which implies they have a “strong version ” deÞned from their Leibniz Þlters; again, the general theory helps in showing that it is the logic deÞned from the same subalgebra by the truth-preserving scheme, that is, the corresponding Þnite-valued logic in the most usual sense. However, for inÞnite subalgebras the obtained logic turns out to be the same for all such subalgebras and is not protoalgebraic, thus the ordinary methods do not apply. After introducing some (new) more general abstract notions for non-protoalgebraic logics I can Þnally show that this logic too has a strong version, and that it coincides with the ordinary inÞnite-valued logic of Łukasiewicz. 1 1

̷Lukasiewicz’s infinite-valued logic is commonly defined as the set of formulas that take the value 1 under all evaluations in the ̷Lukasiewicz algebra on the unit real interval. In the literature a deductive system axiomatized in a Hilbert style was associated to it, and was later shown to be semantically defined from ̷Lukasiewicz algebra by using a “truthpreserving” scheme. This deductive system is algebraizable, non-selfextensional and does not satisfy the deduction theorem. In addition, there exists no Gentzen calculus fully adequate for it. Another presentation of the same deductive system can be obtained from a substructural Gentzen calculus. In this paper we use the framework of abstract algebraic logic to study a different deductive system which uses the aforementioned algebra under a scheme of “preservation of degrees of truth”. We characterize the resulting deductive system in a natural way by using the lattice filters of Wajsberg algebras, and also by using a structural Gentzen calculus, which is shown to be fully adequate for it. This logic is an interesting example for the general theory: it is selfextensional, non-protoalgebraic, and satisfies a “graded ” deduction theorem. Moreover, the Gentzen system is algebraizable. The first mentioned deductive system turns out to be the extension of the second by the rule of Modus Ponens.