Trilattice logic: an embedding-based approach

DOI10.1093/LOGCOM/EXU019zbMATH Open1348.03025OpenAlexW1996969588MaRDI QIDQ5262476FDOQ5262476

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

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

zbMATH Keywords

Craig interpolationcut-eliminationcompleteness theoremstrilattice logicsMaksimova separation theoremsparaconsistent many-valued logics

Mathematics Subject Classification ID

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

Cited In (6)

• Kripke-completeness and cut-elimination theorems for intuitionistic paradefinite logics with and without quasi-explosion
• Kripke completeness of bi-intuitionistic multilattice logic and its connexive variant
• Paraconsistent double negations as classical and intuitionistic negations
• SEQUENT CALCULI FOR SOME TRILATTICE LOGICS
• Modal multilattice logic
• Title not available (Why is that?)

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)