In this paper we consider the theory of predicate logics in which the principle of bivalence or the principle of noncontradiction 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 generalize to partial and paraconsistent logics once the right setup is chosen. Our logic L4 has a semantics that also underlies Belnap’s logic 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. © 1999 by the University of Notre Dame. All rights reserved.
CITATION STYLE
Muskens, R. (1999). On Partial and Paraconsistent Logics. Notre Dame Journal of Formal Logic, 40(3), 352–374. https://doi.org/10.1305/ndjfl/1022615616
Mendeley helps you to discover research relevant for your work.