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)
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.
Keywords
No keywords specified (fix it)
Categories
(categorize this paper)
PhilPapers/Archive ID
FERSCO-3
Upload history
Archival date: 2017-08-13
View other versions
View other versions
Added to PP index
2017-08-13
Total views
150 ( #29,644 of 54,658 )
Recent downloads (6 months)
20 ( #32,947 of 54,658 )
2017-08-13
Total views
150 ( #29,644 of 54,658 )
Recent downloads (6 months)
20 ( #32,947 of 54,658 )
How can I increase my downloads?
Downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
