Scribd
Upload
30 views

Prop Logic - Natural Deduction - 3

This document contains lecture slides on natural deduction in propositional logic. It introduces the derived rules of modus tollens and proof by contradiction, and explains them in terms of the basic natural deduction rules. It provides examples of proofs, including proving De Morgan's laws and the law of excluded middle. Finally, it lists some take-home exercises for students to prove sequents using natural deduction.

Uploaded by

HARSH RAJ
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
30 views

Prop Logic - Natural Deduction - 3

This document contains lecture slides on natural deduction in propositional logic. It introduces the derived rules of modus tollens and proof by contradiction, and explains them in terms of the basic natural deduction rules. It provides examples of proofs, including proving De Morgan's laws and the law of excluded middle. Finally, it lists some take-home exercises for students to prove sequents using natural deduction.

Uploaded by

HARSH RAJ
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

CS F214

Logic in CS

Propositional Logic – Natural


Deduction – Part 3
Slides by Prof. Shan B
BITS Pilani Jagat Sesh Challa
Pilani Campus
CS F214
Logic in CS
BITS Pilani
Pilani Campus

Natural Deduction: Derived Rules, Proofs - Examples

Jagat Sesh Challa CS F214 - Logic in Computer Science CSIS, BITS Pilani, Pilani Campus
Modus Tollens

φ→ψ ¬ψ
MT (modus tollens)

¬φ

Questions: What is the relation between this and


modus ponens?

How do you derive this rule (from the basic rules)?

Jagat Sesh Challa CS F214 - Logic in Computer Science CSIS, BITS Pilani, Pilani Campus
Proof by Contradiction

¬φ •One can infer anything from a


. contradiction.
.
. PbC
•But in this case the contradiction
⊥ resulted from an assumption i.e. ¬
φ
φ •Therefore it is meaningful to infer
φ that the assumption led to the
contradiction
• In fact one must infer φ to
eliminate the assumption ¬ φ.
• Why?
Exercise: Derive PbC from the ¬ i rule.

Jagat Sesh Challa CS F214 - Logic in Computer Science CSIS, BITS Pilani, Pilani Campus
Exercises

• Prove the following:


1. ¬p Ú q ⊢ p → q
2. q → (p → r), ¬r, q ⊢ ¬p
3. p → q ⊢ ¬p Ú q
4. Use 3. to prove LEM

[These examples were worked out in class – on the board]

Jagat Sesh Challa CS F214 - Logic in Computer Science CSIS, BITS Pilani, Pilani Campus
Take-home Exercises

Prove the following sequents:


1. ¬(p Ù q) ⊢ ¬p Ú ¬q
2. p → q, r → s ⊢ p Ú r → q Ú s
3. (p → r) Ù (q → r) ⊢ p Ù q → r

Jagat Sesh Challa CS F214 - Logic in Computer Science CSIS, BITS Pilani, Pilani Campus

You might also like