Completeness and cut-elimination theorems for trilattice logics

DOI10.1016/j.apal.2011.03.001zbMath1225.03024OpenAlexW2066884271MaRDI QIDQ639681

Heinrich Wansing, Norihiro Kamide

Publication date: 22 September 2011

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2011.03.001

zbMATH Keywords

co-ordinate valuation semanticsMaehara's methodSchütte's methodsequent systemstrilattice \(\mathit{SIXTEEN}_3\)trilattice logic

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Many-valued logic (03B50)

Related Items (1)

Gentzenization of trilattice logics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Truth and falsehood. An inquiry into generalized logical values
• 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
• Intuitive semantics for first-degree entailments and `coupled trees'
• Reasoning with logical bilattices
• Evidential bilattice logic and lexical inference
• The power of Belnap: sequent systems for \(SIXTEEN_{3 }\)
• Intuitionistic Trilattice Logics
• SEQUENT CALCULI FOR SOME TRILATTICE LOGICS
• Bilattices and the semantics of logic programming
• The Trilattice of Constructive Truth Values
• Knowledge, Uncertainty and Ignorance in Logic: Bilattices and beyond
• The structure of interlaced bilattices
• Proof theory

This page was built for publication: Completeness and cut-elimination theorems for trilattice logics