Trilattice logic: an embedding-based approach

DOI10.1093/logcom/exu019zbMath1348.03025OpenAlexW1996969588MaRDI QIDQ5262476

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

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

Mathematics Subject Classification ID

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

Related Items (5)

Kripke-completeness and cut-elimination theorems for intuitionistic paradefinite logics with and without quasi-explosion ⋮ Modal multilattice logic ⋮ Paraconsistent double negations as classical and intuitionistic negations ⋮ Kripke completeness of bi-intuitionistic multilattice logic and its connexive variant ⋮ Unnamed Item

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