Labeled calculi and finite-valued logics

Studia Logica 61 (1):7-33 (1998)
  Copy   BIBTEX


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 finite -valued logic if the labels are interpreted as sets of truth values. Furthermore, it is shown that any finite -valued 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.


Added to PP

230 (#77,385)

6 months
55 (#69,574)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Richard Zach
University of Calgary
Gernot Salzer
Vienna University of Technology

References found in this work

First-order logic.Raymond Merrill Smullyan - 1968 - New York [etc.]: Springer Verlag.
Proof theory.Gaisi Takeuti - 1976 - New York, N.Y., U.S.A.: Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co..
Natural 3-valued logics—characterization and proof theory.Arnon Avron - 1991 - Journal of Symbolic Logic 56 (1):276-294.
Proof Theory of Finite-valued Logics.Richard Zach - 1993 - Dissertation, Technische Universität Wien
Elimination of Cuts in First-order Finite-valued Logics.Matthias Baaz, Christian G. Fermüller & Richard Zach - 1993 - Journal of Information Processing and Cybernetics EIK 29 (6):333-355.

View all 7 references / Add more references