Belnap's Four-Valued Logic and De Morgan Lattices

نویسنده

  • Josep Maria Font
چکیده

In my paper [3], recently published in this Journal, I study several aspects of the relations between Belnap's logic B and the class DM of De Morgan lattices. Some of these relations concern a Gentzen system for Belnap's logic, denoted by G B , which was introduced in 1988 by my colleague Ventura Verdú and me (see [5] and [6]); indeed, the study of this Gentzen system within the theory of full models developed in [4] is one of the main objects of my paper. In the final part of Section 4 I compare this Gentzen system with another, better known one denoted by G BL , specially in the framework of the theory of algebraizability of Gentzen systems developed in [9, 10]. The reader should take note that an algebraic study of a non-structural and multiple-conclusion version of the Gentzen system G BL , denoted by G B , has been published by Mr. Alexej Pynko in [8] (already quoted in [3]). There, in comments following Corollary 3.6 on page 449, G B is compared to G B (there denoted by G FV) and results parallel to those in Proposition 4.10 of [3] are obtained. Further, it is worth noticing that the results in Theorems 4.11 and 4.12 of [3] were first obtained by Pynko in his unpublished manuscript [7]. In it he develops a theory of algebraizability of sentential-like logical systems of the most general kind, which encompasses Willem Blok and Don Pigozzi's original theory [1], its extension to k-dimensional deductive systems [2], and also its extension to Gentzen systems by Jordi Rebagliato and Ventura Verdú [9, 10], on which [3] relies. In the final Section 4.5 of [7] the three above mentioned Gentzen systems are presented, together with the structural and multiple-conclusion versions G BC and G BC of G B and G BL , respectively. Then Theorem 4.88 of [7] states the same as Theorem 4.11 of [3], that is, the strong algebraizability of G B (denoted by G BC in [7]), with the variety DM of De Morgan lattices as its equivalent algebraic semantics. And Theorem 4.98 of [7] states the non-algebraizability of G BC , which is proved from the strong algebraizability of G BC ; since it is obvious that the same fact and proof hold for their single-conclusion fragments, one can consider that this result also contains the non-algebraizability of G BL …

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Priestley duality for (modal) N4-lattices

N4-lattices are the algebraic semantics of paraconsistent Nelson logic, which was introduced in [1] as an inconsistency-tolerant counterpart of the better-known logic of Nelson [7, 13]. Paraconsistent Nelson logic combines interesting features of intuitionistic, classical and many-valued logics (e.g., Belnap-Dunn four-valued logic); recent work has shown that it can also be seen as one member o...

متن کامل

Combining Explicit Negation and Negation by Failure via Belnap's Logic Combining Explicit Negation and Negation by Failure via Belnap's Logic

This paper deals with logic programs containing two kinds of negation: negation as failure and explicit negation, allowing two diierent forms of uncertainty reasoning in the presence of incomplete information. Such programs have been introduced by Gelfond and Lifschitz and called extended programs. We provide them with a logical semantics in the style of Kunen, based on Belnap's four-valued log...

متن کامل

Revision by Translation

In this paper, we show that it is possible to accomplish belief revision in any logic which is translatable to classical logic. We start with the example of the propositional modal logic K and show that a belief operation in K de ned in terms of K0s translation to classical logic veri es the AGM postulates. We also consider the case of non-classical logics by taking Belnap's four-valued logic [...

متن کامل

Combining Explicit Negation and Negation by Failure Via Belnap's Logic

This paper deals with logic programs containing two kinds of negation: negation as failure and explicit negation. This allows two diierent forms of reasoning in the presence of incomplete information. Such programs have been introduced by Gelfond and Lifschitz and called extended programs. We provide them with a logical semantics in the style of Kunen, based on Belnap's four-valued logic, and a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Logic Journal of the IGPL

دوره 7  شماره 

صفحات  -

تاریخ انتشار 1997