Labeled calculi and finite-valued logics

被引：27
|
作者：
Baaz M. [1 ]
Fermüllbr C.G. [2 ]
Salzer G. [2 ]
Zach R. [2 ,3 ]
机构：
[1] Institut für Algebra und Diskrete Mathematik E118.2, Technische Universität Wien
[2] Institut für Computersprachen E185.2, Technische Universität Wien
[3] Group in Logic and the Methodology of Science, University of California, Berkeley
来源：
Studia Logica | 1998年 / 61卷 / 1期
关键词：
Finite-valued logic; Labeled calculus; Sets-as-signs; Signed formula;
D O I：
10.1023/A:1005022012721
中图分类号：
学科分类号：
摘要：
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 (sets-as-signs). 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. ©1998 Kluwer Academic Publishers.
引用
收藏
页码：7 / 33
页数：26
相关论文
共 50 条
12345