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
Upload history
First archival date: 2017-08-13
Latest version: 2 (2021-06-07)
View other versions
Added to PP index
2017-08-13

Total views
95 ( #46,391 of 64,172 )

Recent downloads (6 months)
9 ( #50,092 of 64,172 )

How can I increase my downloads?

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