Proof Theory of Finite-valued Logics
Files
Date
1993-09-21
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
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.
Description
Keywords
many-valued logic, sequent calculus, natural deduction, resolution
Citation
Zach, R. (1993). Proof Theory of Finite-valued Logics (Unpublished thesis). Technische Universität Wien, Vienna, Austria.