Embedding friendly first-order paradefinite and connexive logics

DOI10.1007/S10992-022-09659-3MaRDI QIDQ2079706zbMATH OpenOpenAlexFDO

Authors Norihiro Kamide

Publication date 30 September 2022

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

Full work available at URL https://doi.org/10.1007/s10992-022-09659-3

zbMATH Keywords

completenessconnexive logiccut-eliminationembeddingparadefinite logic

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Recommendations

• Kripke-completeness and cut-elimination theorems for intuitionistic paradefinite logics with and without quasi-explosion
• Embedding operations and their application
• Yet another paradefinite logic: The role of conflation1
• scientific article; zbMATH DE number 1463147
• An embedding-based completeness proof for Nelson's paraconsistent logic

Cites work

• 40 years of FDE: an introductory overview
• A propositional logic with subjunctive conditionals
• Completeness and cut-elimination for first-order ideal paraconsistent four-valued 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
• scientific article; zbMATH DE number 5872210 (Why is no real title available?)
• scientific article; zbMATH DE number 3648682 (Why is no real title available?)
• scientific article; zbMATH DE number 3659563 (Why is no real title available?)
• scientific article; zbMATH DE number 6407640 (Why is no real title available?)
• scientific article; zbMATH DE number 3222098 (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?)
• Ideal paraconsistent logics
• Intuitionistic logic with strong negation
• Intuitive semantics for first-degree entailments and `coupled trees'
• Kripke-completeness and cut-elimination theorems for intuitionistic paradefinite logics with and without quasi-explosion
• Minimal paradefinite logics for reasoning with incompleteness and inconsistency
• Modal extension of ideal paraconsistent four-valued logic and its subsystem
• New essays on Belnap-Dunn logic
• Notes on Craig interpolation for LJ with strong negation
• Proof theory of Nelson's paraconsistent logic: a uniform perspective
• Reasoning with logical bilattices
• The logic of information structures
• The value of the four values
• Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory
• Yet another paradefinite logic: The role of conflation1

Cited in

(3)

• Unified Gentzen approach to connexive logics over Wansing's C
• Proof theory of abelian connexive logics
• Cut-elimination and normalization theorems for connexive logics over Wansing's C

This page was built for publication: Embedding friendly first-order paradefinite and connexive logics

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