Difference between revisions of "An abstract algebraic logic view of some mutiple-valued logics"

From Mathfuzzlog
Jump to: navigation, search
(Created page with "{{Paper| journal=Studia Logica| volume=70| number=2| pages=157-182| year=2002}} {{Book chapter| author=Josep Maria Font| chapter=An abstract algebraic logic view of some muti...")
Line 1: Line 1:
journal=Studia Logica|
{{Book chapter|
{{Book chapter|
author=Josep Maria Font|
author=Josep Maria Font|

Revision as of 08:11, 27 April 2016

Josep Maria Font
Title of the chapter: An abstract algebraic logic view of some mutiple-valued logics
Title of the book: Beyond Two: Theory and Applications of Multiple-Valued Logic

Melvin Fitting
Eva Orlowska
Pages: 25-58
Publisher: Physica-Verlag
City: Heidelberg-Berlin-New York
Year: 2003


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 Lukasiewicz.