# 02h - Discrete Mathematics Propositional Logic 2-2 Use of...

This preview shows pages 1–2. Sign up to view the full content.

1 Introduction Propositional Logic Discrete Mathematics Andrei Bulatov Discrete Mathematics – Propositional Logic 2-2 Use of Logic In mathematics and rhetoric: s Give precise meaning to statements. s Distinguish between valid and invalid arguments. s Provide rules of `correct’ reasoning. Natural language can be very ambiguous `If you do your homework, then you’ll get to watch the game.’ `You do your homework, or you’ll fail the exam.’ = `If you don’t do your homework, then you’ll fail the exam.’ `If you don’t do your homework, then you will not get to watch . ..’ Discrete Mathematics – Propositional Logic 2-3 Use of Logic (cntd) In computing: s Derive new data / knowledge from existing facts s Design of computer circuits. s Construction of computer programs. s Verification of correctness of programs and circuit design. s Specification What the customer real y needed How the Programmer understood it What the customer got Discrete Mathematics – Propositional Logic 2-4 Statements (propositions) Propositional logic deals with statements and their truth values A statement is a declarative sentence that can be true or false Truth values are TRUTH (T or 1) and FALSE (F or 0). Examples: - 1 + 1 = 2 (statement, T) - The moon is made of cheese (statement, F) - Go home! (not statement, imperative) - What a beautiful garden! (not statement, exclamation) - Alice said, `What a beautiful garden!’ (statement, depends on Alice) - y + 1 = 2 (not statement, uncertain) - The God exists (statement, ?) Discrete Mathematics – Propositional Logic 2-5 Compound Statements We cannot decide the truth value of a primitive statement. This is not what logic does. Instead we combine primitive statements by means of

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 05/18/2010 for the course MACM MACM 101 taught by Professor Andreibulatov during the Spring '10 term at Simon Fraser.

### Page1 / 4

02h - Discrete Mathematics Propositional Logic 2-2 Use of...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online