On Semilattice-based Logics with an Algebraizable Assertional Companion

Josep Maria Font

Abstrakt

This paper studies some properties of the so-called semilattice-based logics (which are defined in a standard way using only the order relation from a variety of algebras that have a semilattice reduct with maximum) under the assumption that its companion assertional logic (defined from the same variety of algebras using the top element as representing truth) is algebraizable. This describes a very common situation, and the conclusion of the paper is that these semilattice-based logics exhibit some of the good behaviour of protoalgebraic logics, without being necessarily so. The main result is that all these logics have enough Leibniz filters, a fact previously known in the literature to occur only for protoalgebraic logics. Another significant result is that the two companion logics coincide if and only if one of them enjoys the characteristic property of the other, that is, if and only if the semilattice-based logic is algebraizable, and if and only if its assertional companion is selfextensional. When these conditions are met, then the (unique) logic is finitely, regularly and strongly algebraizable and fully Fregean; this places it at some of the highest ranks in both the Leibniz hierarchy and the Frege hierarchy.

Słowa kluczowe: semilattice-based logics, assertional logic, frege hierarchy
References
[1] G. Birkhoff, Lattice Theory, 3rd. ed., vol. XXV of Colloquium Publications. American Mathematical Society, Providence, 1973. (1st. ed. 1940). 
[2] W. Blok and D. Pigozzi, Protoalgebraic logics. Studia Logica 45 (1986), pp. 337–369. 
[3] W. Blok and J. G. Raftery, Ideals in quasivarieties of algebras. In Models, algebras and proofs, X. Caicedo and C. H. Montenegro, Eds., vol. 203 of Lecture Notes in Pure and Applied Mathematics. Marcel Dekker, New York, 1999, pp. 167–186. [4] F. Bou, F. Esteva, J. M. Font, A. Gil, L. Godo, A. Torrens, A., and V. Verdu´, Logics preserving degrees of truth from varieties of residuated lattices. Journal of Logic and Computation 19 (2009), pp. 1031–1069. doi: 10.1093/logcom/exp030. 
[5] R. Cignoli, D. Mundici, and I. D’Ottaviano, Algebraic foundations of many-valued reasoning, vol. 7 of Trends in Logic - Studia Logica Library. Kluwer Academic Publishers, Dordrecht, 2000. 
[6] J. Czelakowski, Protoalgebraic logics, vol. 10 of Trends in Logic - Studia Logica Library. Kluwer Academic Publishers, Dordrecht, 2001. 
[7] J. Czelakowski and R. Jansana, Weakly algebraizable logics. The Journal of Symbolic Logic 65 (2000), pp. 641–668. 
[8] J. Czelakowski and D. Pigozzi, Fregean logics. Annals of Pure and Applied Logic 127 (2004), pp. 17–76.
[9] J. M. Font, An abstract algebraic logic view of some multiple-valued logics. In Beyond two: Theory and applications of multiple-valued logic, M. Fitting and E. Orlowska, Eds., vol. 114 of Studies in Fuzziness and Soft Computing. Physica-Verlag, Heidelberg, 2003, pp. 25–58.
[10] J. M. Font, Generalized matrices in abstract algebraic logic. In Trends in Logic. 50 years of Studia Logica, V. F. Hendriks and J. Malinowski, Eds., vol. 21 of Trends in Logic - Studia Logica Library. Kluwer Academic Publishers, Dordrecht, 2003, pp. 57–86.
[11] J. M. Font, Taking degrees of truth seriously. Studia Logica (Special issue on Truth Values, Part I) 91 (2009), pp. 383–406.
[12] J. M. Font, A. Gil, A. Torrens, and V. Verdu´, On the infinite-valued L ukasiewicz logic that preserves degrees of truth. Archive for Mathematical Logic 45 (2006), pp. 839–868.
[13] J. M. Font, F. Guzma´n, and V. Verdu´, Characterization of the reduced matrices for the {∧, ∨}-fragment of classical logic. Bulletin of the Section of Logic 20 (1991), pp. 124–128.
[14] J. M. Font and R. Jansana, A general algebraic semantics for sentential logics, vol. 7 of Lecture Notes in Logic. Springer-Verlag, 1996. Out of print. Second revised edition published in 2009 by the Association for Symbolic Logic, freely available through Project Euclid at http://projecteuclid.org/euclid.lnl/1235416965.
[15] J. M. Font and R. Jansana, Leibniz filters and the strong version of a protoalgebraic logic. Archive for Mathematical Logic 40 (2001), pp. 437–465.
[16] Font, J. M., and Jansana, R. Leibniz-linked pairs of deductive systems. Studia Logica, to appear.
[17] J. M. Font, R. Jansana, and D. Pigozzi, A survey of abstract algebraic logic. Studia Logica (Special issue on Abstract Algebraic Logic, Part II) 74 (2003), 13–97. With an update in vol. 91 (2009), 125–130.
[18] J. M. Font and G. Rodr´ıguez, Note on algebraic models for relevance logic. Zeitschrift fu¨r Mathematische Logik und Grundlagen der Mathematik 36 (1990), pp. 535–540.
[19] J. M. Font and G. Rodr´ıguez, Algebraic study of two deductive systems of relevance logic. Notre Dame Journal of Formal Logic 35 (1994), 369–397.
[20] J. M. Font and V. Verdu´, Algebraic logic for classical conjunction and disjunction. Studia Logica (Special issue on Algebraic Logic) 50 (1991), 391–419.
[21] N. Galatos, P. Jipsen, T. Kowalski, and H. Ono, Residuated lattices: an algebraic glimpse at substructural logics, vol. 151 of Studies in Logic and the Foundations of Mathematics. Elsevier, Amsterdam, 2007.
[22] P. H´ajek, Metamathematics of fuzzy logic, vol. 4 of Trends in Logic - Studia Logica Library. Kluwer Academic Publishers, Dordrecht, 1998.
[23] R. Jansana, Leibniz filters revisited. Studia Logica 75 (2003), pp. 305–317.
[24] R. Jansana, Selfextensional logics with a conjunction. Studia Logica 84 (2006), pp. 63–104.
[25] J. Malinowski, Modal equivalential logics. Journal of Non-Classical Logic 3 (1986), pp. 13–35.
[26] M. Nowak, A characterization of consequence operations preserving degrees of truth. Bulletin of the Section of Logic 16 (1987), pp. 159–166.
[27] M. Nowak, Logics preserving degrees of truth. Studia Logica 49 (1990), pp. 483–499.
[28] R. W´ojcicki, Lectures on propositional calculi. Ossolineum, Wroc law, 1984.
[29] R. W´ojcicki, Theory of logical calculi. Basic theory of consequence operations, vol. 199 of Synth`ese Library. Reidel, Dordrecht, 1988.

Czasopismo ukazuje się w sposób ciągły on-line.
Pierwotną formą czasopisma jest wersja elektroniczna.