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

DOI10.1007/s10992-020-09553-wzbMath1485.03060OpenAlexW3017308489MaRDI QIDQ830398

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

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

Related Items (4)

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

Cites Work

• Classical negation and expansions of Belnap-Dunn logic
• Ideal paraconsistent logics
• Proof theory of Nelson's paraconsistent logic: a uniform perspective
• Some useful 16-valued logics: How a computer network should think
• Intuitionistic logic with strong negation
• The value of the four values
• The logic of information structures
• What is negation?
• Four-valued paradefinite logics
• Handbook of philosophical logic. Vol. 6
• Intuitive semantics for first-degree entailments and `coupled trees'
• Reasoning with logical bilattices
• Embedding from multilattice logic into classical logic and vice versa
• Truth, Falsehood, Information and Beyond: The American Plan Generalized
• Constructible falsity and inexact predicates
• On the Methodology of Paraconsistent Logic
• Yet another paradefinite logic: The role of conflation1
• Trilattice logic: an embedding-based approach
• Connexive implication
• A propositional logic with subjunctive conditionals
• Constructible falsity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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