# An Abstract Algebraic Logic View of Some Mutiple-valued Logics

• Josep Maria Font
Chapter
Part of the Studies in Fuzziness and Soft Computing book series (STUDFUZZ, volume 114)

## Abstract

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) of defining 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 infinite family of logics defined 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 finite case the logics so obtained are protoalgebraic, which implies they have a “strong version” defined from their Leibniz filters; again, the general theory helps in showing that it is the logic defined from the same subalgebra by the truth-preserving scheme, that is, the corresponding finite-valued logic in the most usual sense. However, for infinite 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 finally show that this logic too has a strong version, and that it coincides with the ordinary infinite-valued logic of Łukasiewicz.

## Keywords

Strong Version Algebraic Logic Algebraic Counterpart Lattice Filter Abstract Algebraic Logic
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

## References

1. 1.
Ardeshir, M., and Ruitenburg, W.: Basic propositional calculus I. Mathematical Logic Quarterly 44 (1998), 317–343
2. 2.
Blok, W., and Pigozzi, D.: Protoalgebraic logics. Studia Logica 45 (1986), 337–369
3. 3.
Blok, W., and Pigozzi, D.: Algebraizable logics, vol. 396 of Mem. Amer. Math. Soc. A.M.S., Providence, January (1989)Google Scholar
4. 4.
Blok, W., and Pigozzi, D.: Algebraic semantics for universal Horn logic without equality. In Universal Algebra and Quasigroup Theory, Romanowska, A. and Smith, J.D.H. Eds. Heldermann, Berlin (1992), 1–56Google Scholar
5. 5.
Blok, W., and Pigozzi, D.: Abstract algebraic logic and the deduction theorem. Bulletin of Symbolic Logic (200x). To appear.Google Scholar
6. 6.
Brown, D. J., and Suszko, R.: Abstract logics. Dissertationes Math. (Rozprawy Mat.) 102 (1973), 9–42
7. 7.
Celani, S., and Jansana, R.: A closer look at some subintuitionistic logics. Manuscript (2000)Google Scholar
8. 8.
Cignoli, R., Mundici, D., and D’Ottaviano, I.: Algebraic foundations of many-valued reasoning, vol. 7 of Trends in Logic, Studia Logica Library. Kluwer, Dordrecht (1999)Google Scholar
9. 9.
Czelakowski, J.: Model-theoretic methods in methodology of propositional calculi. Polish Academy of Sciences, Warszawa (1980)
10. 10.
Czelakowski, J.: Equivalential logics, I, II. Studia Logica 40 (1981), 227–236 and 355–372Google Scholar
11. 11.
Czelakowski, J.: Protoalgebraic Logics, vol. 10 of Trends in Logic, Studia Logica Library. Kluwer Academic Publishers, Dordrecht (2001)
12. 12.
Czelakowski, J., and Jansana, R.: Weakly algebraizable logics. The Journal of Symbolic Logic 65, 2 (2000), 641–668
13. 13.
Font, J.M.: Belnap’s four-valued logic and De Morgan lattices. Logic Journal of the I.G.P.L. 5, 3 (1997), 413–440
14. 14.
Font, J. M., and Jansana, R.: A general algebraic semantics for sentential logics, vol. 7 of Lecture Notes in Logic. Springer-Verlag, (1996) 135 pp. Presently distributed by the Association for Symbolic Logic.Google Scholar
15. 15.
Font, J. M., and Jansana, R.: Leibniz filters and the strong version of a protoalgebraic logic. Archive for Mathematical Logic 40 (2001), 437–465
16. 16.
Font, J. M., and Jansana, R.: On semilattice-based deductive systems. Manuscript (2001)Google Scholar
17. 17.
Font, J. M., Jansana, R., and Pigozzi, D.: A survey on abstract algebraic logic. Studia Logica, Special Issue on Abstract Algebraic Logic, Part II (200x). To appearGoogle Scholar
18. 18.
Font, J. M., Rodriguez, A. J., and Torrens, A.: Wajsberg algebras. Stochastica 8 (1984), 5–31
19. 19.
Font, J. M., and Rodriguez, G. Algebraic study of two deductive systems of relevance logic. Notre Dame Journal of Formal Logic 35, 3 (1994), 369–397
20. 20.
Font, J. M., and Verdd, V.: Algebraic logic for classical conjunction and disjunction. Studia Logica, Special Issue on Algebraic Logic 50 (1991), 391–419
21. 21.
Gil, A.J.: Sistemes de Gentzen multidimensionals i logiques finitament valorades. Teoria i aplicacions. Ph. D. Thesis, University of Barcelona (1996)Google Scholar
22. 22.
Gil, A. J., Torrens, A., and Verdû, V.: Lôgicas de Lukasiewicz congruenciales. Teorema de la deducciôn. In Actas del I Congreso de la Sociedad de Logica, Metodologia y Filosoffa de la Ciencia en Espana (Madrid, 1993 ), Bustos, E., Echeverria, J., Pérez Sedeiio, E. and Sanchez Balmaseda, M.I., Eds., 71–74Google Scholar
23. 23.
Gispert, J., and Torrens, A.: Quasivarieties generated by simple MV-algebras. Studia Logica 61 (1998), 79–99
24. 24.
Gottwald, S.: A treatise on many-valued logics, vol. 9 of Studies in Logic and Computation. Research Studies Press, Baldock (2001)Google Scholar
25. 25.
Hâjek, P.: Metamathematics of fuzzy logic, vol. 4 of Trends in Logic, Studia Logica Library. Kluwer, Dordrecht (1998)
26. 26.
Hay, L.: Axiomatization of the infinite-valued predicate calculus. The Journal of Symbolic Logic 28 (1963), 77–86
27. 27.
Komori, Y.: Super-Lukasiewicz propositional logic. Nagoya Mathematical Journal 84 (1981), 119–133
28. 28.
Lukasiewicz, J. Selected Works, edited by L. Borkowski. Studies in Logic and the Foundations of Mathematics. North-Holland, Amsterdam (1970)Google Scholar
29. 29.
Lukasiewicz, J., and Tarski, A.: Untersuchungen über den Aussagenkalkül. Comptes Rendus des Séances de la Société des ciences et des Lettres de Varsovie, Cl. III 23 (1930), 30–50. Reprinted in [28], 131–152Google Scholar
30. 30.
Miyakawa, M., Nakamura, K., Ramik, J., and Rosenberg, I.: Joint canonical fuzzy numbers. Fuzzy Sets and Systems 53 (1993), 39–47
31. 31.
Murali, V.: Lattice of fuzzy subalgebras and closure systems in /X. Fuzzy Sets and Systems 41 (1991), 101–111
32. 32.
Nakamura, K.: Canonical fuzzy number of dimension two and fuzzy utility difference for understanding preferential judgements. Information Science 50 (1990), 1–22
33. 33.
Nowak, M.: Logics preserving degrees of truth. Studia Logica 49 (1990), 483–499
34. 34.
Rasiowa, H.: An algebraic approach to non-classical logics, vol. 78 of Studies in Logic and the Foundations of Mathematics. North-Holland, Amsterdam (1974)Google Scholar
35. 35.
Rebagliato, J., and Verdû, V.: A finite Hilbert-style axiomatization of the implication-less fragment of the intuitionistic propositional calculus. Mathematical Logic Quarterly 40 (1994), 61–68
36. 36.
Restall, G.: Subintuitionistic logics. Notre Dame Journal of Formal Logic 35 (1994), 116–129
37. 37.
Rodriguez, A. J., Torrens, A., and Verdn, V.: Lukasiewicz logic and Wajsberg algebras. Bulletin of the Section of Logic 19 (1990), 51–55
38. 38.
Sofronie-Stokkermans, V.: Representation theorems and the semantics of (semi)lattice-based logics. In Proceedings of the 31st ISMVL Warsaw (2001), Konikowska, B., Ed., The IEEE Computer Society Press, 125–134Google Scholar
39. 39.
Sofronie-Stokkermans, V.: Representation theorems and the semantics of nonclassical logics, and applications to automated theorem proving. This volume, 57–98Google Scholar
40. 40.
Suzuki, Y., Wolter, F., and Zacharyaschev, M.: Speaking about transitive frames in propositional languages. Journal of Logic, Language and Information 7 (1998), 317–339
41. 41.
Torrens, A.: W-algebras which are Boolean products of members of SR[1] and CW-algebras. Studia Logica 47 (1987), 265–274
42. 42.
Wansing, H.: Displaying as temporalizing. Sequent systems for subintuitionistic logic. In Logic, Language and Computation, Akama, S., Ed. Kluwer (1997) 159–178Google Scholar
43. 43.
Wôjcicki, R.: Matrix approach in the methodology of sentential calculi. Studia Logica 32 (1973), 7–37
44. 44.
Wôjcicki, R.: On matrix representation of consequence operations on Lukasiewicz’s sentential calculi. Zeitschrift für Mathematische Logik and Grundlagen der Mathematik 19 (1976), 239–247
45. 45.
Wôjcicki, R.: Theory of logical calculi. Basic theory of consequence operations, vol. 199 of Synthese Library. Reidel, Dordrecht (1988)