Systematic Construction of Natural Deduction Systems for Many-valued Logics: Extended Report
Matthias Baaz, Christian G. Fermüller, Richard Zach
Abstract
Open-access reader
Matthias Baaz, Christian G. Fermüller, Richard Zach
Abstract
Open-access reader
We exhibit a construction principle for natural deduction systems for arbitrary finitely-many-valued first order logics. These systems are systematically obtained from sequent calculi, which in turn can be 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 the natural deduction systems.
OpenAlex reports 8 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We exhibit a construction principle for natural deduction systems for arbitrary finitely-many-valued first order logics. These systems are systematically obtained from sequent calculi, which in turn can be 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 the natural deduction systems.
Key concepts: Soundness, Sequent, Natural deduction, Sequent calculus, Completeness (order theory), Mathematics, Calculus (dental), Cut-elimination theorem