Proof Theory of Finite-valued Logics

Dissertation, Technische Universit├Ąt Wien (1993)
Download Edit this record How to cite View on PhilPapers
Abstract
The proof theory of many-valued systems has not been investigated to an extent comparable to the work done on axiomatizatbility of many-valued logics. Proof theory requires appropriate formalisms, such as sequent calculus, natural deduction, and tableaux for classical (and intuitionistic) logic. One particular method for systematically obtaining calculi for all finite-valued logics was invented independently by several researchers, with slight variations in design and presentation. The main aim of this report is to develop the proof theory of finite-valued first order logics in a general way, and to present some of the more important results in this area. In Systems covered are the resolution calculus, sequent calculus, tableaux, and natural deduction. This report is actually a template, from which all results can be specialized to particular logics.
PhilPapers/Archive ID
ZACPTO
Revision history
Archival date: 2018-05-12
View upload history
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Added to PP index
2018-05-12

Total downloads
12 ( #31,422 of 33,143 )

Recent downloads (6 months)
12 ( #22,494 of 33,143 )

How can I increase my downloads?

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