Maximality in finite-valued Lukasiewicz logics defined by order filters

Journal of Logic and Computation 29 (1):125-156 (2019)
  Copy   BIBTEX

Abstract

In this paper we consider the logics L(i,n) obtained from the (n+1)-valued Lukasiewicz logics L(n+1) by taking the order filter generated by i/n as the set of designated elements. In particular, the conditions of maximality and strong maximality among them are analyzed. We present a very general theorem that provides sufficient conditions for maximality between logics. As a consequence of this theorem, it is shown that L(i,n) is maximal w.r.t. CPL whenever n is prime. Concerning strong maximality (i.e. maximality w.r.t. rules instead of only axioms), we provide algebraic arguments in order to show that the logics L(i,n) are not strongly maximal w.r.t. CPL, even for n prime. Indeed, in such case, we show that there is just one extension between L(i,n) and CPL obtained by adding to L(i,n) a kind of graded explosion rule. Finally, using these results, we show that the logics L(i,n) with n prime and i/n < 1/2 are ideal paraconsistent logics.

Other Versions

No versions found

Links

PhilArchive

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2018-04-07

Downloads
563 (#54,827)

6 months
153 (#34,148)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Marcelo E. Coniglio
University of Campinas

References found in this work

How a computer should think.Nuel Belnap - 1977 - In Gilbert Ryle, Contemporary aspects of philosophy. Boston: Oriel Press.
Dynamic dialectical logics.Diderik Batens - 1989 - In Graham Priest, Richard Routley & Jean Norman, Paraconsistent Logic: Essays on the Inconsistent. Philosophia Verlag. pp. 187--217.
Ideal Paraconsistent Logics.O. Arieli, A. Avron & A. Zamansky - 2011 - Studia Logica 99 (1-3):31-60.

View all 10 references / Add more references