Labeled calculi and finite-valued logics

Studia Logica 61 (1):7-33 (1998)
Download Edit this record How to cite View on PhilPapers
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.
Reprint years
PhilPapers/Archive ID
Revision history
Archival date: 2017-08-13
View upload history
References found in this work BETA

No references found.

Add more references

Citations of this work BETA
The Logics of Strict-Tolerant Logic.Barrio, Eduardo; Rosenblatt, Lucas & Tajer, Diego
Hypersequent and Display Calculi – a Unified Perspective.Ciabattoni, Agata; Ramanayake, Revantha & Wansing, Heinrich

View all 11 citations / Add more citations

Added to PP index

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.