Proof systems combining classical and paraconsistent negations

DOI10.1007/s11225-009-9173-6zbMath1171.03012OpenAlexW1984851236MaRDI QIDQ1015485

Norihiro Kamide

Publication date: 8 May 2009

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11225-009-9173-6

zbMATH Keywords

completenesscut eliminationsequent calculusparaconsistent negation

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Paraconsistent logics (03B53)

Related Items (4)

Taming Paraconsistent (and Other) Logics ⋮ Modal multilattice logic ⋮ A strong and rich 4-valued modal logic without Łukasiewicz-type paradoxes ⋮ A hierarchy of weak double negations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Gentzen-type methods for bilattice negation
• Some useful 16-valued logics: How a computer network should think
• Hyper-contradictions, generalized truth values and logics of truth and falsehood
• The logic of information structures
• Intuitive semantics for first-degree entailments and `coupled trees'
• Reasoning with logical bilattices
• Constructible falsity and inexact predicates
• The Trilattice of Constructive Truth Values
• Knowledge, Uncertainty and Ignorance in Logic: Bilattices and beyond
• Proof theory

This page was built for publication: Proof systems combining classical and paraconsistent negations