SEQUENT CALCULI FOR SOME TRILATTICE LOGICS

DOI10.1017/S1755020309090212zbMath1174.03008MaRDI QIDQ3395332

Norihiro Kamide, Heinrich Wansing

Publication date: 26 August 2009

Published in: The Review of Symbolic Logic (Search for Journal in Brave)

zbMATH Keywords

cut-eliminationtrilattice logicssequent caculus

Mathematics Subject Classification ID

Logical aspects of lattices and related structures (03G10) Cut-elimination and normal-form theorems (03F05) Many-valued logic (03B50) Proof theory in general (including proof-theoretic semantics) (03F03)

Related Items (6)

Gentzenization of trilattice logics ⋮ Completeness and cut-elimination theorems for trilattice logics ⋮ The power of Belnap: sequent systems for \(SIXTEEN_{3 }\) ⋮ Proof theory of Nelson's paraconsistent logic: a uniform perspective ⋮ A non-inferentialist, anti-realistic conception of logical truth and falsity ⋮ Analytic tableaux for all of \(\mathrm{SIXTEEN}_3\)

Cites Work

• 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
• On axiomatizing Shramko-Wansing's logic
• Intuitionistic logic with strong negation
• Intuitive semantics for first-degree entailments and `coupled trees'
• Reasoning with logical bilattices
• Constructible falsity and inexact predicates
• Sequent Calculi for Intuitionistic Linear Logic with Strong Negation
• Constructible falsity

This page was built for publication: SEQUENT CALCULI FOR SOME TRILATTICE LOGICS