TY - GEN

T1 - Deriving natural deduction rules from truth tables

AU - Geuvers, Herman

AU - Hurkens, Tonny

PY - 2017/1/1

Y1 - 2017/1/1

N2 - We develop a general method for deriving natural deduction rules from the truth table for a connective. The method applies to both constructive and classical logic. This implies we can derive “constructively valid” rules for any classical connective. We show this constructive validity by giving a general Kripke semantics, that is shown to be sound and complete for the constructive rules. For the well-known connectives (˅, ˄, →, ¬) the constructive rules we derive are equivalent to the natural deduction rules we know from Gentzen and Prawitz. However, they have a different shape, because we want all our rules to have a standard “format”, to make it easier to define the notions of cut and to study proof reductions. In style they are close to the “general elimination rules” studied by Von Plato [13] and others. The rules also shed some new light on the classical connectives: e.g. the classical rules we derive for → allow to prove Peirce’s law. Our method also allows to derive rules for connectives that are usually not treated in natural deduction textbooks, like the “if- then-else”, whose truth table is clear but whose constructive deduction rules are not. We prove that “if-then-else”, in combination with ┴ and ┬, is functionally complete (all other constructive connectives can be defined from it). We define the notion of cut, generally for any constructive connective and we describe the process of “cut-elimination”.

AB - We develop a general method for deriving natural deduction rules from the truth table for a connective. The method applies to both constructive and classical logic. This implies we can derive “constructively valid” rules for any classical connective. We show this constructive validity by giving a general Kripke semantics, that is shown to be sound and complete for the constructive rules. For the well-known connectives (˅, ˄, →, ¬) the constructive rules we derive are equivalent to the natural deduction rules we know from Gentzen and Prawitz. However, they have a different shape, because we want all our rules to have a standard “format”, to make it easier to define the notions of cut and to study proof reductions. In style they are close to the “general elimination rules” studied by Von Plato [13] and others. The rules also shed some new light on the classical connectives: e.g. the classical rules we derive for → allow to prove Peirce’s law. Our method also allows to derive rules for connectives that are usually not treated in natural deduction textbooks, like the “if- then-else”, whose truth table is clear but whose constructive deduction rules are not. We prove that “if-then-else”, in combination with ┴ and ┬, is functionally complete (all other constructive connectives can be defined from it). We define the notion of cut, generally for any constructive connective and we describe the process of “cut-elimination”.

UR - http://www.scopus.com/inward/record.url?scp=85009727123&partnerID=8YFLogxK

U2 - 10.1007/978-3-662-54069-5_10

DO - 10.1007/978-3-662-54069-5_10

M3 - Conference contribution

AN - SCOPUS:85009727123

SN - 978-3-662-54068-8

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 123

EP - 138

BT - Logic and Its Applications - 7th Indian Conference, ICLA 2017, Proceedings

A2 - Ghosh, Sujata

A2 - Prasad, Sanjiva

PB - Springer

CY - Berlin

T2 - 7th Indian Conference on Logic and Its Applications, ICLA 2017

Y2 - 5 January 2017 through 7 January 2017

ER -