Dual Systems of Sequents and Tableaux for Many-Valued Logics

Bulletin of the EATCS 51:192-197 (1993)
  Copy   BIBTEX

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.)

Author Profiles

Richard Zach
University of Calgary

Analytics

Added to PP
2017-08-13

Downloads
414 (#54,551)

6 months
124 (#39,168)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?