Papers
Topics
Authors
Recent
2000 character limit reached

A classical-logic view of a paraconsistent logic

Published 17 Aug 2020 in cs.LO and math.LO | (2008.07292v7)

Abstract: This paper is concerned with the first-order paraconsistent logic LPQ${\supset,\mathsf{F}}$. A sequent-style natural deduction proof system for this logic is presented and, for this proof system, both a model-theoretic justification and a logical justification by means of an embedding into first-order classical logic is given. The given embedding provides both a classical-logic explanation of LPQ${\supset,\mathsf{F}}$ and a logical justification of its proof system. The major properties of this logic are also treated.

Citations (4)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.