Dual Systems of Sequents and Tableaux for Many-Valued Logics

Bulletin of the EATCS 51:192-197 (1993)
Download Edit this record How to cite View on PhilPapers
Abstract
The aim of this paper is to emphasize the fact that for all finitely-many-valued logics there is a completely systematic relation between sequent calculi and tableau systems. More importantly, we show that for both of these systems there are al- ways two dual proof sytems (not just only two ways to interpret the calculi). This phenomenon may easily escape one’s attention since in the classical (two-valued) case the two systems coincide. (In two-valued logic the assignment of a truth value and the exclusion of the opposite truth value describe the same situation.)
PhilPapers/Archive ID
BAADSO
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

Add more citations

Added to PP index
2017-08-13

Total views
31 ( #31,681 of 37,290 )

Recent downloads (6 months)
11 ( #25,209 of 37,290 )

How can I increase my downloads?

Monthly downloads since first upload
This graph includes both downloads from PhilArchive and clicks to external links.