On Partial and Paraconsistent Logics

Notre Dame Journal of Formal Logic 40 (3):352-374 (1999)
  Copy   BIBTEX

Abstract

In this paper we consider the theory of predicate logics in which the principle of Bivalence or the principle of Non-Contradiction or both fail. Such logics are partial or paraconsistent or both. We consider sequent calculi for these logics and prove Model Existence. For L4, the most general logic under consideration, we also prove a version of the Craig-Lyndon Interpolation Theorem. The paper shows that many techniques used for classical predicate logic generalise to partial and paraconsistent logics once the right set-up is chosen. Our logic L4 has a semantics that also underlies Belnap’s [4] and is related to the logic of bilattices. L4 is in focus most of the time, but it is also shown how results obtained for L4 can be transferred to several variants.

Author's Profile

Reinhard Muskens
University of Amsterdam

Analytics

Added to PP
2009-01-28

Downloads
267 (#54,523)

6 months
86 (#42,915)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?