A classical-logic view of a paraconsistent logic

Open Access
Authors
Publication date 17-08-2020
Edition v1
Number of pages 14
Publisher ArXiv
Organisations
  • Faculty of Science (FNWI) - Informatics Institute (IVI)
Abstract This paper is concerned with the first-order paraconsistent logic LPQ⊃,F. A sequent-style natural deduction proof system for this logic is given 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 presented. For no logic that is essentially the same as LPQ⊃,F, a natural deduction proof system is currently available in the literature. The presented embedding provides both a classical-logic explanation of this logic and a logical justification of its proof system.
Document type Preprint
Note Versions v2 (2021), v3 through v5 (2022) and v6 (2023) also available on ArXiv.
Language English
Published at https://doi.org/10.48550/arXiv.2008.07292
Downloads
Permalink to this page
Back