Embedding from multilattice logic into classical logic and vice versa.

This article presents some theorems for syntactic and semantic embeddings of a Gentzen-type sequent calculus ML_n for multilattice logic into a Gentzen-type sequent calculus LK for classical logic and vice versa. These embedding theorems are used to prove cut-elimination, decidability and completeness theorems for ML_n, as well as a modified Craig interpolation theorem. Some of these results are then extended to the first-order system FML_n with implications and co-implications. [ABSTRACT FROM AUTHOR]