15.08.2013 Views

General Computer Science 320201 GenCS I & II Lecture ... - Kwarc

General Computer Science 320201 GenCS I & II Lecture ... - Kwarc

General Computer Science 320201 GenCS I & II Lecture ... - Kwarc

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

int their proofs, and second we show how to extend this “calculus of natural deduction” to the<br />

full language of “mathtalk”.<br />

We will now introduce the “natural deduction” calculus for propositional logic. The calculus was<br />

created in order to model the natural mode of reasoning e.g. in everyday mathematical practice.<br />

This calculus was intended as a counter-approach to the well-known Hilbert style calculi, which<br />

were mainly used as theoretical devices for studying reasoning in principle, not for modeling<br />

particular reasoning styles.<br />

Rather than using a minimal set of inference rules, the natural deduction calculus provides<br />

two/three inference rules for every connective and quantifier, one “introduction rule” (an inference<br />

rule that derives a formula with that symbol at the head) and one “elimination rule” (an inference<br />

rule that acts on a formula with this head and derives a set of subformulae).<br />

Calculi: Natural Deduction (ND 0 ) [Gentzen’30]<br />

Idea: ND 0 tries to mimic human theorem proving behavior (non- minimal)<br />

Definition 327 The ND 0 calculus has rules for the introduction and elimination of connectives<br />

Introduction Elimination Axiom<br />

A B<br />

A ∧ B ∧I<br />

[A] 1<br />

B<br />

A ⇒ B ⇒I1<br />

A ∧ B<br />

A ∧El<br />

A ∧ B<br />

B ∧Er<br />

A ⇒ B A<br />

⇒E<br />

B<br />

A ∨ ¬A TND<br />

TND is used only in classical logic (otherwise constructive/intuitionistic)<br />

c○: Michael Kohlhase 195<br />

The most characteristic rule in the natural deduction calculus is the ⇒I rule. It corresponds to<br />

the mathematical way of proving an implication A ⇒ B: We assume that A is true and show B<br />

from this assumption. When we can do this we discharge (get rid of) the assumption and conclude<br />

A ⇒ B. This mode of reasoning is called hypothetical reasoning. Note that the local hypothesis<br />

is discharged by the rule ⇒I , i.e. it cannot be used in any other part of the proof. As the ⇒I<br />

rules may be nested, we decorate both the rule and the corresponding assumption with a marker<br />

(here the number 1).<br />

Let us now consider an example of hypothetical reasoning in action.<br />

Natural Deduction: Examples<br />

103

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!