Refutations and Proofs in the Paraconsistent Modal Logics: KN4 and KN4.D

Studia Logica:1-24 (forthcoming)
  Copy   BIBTEX

Abstract

Axiomatic proof/refutation systems for the paraconsistent modal logics: KN4 and KN4.D are presented. The completeness proofs boil down to showing that every sequent is either provable or refutable. By constructing finite tree-type countermodels from refutations, the refined characterizations of these logics by classes of finite tree-type frames are established. The axiom systems also provide decision procedures for these logics.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,440

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Paraconsistency, self-extensionality, modality.Arnon Avron & Anna Zamansky - 2020 - Logic Journal of the IGPL 28 (5):851-880.

Analytics

Added to PP
2024-04-26

Downloads
3 (#1,717,189)

6 months
3 (#984,658)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Aristotle's Syllogistic from the Standpoint of Modern Formal Logic.JAN LUKASIEWICZ - 1951 - Revue de Métaphysique et de Morale 57 (4):456-458.
Paraconsistent modal logic.Lou Goble - 2006 - Logique Et Analyse 193:3-29.
Hybrid deduction-refutation systems for FDE-based logics.Eoin Moore - 2021 - Australasian Journal of Logic 18 (4):599-615.
Completeness Proofs for RM3 and BN4.R. T. Brady - 1982 - Logique Et Analyse 25:9-32.

View all 8 references / Add more references