Academia.eduAcademia.edu

Outline

Title
Abstract
The Protoalgebraic Case: The Strong Version
Conclusions
References
All Topics
Mathematics

Beyond Two: Theory and Applications of Multiple-Valued Logic

Profile image of Ewa OrlowskaEwa Orlowska

2003, Studies in Fuzziness and Soft Computing

https://doi.org/10.1007/978-3-7908-1769-0
visibility

…

description

29 pages

link

1 file

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 deÞ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. * The term "(semi)lattice-based" has been used in , in a non-technical way, to describe a large class of logics

Related papers

Chapter 5: Applications to Particular Sentential Logics
Ramon Jansana

2009

In this chapter we determine the classes of S-algebras and of full models for several logics, especially for some which do not fit into the classical approaches to the algebraization of logic. We classify them according to several of the criteria we have been considering, i.e., the properties of the Leibniz, Tarski and Frege operators, which determine the classes of selfextensional logics, Fregean logics, strongly selfextensional logics, protoalgebraic logics, etc. We also study the counterexamples promised in the preceding chapters of this monograph. It goes without saying that the number of cases we have examined is limited, and that many more are waiting to be studied 32. In our view this is an interesting program, especially for non-algebraizable logics. Among those already proven in Blok and Pigozzi [1989a] not to be algebraizable we find many quasi-normal and other modal logics like Lewis' S1, S2 and S3, entailment system E, several purely implicational logics like BCI, the system R → of relevant implication, the "pure entailment" system E → , the implicative fragment S5 → of the Wajsbergstyle version of S5, etc. Other non-algebraizable logics not treated in the present monograph are Da Costa's paraconsistent logics C n (see Lewin, Mikenberg, and Schwarze [1991]), and the "logic of paradox" of Priest [1979] (see Pynko [1995]). This program is also interesting for some algebraizable logics whose class of Salgebras is already known, but whose full models have not yet been investigated; this includes Łukasiewicz many-valued logics (see Rodríguez, Torrens, and Verdú [1990]), BCK logic and some of its neighbours (see Blok and Pigozzi [1989a] Theorem 5.10), the equivalential fragments of classical and intuitionistic logics 32 The full models of several subintuitionistic logics have been determined in Bou [2001]; those of

View PDFchevron_right
Algebraic Logic, Where Does it Stand Today?
Tarek Sayed-Ahmed

Bulletin of Symbolic Logic, 2005

This is a survey article on algebraic logic. It gives a historical background leading up to a modern perspective. Central problems in algebraic logic (like the representation problem) are discussed in connection to other branches of logic, like modal logic, proof theory, model-theoretic forcing, finite combinatorics, and Gödel's incompleteness results. We focus on cylindric algebras. Relation algebras and polyadic algebras are mostly covered only insofar as they relate to cylindric algebras, and even there we have not told the whole story. We relate the algebraic notion of neat embeddings (a notion special to cylindric algebras) to the metalogical ones of provability, interpolation and omitting types in variants of first logic. Another novelty that occurs here is relating the algebraic notion of atom-canonicity for a class of boolean algebras with operators to the metalogical one of omitting types for the corresponding logic. A hitherto unpublished application of algebraic logic...

View PDFchevron_right
Leibniz filters and the strong version of a protoalgebraic logic
Ramon Jansana

Archive for Mathematical Logic, 2001

A filter of a sentential logic S is Leibniz when it is the smallest one among all the S-filters on the same algebra having the same Leibniz congruence. This paper studies these filters and the sentential logic S + + + defined by the class of all S-matrices whose filter is Leibniz, which is called the strong version of S, in the context of protoalgebraic logics with theorems. Topics studied include an enhanced Correspondence Theorem, characterizations of the weak algebraizability of S + + + and of the explicit definability of Leibniz filters, and several theorems of transfer of metalogical properties from S to S + + +. For finitely equivalential logics stronger results are obtained. Besides the general theory, the paper examines the examples of modal logics, quantum logics and Łukasiewicz's finitely-valued logics. One finds that in some cases the existence of a weak and a strong version of a logic corresponds to well-known situations in the literature, such as the local and the global consequences for normal modal logics; while in others these constructions give an independent interest to the study of other lesser-known logics, such as the lattice-based many-valued logics.

View PDFchevron_right
Some algebraic structures for many-valued logics
Roberto Giuntini

1998

Brouwer{Zadeh MV-algebras and de Morgan BZMV-algebras are the result of a natural \pasting" between Brouwer{Zadeh algebras and MValgebras. Such structures are characterized by a splitting of the operations that correspond to the basic logical connectives (not, and, or). In this framework, we prove the categorical equivalence between di erent kinds of structures that have been introduced in order to semantically characterize some many-valued logics. In particular, we investigate the cases of Chang's MV-algebras, Cignoli{Monteiro Lukasiewicz algebras, Stonian MV-algebras.

View PDFchevron_right
An Algebraic Analysis of Many-Valued Logic Endowed with Lukasiewicz and Goedel Implications
Martinvaldo Konig
View PDFchevron_right
A Survey of Abstract Algebraic Logic
Ramon Jansana

Studia Logica - An International Journal for Symbolic Logic, 2003

View PDFchevron_right
A Survey of Generalized Basic Logic Algebras
Peter Jipsen

2009

Petr Hájek identified the logic BL, that was later shown to be the logic of continuous t-norms on the unit interval, and defined the corresponding algebraic models, BL-algebras, in the context of residuated lattices. The defining characteristics of BL-algebras are representability and divisibility. In this short note we survey recent developments in the study of divisible residuated lattices and attribute the inspiration for this investigation to Petr Hájek.

View PDFchevron_right
Logics without the contraction rule and residuated lattices
Hiroakira Ono

The Australasian Journal of Logic, 2010

In this paper, we will develop an algebraic study of substructural propositional logics over FLew, i.e. the logic which is obtained from intuitionistic logics by eliminating the contraction rule. Our main technical tool is to use residuated lattices as the algebraic semantics for them. This enables us to study different kinds of nonclassical logics, including intermediate logics, BCK-logics, Lukasiewicz’s many-valued logics and fuzzy logics, within a uniform framework.

View PDFchevron_right
Duality for algebras of relevant logics
Alasdair Urquhart

Studia Logica, Volume 56, 263-276, 1996

View PDFchevron_right
Two theorems on many-valued logics
Zbigniew Stachniak

Journal of Philosophical Logic, 1988

View PDFchevron_right

References (44)

  1. ARDESHIR, M., AND RUITENBURG, W. Basic propositional calculus I. Mathematical Logic Quarterly 44 (1998), 317-343.
  2. BLOK, W., AND PIGOZZI, D. Protoalgebraic logics. Studia Logica 45 (1986), 337-369.
  3. BLOK, W., AND PIGOZZI, D. Algebraizable logics, vol. 396 of Mem. Amer. Math. Soc. A.M.S., Providence, January 1989.
  4. BLOK, W., AND PIGOZZI, D. Algebraic semantics for universal Horn logic without equality. In Universal Algebra and Quasigroup Theory, A. Romanowska and J. D. H. Smith, Eds. Heldermann, Berlin, 1992, pp. 1-56.
  5. BLOK, W., AND PIGOZZI, D. Abstract algebraic logic and the deduction theorem. Bulletin of Symbolic Logic (200x). To appear.
  6. BROWN, D. J., AND SUSZKO, R. Abstract logics. Dissertationes Math. (Rozprawy Mat.) 102 (1973), 9-42.
  7. CELANI, S., AND JANSANA, R. A closer look at some subintuitionistic logics. Manuscript, Octo- ber 2000.
  8. CIGNOLI, R., MUNDICI, D., AND D'OTTAVIANO, I. Algebraic foundations of many-valued reas- oning, vol. 7 of Trends in Logic, Studia Logica Library. Kluwer, Dordrecht, 1999.
  9. CZELAKOWSKI, J. Model-theoretic methods in methodology of propositional calculi. Polish Academy of Sciences, Warszawa, 1980.
  10. CZELAKOWSKI, J. Equivalential logics, I, II. Studia Logica 40 (1981), 227-236 and 355-372.
  11. CZELAKOWSKI, J. Protoalgebraic Logics, vol. 10 of Trends in Logic, Studia Logica Library. Kluwer Academic Publishers, Dordrecht, 2001.
  12. CZELAKOWSKI, J., AND JANSANA, R. Weakly algebraizable logics. The Journal of Symbolic Logic 65, 2 (2000), 641-668.
  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. 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.
  15. FONT, J. M., AND JANSANA, R. Leibniz Þlters and the strong version of a protoalgebraic logic. Archive for Mathematical Logic 40 (2001), 437-465.
  16. FONT, J. M., AND JANSANA, R. On semilattice-based deductive systems. Manuscript, 2001.
  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 appear.
  18. FONT, J. M., RODRÍGUEZ, A. J., AND TORRENS, A. Wajsberg algebras. Stochastica 8 (1984), 5-31.
  19. FONT, J. M., AND RODRÍGUEZ, G. Algebraic study of two deductive systems of relevance logic. Notre Dame Journal of Formal Logic 35, 3 (1994), 369-397.
  20. FONT, J. M., AND VERD Ú, V. Algebraic logic for classical conjunction and disjunction. Studia Logica, Special Issue on Algebraic Logic 50 (1991), 391-419.
  21. GIL, A. J. Sistemes de Gentzen multidimensionals i lògiques finitament valorades. Teoria i aplic- acions. Ph. D. Thesis, University of Barcelona, 1996.
  22. GIL, A. J., TORRENS, A., AND VERD Ú, V. Lógicas de Łukasiewicz congruenciales. Teorema de la deducción. In Actas del I Congreso de la Sociedad de Lógica, Metodología y Filosofía de la Ciencia en España (Madrid, 1993), E. Bustos, J. Echeverrṍa, E. Pérez Sedeño, and M. I. Sánchez Balmaseda, Eds., pp. 71-74.
  23. GISPERT, J., AND TORRENS, A. Quasivarieties generated by simple MV-algebras. Studia Logica 61 (1998), 79-99.
  24. GOTTWALD, S. A treatise on many-valued logics, vol. 9 of Studies in Logic and Computation. Research Studies Press, Baldock, 2001.
  25. H ÁJEK, P. Metamathematics of fuzzy logic, vol. 4 of Trends in Logic, Studia Logica Library. Kluwer, Dordrecht, 1998.
  26. HAY, L. Axiomatization of the inÞnite-valued predicate calculus. The Journal of Symbolic Logic 28 (1963), 77-86.
  27. KOMORI, Y. Super-Łukasiewicz propositional logic. Nagoya Mathematical Journal 84 (1981), 119-133.
  28. ŁUKASIEWICZ, J. Selected Works, edited by L. Borkowksi. Studies in Logic and the Foundations of Mathematics. North-Holland, Amsterdam, 1970.
  29. ŁUKASIEWICZ, 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-152.
  30. MIYAKAWA, M., NAKAMURA, K., RAMIK, J., AND ROSENBERG, I. Joint canonical fuzzy num- bers. Fuzzy Sets and Systems 53 (1993), 39-47.
  31. MURALI, V. Lattice of fuzzy subalgebras and closure systems in I X . Fuzzy Sets and Systems 41 (1991), 101-111.
  32. NAKAMURA, K. Canonical fuzzy number of dimension two and fuzzy utility difference for under- standing preferential judgements. Information Science 50 (1990), 1-22.
  33. NOWAK, M. Logics preserving degrees of truth. Studia Logica 49 (1990), 483-499.
  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.
  35. REBAGLIATO, J., AND VERD Ú, V. A Þnite Hilbert-style axiomatization of the implication-less fragment of the intuitionistic propositional calculus. Mathematical Logic Quarterly 40 (1994), 61-68.
  36. RESTALL, G. Subintuitionistic logics. Notre Dame Journal of Formal Logic 35 (1994), 116-129.
  37. RODRÍGUEZ, A. J., TORRENS, A., AND VERD Ú, V. Łukasiewicz logic and Wajsberg algebras. Bulletin of the Section of Logic 19 (1990), 51-55.
  38. SOFRONIE-STOKKERMANS, V. Representation theorems and the semantics of (semi)lattice-based logics. In Proceedings of the 31st ISMVL (Warsaw, 2001), B. Konikowska, Ed., The IEEE Computer Society Press, pp. 125-134.
  39. SUZUKI, Y., WOLTER, F., AND ZACHARYASCHEV, M. Speaking about transitive frames in pro- positional languages. Journal of Logic, Language and Information 7 (1998), 317-339.
  40. TORRENS, A. W-algebras which are Boolean products of members of SR[1] and CW-algebras. Studia Logica 47 (1987), 265-274.
  41. WANSING, H. Displaying as temporalizing. Sequent systems for subintuitionistic logic. In Logic, Language and Computation, S. Akama, Ed. Kluwer, 1997, pp. 159-178.
  42. W ÓJCICKI, R. Matrix approach in the methodology of sentential calculi. Studia Logica 32 (1973), 7-37.
  43. W ÓJCICKI, R. On matrix representation of consequence operations on Łukasiewicz's sentential calculi. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 19 (1976), 239-247.
  44. W ÓJCICKI, R. Theory of logical calculi. Basic theory of consequence operations, vol. 199 of Synthese Library. Reidel, Dordrecht, 1988. Faculty of Mathematics, University of Barcelona Gran Via 585, E-08007 Barcelona, Spain font@mat.ub.es

Related papers

Chapter 3: Applications to Protoalgebraic and Algebraizable Logics
Ramon Jansana

2009

One of the most important classes of sentential logics from the point of view of their algebraization is the class of the protoalgebraic logics. As defined in Blok and Pigozzi [1986], a sentential logic is protoalgebraic when for any Γ ∈ T hS, any two formulas equivalent modulo Ω F m (Γ) are also S-interderivable modulo Γ ; that is, when for any Γ ∈ T hS and any ϕ, ψ ∈ F m,

View PDFchevron_right
Leibniz and Suszko Filters for Non-Protoalgebraic Logics
Ramon Jansana

2016

Protoalgebraic logics are the logics that have a very weak form of implication, namely a set of formulas x ⇒ y in two variables that collectively satisfy modus ponens (x, x ⇒ y ` y) and identity ( ` x ⇒ x). In the study of this class of logics, Leibniz filters (introduced in [6]) play a fundamental rôle. They allow to associate with every protoalgebraic logic S, the logic defined by its Leibniz filters, known as the strong version of S. The study of the interplay of the two logics provides some light on the phenomena of pairs of logics strongly related that we find in many areas of non-classical logics. For example, the global modal consequence relation of the class of all Kripke frames is the strong version of the local modal consequence given by that class, and the algebraizable logic of the orthomodular lattices is the strong version of the logic preserving degrees of truth of this variety of algebras. Only very well-behaved protoalgebraic logics coincide with their strong versi...

View PDFchevron_right
Residuated Lattices: an algebraic glimpse at logics without contraction
Tomasz Kowalski

2000

View PDFchevron_right
Logics preserving degrees of truth from varieties of residuated lattices
Lluis Godo

Journal of Logic and Computation, 2012

Let K be a variety of (commutative, integral) residuated lattices. The substructural logic usually associated with K is an algebraizable logic that has K as its equivalent algebraic semantics, and is a logic that preserves truth, i.e., 1 is the only truth value preserved by the inferences of the logic. In this paper we introduce another logic associated with K, namely the logic that preserves degrees of truth, in the sense that it preserves lower bounds of truth values in inferences. We study this second logic mainly from the point of view of abstract algebraic logic. We determine its algebraic models and we classify it in the Leibniz and the Frege hierarchies: we show that it is always fully selfextensional, that for most varieties K it is non-protoalgebraic, and that it is algebraizable if and only K is a variety of generalized Heyting algebras, in which case it coincides with the logic that preserves truth. We also characterize the new logic in three ways: by a Hilbert style axiomatic system, by a Gentzen style sequent calculus, and by a set of conditions on its closure operator. Concerning the relation between the two logics, we prove that the truth preserving logic is the extension of the one that preserves degrees of truth with either the rule of Modus Ponens or the rule of Adjunction for the fusion connective.

View PDFchevron_right
On universal algebraic constructions of logics
Hajnal Andréka

Studia Logica, 1977

View PDFchevron_right

Related topics

  • Mathematics
    • 580 California St., Suite 400
    San Francisco, CA, 94104
    © 2025 Academia. All rights reserved