Studia Logica 61 (1998) 7–33
(with Matthias Baaz, Christian G. Fermüller, and Gernot Salzer)
A general class of labeled sequent calculi is investigated, and necessary and sufficient conditions are given for when such a calculus is sound and complete for a finitevalued logic if the labels are interpreted as sets of truth values (setsassigns). Furthermore, it is shown that any finitevalued logic can be given an axiomatization by such a labeled calculus using arbitrary "systems of signs," i.e., of sets of truth values, as labels. The number of labels needed is logarithmic in the number of truth values, and it is shown that this bound is tight.
Radim Belohlávek (Mathematical Reviews 99m:03043)