Labeled calculi and finite-valued logics

Studia Logica 61 (1):7-33 (1998)
Download Edit this record How to cite View on PhilPapers
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.
Reprint years
2004
PhilPapers/Archive ID
BAALCA
Upload history
Archival date: 2017-08-13
View other versions
Added to PP index
2009-01-28

Total views
120 ( #32,196 of 52,999 )

Recent downloads (6 months)
9 ( #44,571 of 52,999 )

How can I increase my downloads?

Downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.