Kripke-completeness and cut-elimination theorems for intuitionistic paradefinite logics with and without quasi-explosion

DOI10.1007/S10992-020-09553-WMaRDI QIDQ830398zbMATHOpenAlexFDO

Authors Norihiro Kamide

Publication date 7 May 2021

Published in Journal of Philosophical Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10992-020-09553-w

zbMATH Keywords

cut-elimination theoremand Zamansky's ideal paraconistent four-valued logic 4CCArieliAvronKripke-completeness theoremNelson's paraconsistent four-valued logic N4Wansing's basic constructive connexive logic C

Mathematics Subject Classification ID

Many-valued logic (03B50) Paraconsistent logics (03B53) Cut-elimination and normal-form theorems (03F05) Subsystems of classical logic (including intuitionistic logic) (03B20)

Recommendations

• Yet another paradefinite logic: The role of conflation1
• scientific article; zbMATH DE number 6407640
• An embedding-based completeness proof for Nelson's paraconsistent logic
• scientific article; zbMATH DE number 575581
• Completeness and cut-elimination for first-order ideal paraconsistent four-valued logic

Cites work

• scientific article; zbMATH DE number 5872210 (Why is no real title available?)
• scientific article; zbMATH DE number 3659563 (Why is no real title available?)
• scientific article; zbMATH DE number 3659568 (Why is no real title available?)
• scientific article; zbMATH DE number 6407640 (Why is no real title available?)
• scientific article; zbMATH DE number 3333259 (Why is no real title available?)
• scientific article; zbMATH DE number 3074070 (Why is no real title available?)
• A propositional logic with subjunctive conditionals
• Classical negation and expansions of Belnap-Dunn logic
• Connexive implication
• Connexive modal logic
• Constructible falsity
• Constructible falsity and inexact predicates
• Embedding from multilattice logic into classical logic and vice versa
• Four-valued paradefinite logics
• Handbook of philosophical logic. Vol. 6
• Ideal paraconsistent logics
• Intuitionistic logic with strong negation
• Intuitive semantics for first-degree entailments and `coupled trees'
• Minimal paradefinite logics for reasoning with incompleteness and inconsistency
• On the methodology of paraconsistent logic
• Proof theory of Nelson's paraconsistent logic: a uniform perspective
• Reasoning with logical bilattices
• Some useful 16-valued logics: How a computer network should think
• The logic of information structures
• The value of the four values
• Theory of effective propositional paraconsistent logics
• Trilattice logic: an embedding-based approach
• Truth, falsehood, information and beyond: the American plan generalized
• What is negation?
• Yet another paradefinite logic: The role of conflation1

Cited in

(4)

• An infinity of intuitionistic connexive logics
• An extended paradefinite logic combining conflation, paraconsistent negation, classical negation, and classical implication: how to construct Nice Gentzen-type sequent calculi
• Embedding friendly first-order paradefinite and connexive logics
• Connexive logic, connexivity, and connexivism: remarks on terminology

This page was built for publication: Kripke-completeness and cut-elimination theorems for intuitionistic paradefinite logics with and without quasi-explosion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q830398)