Deriving natural deduction rules from truth tables

Herman Geuvers, Tonny Hurkens

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

4 Citaten (Scopus)

Samenvatting

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”.

Originele taal-2Engels
TitelLogic and Its Applications - 7th Indian Conference, ICLA 2017, Proceedings
RedacteurenSujata Ghosh, Sanjiva Prasad
Plaats van productieBerlin
UitgeverijSpringer
Pagina's123-138
Aantal pagina's16
ISBN van elektronische versie978-3-662-54069-5
ISBN van geprinte versie978-3-662-54068-8
DOI's
StatusGepubliceerd - 1 jan 2017
Evenement7th Indian Conference on Logic and Its Applications, ICLA 2017 - Kanpur, India
Duur: 5 jan 20177 jan 2017

Publicatie series

NaamLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10119 LNCS
ISSN van geprinte versie0302-9743
ISSN van elektronische versie1611-3349

Congres

Congres7th Indian Conference on Logic and Its Applications, ICLA 2017
Land/RegioIndia
StadKanpur
Periode5/01/177/01/17

Vingerafdruk

Duik in de onderzoeksthema's van 'Deriving natural deduction rules from truth tables'. Samen vormen ze een unieke vingerafdruk.

Citeer dit