# Labeled calculi and finite-valued logics

*Studia Logica*61 (1):7-33 (1998)

**Abstract**

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.

**Categories**

(categorize this paper)

**Reprint years**

2004

**PhilPapers/Archive ID**

BAALCA

**Revision history**

Archival date: 2017-08-13

View upload history

View upload history

References found in this work BETA

No references found.

Citations of this work BETA

Hypersequent and Display Calculi – a Unified Perspective.Ciabattoni, Agata; Ramanayake, Revantha & Wansing, Heinrich

The Power of Belnap: Sequent Systems for SIXTEEN ₃. [REVIEW]Wansing, Heinrich

Herzberger’s Limit Rule with Labelled Sequent Calculus.Fjellstad, Andreas

View all 11 citations / Add more citations

**Added to PP index**

2009-01-28

**Total views**

108 ( #28,698 of 45,655 )

**Recent downloads (6 months)**

19 ( #34,683 of 45,655 )

How can I increase my downloads?

**Downloads since first upload**

*This graph includes both downloads from PhilArchive and clicks to external links.*