Trilattice logic: an embedding-based approach

DOI10.1093/LOGCOM/EXU019MaRDI QIDQ5262476zbMATH OpenOpenAlexFDO

Authors Norihiro Kamide

Publication date 15 July 2015

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/logcom/exu019

zbMATH Keywords

completeness theoremsCraig interpolationcut-eliminationMaksimova separation theoremsparaconsistent many-valued logicstrilattice logics

Mathematics Subject Classification ID

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

Recommendations

• Completeness and cut-elimination theorems for trilattice logics
• The Trilattice of Constructive Truth Values
• Intuitionistic Trilattice Logics
• Interpolation in 16-valued trilattice logics
• SEQUENT CALCULI FOR SOME TRILATTICE LOGICS

Cited in

(7)

• Modal multilattice logic
• Paraconsistent double negations as classical and intuitionistic negations
• Kripke completeness of bi-intuitionistic multilattice logic and its connexive variant
• SEQUENT CALCULI FOR SOME TRILATTICE LOGICS
• scientific article; zbMATH DE number 7297101 (Why is no real title available?)
• Completeness and cut-elimination theorems for trilattice logics
• Kripke-completeness and cut-elimination theorems for intuitionistic paradefinite logics with and without quasi-explosion

This page was built for publication: Trilattice logic: an embedding-based approach

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