Systematic construction of natural deduction systems for many-valued logics

In Proceedings of The Twenty-Third International Symposium on Multiple-Valued Logic, 1993. Los Alamitos, CA: IEEE Press. pp. 208-213 (1993)
  Copy   BIBTEX

Abstract

A construction principle for natural deduction systems for arbitrary, finitely-many-valued first order logics is exhibited. These systems are systematically obtained from sequent calculi, which in turn can be automatically extracted from the truth tables of the logics under consideration. Soundness and cut-free completeness of these sequent calculi translate into soundness, completeness, and normal-form theorems for natural deduction systems.

Author Profiles

Richard Zach
University of Calgary

Analytics

Added to PP
2017-08-13

Downloads
304 (#29,490)

6 months
28 (#41,711)

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?